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/doubleLoopUniformIterations.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:34:54,223 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:34:54,225 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:34:54,237 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:34:54,237 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:34:54,238 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:34:54,240 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:34:54,242 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:34:54,244 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:34:54,246 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:34:54,247 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:34:54,247 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:34:54,248 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:34:54,249 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:34:54,250 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:34:54,251 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:34:54,252 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:34:54,253 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:34:54,255 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:34:54,257 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:34:54,258 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:34:54,260 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:34:54,261 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:34:54,262 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:34:54,265 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:34:54,265 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:34:54,265 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:34:54,266 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:34:54,267 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:34:54,268 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:34:54,268 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:34:54,269 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:34:54,273 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:34:54,274 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:34:54,275 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:34:54,275 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:34:54,276 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:34:54,276 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:34:54,276 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:34:54,277 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:34:54,278 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:34:54,305 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:34:54,321 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:34:54,326 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:34:54,328 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:34:54,328 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:34:54,329 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/doubleLoopUniformIterations.bpl [2019-08-05 10:34:54,329 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/doubleLoopUniformIterations.bpl' [2019-08-05 10:34:54,363 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:34:54,364 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:34:54,365 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:34:54,365 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:34:54,366 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:34:54,384 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "doubleLoopUniformIterations.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:34:54" (1/1) ... [2019-08-05 10:34:54,393 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "doubleLoopUniformIterations.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:34:54" (1/1) ... [2019-08-05 10:34:54,401 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 10:34:54,402 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 10:34:54,402 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 10:34:54,404 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:34:54,405 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:34:54,405 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:34:54,405 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:34:54,417 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "doubleLoopUniformIterations.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:34:54" (1/1) ... [2019-08-05 10:34:54,417 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "doubleLoopUniformIterations.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:34:54" (1/1) ... [2019-08-05 10:34:54,418 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "doubleLoopUniformIterations.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:34:54" (1/1) ... [2019-08-05 10:34:54,419 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "doubleLoopUniformIterations.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:34:54" (1/1) ... [2019-08-05 10:34:54,423 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "doubleLoopUniformIterations.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:34:54" (1/1) ... [2019-08-05 10:34:54,430 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "doubleLoopUniformIterations.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:34:54" (1/1) ... [2019-08-05 10:34:54,431 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "doubleLoopUniformIterations.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:34:54" (1/1) ... [2019-08-05 10:34:54,432 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:34:54,433 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:34:54,433 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:34:54,433 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:34:54,434 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "doubleLoopUniformIterations.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:34:54" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-08-05 10:34:54,512 INFO L130 BoogieDeclarations]: Found specification of procedure Main [2019-08-05 10:34:54,513 INFO L138 BoogieDeclarations]: Found implementation of procedure Main [2019-08-05 10:34:54,764 INFO L275 CfgBuilder]: Using library mode [2019-08-05 10:34:54,765 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-08-05 10:34:54,766 INFO L202 PluginConnector]: Adding new model doubleLoopUniformIterations.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:34:54 BoogieIcfgContainer [2019-08-05 10:34:54,767 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:34:54,768 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:34:54,769 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:34:54,772 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:34:54,772 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "doubleLoopUniformIterations.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:34:54" (1/2) ... [2019-08-05 10:34:54,773 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d772c0c and model type doubleLoopUniformIterations.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:34:54, skipping insertion in model container [2019-08-05 10:34:54,773 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "doubleLoopUniformIterations.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:34:54" (2/2) ... [2019-08-05 10:34:54,775 INFO L109 eAbstractionObserver]: Analyzing ICFG doubleLoopUniformIterations.bpl [2019-08-05 10:34:54,785 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:34:54,792 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-08-05 10:34:54,811 INFO L252 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-08-05 10:34:54,839 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:34:54,840 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:34:54,840 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:34:54,840 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:34:54,840 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:34:54,840 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:34:54,841 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:34:54,841 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:34:54,841 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:34:54,856 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states. [2019-08-05 10:34:54,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 10:34:54,868 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:54,869 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 10:34:54,874 INFO L418 AbstractCegarLoop]: === Iteration 1 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:34:54,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:54,882 INFO L82 PathProgramCache]: Analyzing trace with hash 926725, now seen corresponding path program 1 times [2019-08-05 10:34:54,931 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:54,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:54,962 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:34:54,966 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:55,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:55,010 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:34:55,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-08-05 10:34:55,014 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:34:55,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:34:55,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:34:55,030 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 3 states. [2019-08-05 10:34:55,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:55,115 INFO L93 Difference]: Finished difference Result 9 states and 11 transitions. [2019-08-05 10:34:55,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:34:55,117 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-08-05 10:34:55,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:55,127 INFO L225 Difference]: With dead ends: 9 [2019-08-05 10:34:55,128 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 10:34:55,130 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:34:55,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 10:34:55,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-05 10:34:55,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 10:34:55,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2019-08-05 10:34:55,158 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 10 transitions. Word has length 4 [2019-08-05 10:34:55,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:55,158 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 10 transitions. [2019-08-05 10:34:55,158 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:34:55,159 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 10 transitions. [2019-08-05 10:34:55,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 10:34:55,159 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:55,159 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-08-05 10:34:55,160 INFO L418 AbstractCegarLoop]: === Iteration 2 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:34:55,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:55,160 INFO L82 PathProgramCache]: Analyzing trace with hash 28728519, now seen corresponding path program 1 times [2019-08-05 10:34:55,161 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:55,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:55,166 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:34:55,167 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:55,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:55,211 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:34:55,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-08-05 10:34:55,213 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:34:55,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:34:55,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:34:55,214 INFO L87 Difference]: Start difference. First operand 8 states and 10 transitions. Second operand 3 states. [2019-08-05 10:34:55,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:55,271 INFO L93 Difference]: Finished difference Result 10 states and 11 transitions. [2019-08-05 10:34:55,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:34:55,273 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-08-05 10:34:55,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:55,274 INFO L225 Difference]: With dead ends: 10 [2019-08-05 10:34:55,274 INFO L226 Difference]: Without dead ends: 7 [2019-08-05 10:34:55,275 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:34:55,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-05 10:34:55,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-05 10:34:55,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 10:34:55,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2019-08-05 10:34:55,278 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 5 [2019-08-05 10:34:55,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:55,279 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-08-05 10:34:55,279 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:34:55,279 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2019-08-05 10:34:55,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:34:55,280 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:55,280 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-08-05 10:34:55,281 INFO L418 AbstractCegarLoop]: === Iteration 3 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:34:55,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:55,282 INFO L82 PathProgramCache]: Analyzing trace with hash 891297133, now seen corresponding path program 1 times [2019-08-05 10:34:55,283 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:55,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:55,294 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:34:55,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:55,401 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:55,401 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:34:55,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:34:55,402 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:34:55,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:34:55,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:34:55,405 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 4 states. [2019-08-05 10:34:55,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:55,500 INFO L93 Difference]: Finished difference Result 8 states and 9 transitions. [2019-08-05 10:34:55,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:34:55,501 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-08-05 10:34:55,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:55,502 INFO L225 Difference]: With dead ends: 8 [2019-08-05 10:34:55,502 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 10:34:55,503 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:34:55,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 10:34:55,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-05 10:34:55,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 10:34:55,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2019-08-05 10:34:55,505 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 9 transitions. Word has length 6 [2019-08-05 10:34:55,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:55,505 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 9 transitions. [2019-08-05 10:34:55,506 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:34:55,506 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2019-08-05 10:34:55,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 10:34:55,506 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:55,507 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:34:55,507 INFO L418 AbstractCegarLoop]: === Iteration 4 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:34:55,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:55,507 INFO L82 PathProgramCache]: Analyzing trace with hash 1860345825, now seen corresponding path program 1 times [2019-08-05 10:34:55,509 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:55,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:55,522 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:34:55,523 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:55,577 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:55,577 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:55,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2] total 2 [2019-08-05 10:34:55,578 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:34:55,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:34:55,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:34:55,579 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. Second operand 4 states. [2019-08-05 10:34:55,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:55,621 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2019-08-05 10:34:55,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:34:55,621 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-08-05 10:34:55,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:55,622 INFO L225 Difference]: With dead ends: 13 [2019-08-05 10:34:55,622 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 10:34:55,623 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:34:55,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 10:34:55,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2019-08-05 10:34:55,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 10:34:55,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2019-08-05 10:34:55,626 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 12 transitions. Word has length 7 [2019-08-05 10:34:55,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:55,626 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 12 transitions. [2019-08-05 10:34:55,626 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:34:55,626 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 12 transitions. [2019-08-05 10:34:55,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:34:55,627 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:55,627 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-08-05 10:34:55,627 INFO L418 AbstractCegarLoop]: === Iteration 5 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:34:55,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:55,628 INFO L82 PathProgramCache]: Analyzing trace with hash 1836084205, now seen corresponding path program 2 times [2019-08-05 10:34:55,629 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:55,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:55,641 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:34:55,642 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:55,680 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:55,680 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:55,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 10:34:55,681 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:34:55,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:34:55,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:34:55,682 INFO L87 Difference]: Start difference. First operand 10 states and 12 transitions. Second operand 4 states. [2019-08-05 10:34:55,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:55,763 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2019-08-05 10:34:55,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:34:55,764 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-08-05 10:34:55,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:55,765 INFO L225 Difference]: With dead ends: 11 [2019-08-05 10:34:55,765 INFO L226 Difference]: Without dead ends: 9 [2019-08-05 10:34:55,765 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:34:55,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-05 10:34:55,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-08-05 10:34:55,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 10:34:55,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2019-08-05 10:34:55,767 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 8 [2019-08-05 10:34:55,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:55,768 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-08-05 10:34:55,768 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:34:55,768 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2019-08-05 10:34:55,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:34:55,769 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:55,769 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-08-05 10:34:55,769 INFO L418 AbstractCegarLoop]: === Iteration 6 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:34:55,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:55,770 INFO L82 PathProgramCache]: Analyzing trace with hash 1860095751, now seen corresponding path program 3 times [2019-08-05 10:34:55,771 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:55,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:55,780 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 10:34:55,781 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:55,857 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:55,857 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:55,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:34:55,857 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:34:55,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:34:55,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:34:55,858 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 5 states. [2019-08-05 10:34:56,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:56,036 INFO L93 Difference]: Finished difference Result 10 states and 11 transitions. [2019-08-05 10:34:56,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:34:56,037 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2019-08-05 10:34:56,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:56,037 INFO L225 Difference]: With dead ends: 10 [2019-08-05 10:34:56,037 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 10:34:56,038 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:34:56,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 10:34:56,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-08-05 10:34:56,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 10:34:56,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2019-08-05 10:34:56,041 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 11 transitions. Word has length 8 [2019-08-05 10:34:56,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:56,041 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 11 transitions. [2019-08-05 10:34:56,041 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:34:56,041 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 11 transitions. [2019-08-05 10:34:56,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 10:34:56,042 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:56,042 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2019-08-05 10:34:56,042 INFO L418 AbstractCegarLoop]: === Iteration 7 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:34:56,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:56,042 INFO L82 PathProgramCache]: Analyzing trace with hash 1828331911, now seen corresponding path program 4 times [2019-08-05 10:34:56,043 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:56,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:56,056 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 10:34:56,057 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:56,110 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:56,111 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:56,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 10:34:56,111 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:34:56,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:34:56,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:34:56,112 INFO L87 Difference]: Start difference. First operand 10 states and 11 transitions. Second operand 5 states. [2019-08-05 10:34:56,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:56,176 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2019-08-05 10:34:56,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:34:56,177 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-08-05 10:34:56,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:56,178 INFO L225 Difference]: With dead ends: 16 [2019-08-05 10:34:56,179 INFO L226 Difference]: Without dead ends: 14 [2019-08-05 10:34:56,179 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:34:56,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-05 10:34:56,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 12. [2019-08-05 10:34:56,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 10:34:56,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2019-08-05 10:34:56,182 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 9 [2019-08-05 10:34:56,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:56,183 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2019-08-05 10:34:56,183 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:34:56,183 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2019-08-05 10:34:56,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 10:34:56,183 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:56,183 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1] [2019-08-05 10:34:56,184 INFO L418 AbstractCegarLoop]: === Iteration 8 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:34:56,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:56,184 INFO L82 PathProgramCache]: Analyzing trace with hash 843652871, now seen corresponding path program 5 times [2019-08-05 10:34:56,185 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:56,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:56,200 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 10:34:56,201 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:56,288 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:56,289 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:56,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:34:56,289 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:34:56,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:34:56,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:34:56,290 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand 5 states. [2019-08-05 10:34:56,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:56,342 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2019-08-05 10:34:56,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:34:56,342 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-08-05 10:34:56,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:56,343 INFO L225 Difference]: With dead ends: 14 [2019-08-05 10:34:56,343 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 10:34:56,343 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:34:56,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 10:34:56,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-05 10:34:56,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 10:34:56,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2019-08-05 10:34:56,347 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 10 [2019-08-05 10:34:56,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:56,347 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2019-08-05 10:34:56,347 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:34:56,348 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2019-08-05 10:34:56,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 10:34:56,348 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:56,348 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1] [2019-08-05 10:34:56,348 INFO L418 AbstractCegarLoop]: === Iteration 9 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:34:56,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:56,349 INFO L82 PathProgramCache]: Analyzing trace with hash 1588010797, now seen corresponding path program 6 times [2019-08-05 10:34:56,350 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:56,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:56,362 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:34:56,363 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:56,454 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:56,454 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:56,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:34:56,455 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:34:56,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:34:56,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:34:56,456 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand 6 states. [2019-08-05 10:34:56,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:56,606 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2019-08-05 10:34:56,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:34:56,606 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-08-05 10:34:56,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:56,607 INFO L225 Difference]: With dead ends: 12 [2019-08-05 10:34:56,607 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 10:34:56,607 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:34:56,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 10:34:56,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-08-05 10:34:56,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 10:34:56,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2019-08-05 10:34:56,610 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 10 [2019-08-05 10:34:56,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:56,611 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2019-08-05 10:34:56,611 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:34:56,611 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2019-08-05 10:34:56,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 10:34:56,612 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:56,612 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1] [2019-08-05 10:34:56,613 INFO L418 AbstractCegarLoop]: === Iteration 10 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:34:56,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:56,613 INFO L82 PathProgramCache]: Analyzing trace with hash 1983632929, now seen corresponding path program 7 times [2019-08-05 10:34:56,614 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:56,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:56,629 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 10:34:56,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:56,688 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:56,689 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:56,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:34:56,689 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:34:56,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:34:56,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:34:56,690 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand 6 states. [2019-08-05 10:34:56,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:56,744 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2019-08-05 10:34:56,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:34:56,744 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2019-08-05 10:34:56,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:56,745 INFO L225 Difference]: With dead ends: 19 [2019-08-05 10:34:56,745 INFO L226 Difference]: Without dead ends: 17 [2019-08-05 10:34:56,745 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:34:56,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-05 10:34:56,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 14. [2019-08-05 10:34:56,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-05 10:34:56,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2019-08-05 10:34:56,748 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 11 [2019-08-05 10:34:56,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:56,748 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2019-08-05 10:34:56,748 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:34:56,748 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2019-08-05 10:34:56,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:34:56,749 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:56,749 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1] [2019-08-05 10:34:56,749 INFO L418 AbstractCegarLoop]: === Iteration 11 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:34:56,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:56,750 INFO L82 PathProgramCache]: Analyzing trace with hash 1363017133, now seen corresponding path program 8 times [2019-08-05 10:34:56,750 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:56,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:56,766 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 10:34:56,767 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:56,823 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:56,824 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:56,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:34:56,824 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:34:56,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:34:56,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:34:56,825 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand 6 states. [2019-08-05 10:34:56,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:56,889 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2019-08-05 10:34:56,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:34:56,889 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2019-08-05 10:34:56,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:56,890 INFO L225 Difference]: With dead ends: 17 [2019-08-05 10:34:56,890 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 10:34:56,891 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:34:56,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 10:34:56,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-08-05 10:34:56,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 10:34:56,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2019-08-05 10:34:56,894 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 12 [2019-08-05 10:34:56,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:56,894 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-08-05 10:34:56,895 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:34:56,895 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2019-08-05 10:34:56,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:34:56,895 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:56,895 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1] [2019-08-05 10:34:56,896 INFO L418 AbstractCegarLoop]: === Iteration 12 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:34:56,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:56,896 INFO L82 PathProgramCache]: Analyzing trace with hash -1331690937, now seen corresponding path program 9 times [2019-08-05 10:34:56,897 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:56,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:56,910 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:34:56,911 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:57,002 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:57,002 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:57,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:34:57,003 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:34:57,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:34:57,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:34:57,004 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 7 states. [2019-08-05 10:34:57,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:57,293 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2019-08-05 10:34:57,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:34:57,294 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2019-08-05 10:34:57,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:57,295 INFO L225 Difference]: With dead ends: 14 [2019-08-05 10:34:57,295 INFO L226 Difference]: Without dead ends: 14 [2019-08-05 10:34:57,295 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:34:57,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-05 10:34:57,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-08-05 10:34:57,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-05 10:34:57,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2019-08-05 10:34:57,298 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 12 [2019-08-05 10:34:57,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:57,298 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2019-08-05 10:34:57,298 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:34:57,298 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2019-08-05 10:34:57,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 10:34:57,300 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:57,300 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1] [2019-08-05 10:34:57,301 INFO L418 AbstractCegarLoop]: === Iteration 13 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:34:57,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:57,301 INFO L82 PathProgramCache]: Analyzing trace with hash 1667192391, now seen corresponding path program 10 times [2019-08-05 10:34:57,302 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:57,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:57,316 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 10:34:57,317 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:57,421 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:57,422 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:57,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:34:57,422 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:34:57,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:34:57,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:34:57,423 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 7 states. [2019-08-05 10:34:57,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:57,503 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2019-08-05 10:34:57,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:34:57,504 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2019-08-05 10:34:57,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:57,505 INFO L225 Difference]: With dead ends: 22 [2019-08-05 10:34:57,505 INFO L226 Difference]: Without dead ends: 20 [2019-08-05 10:34:57,506 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:34:57,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-05 10:34:57,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 16. [2019-08-05 10:34:57,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 10:34:57,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2019-08-05 10:34:57,509 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 13 [2019-08-05 10:34:57,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:57,509 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2019-08-05 10:34:57,509 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:34:57,509 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2019-08-05 10:34:57,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 10:34:57,510 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:57,510 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1] [2019-08-05 10:34:57,510 INFO L418 AbstractCegarLoop]: === Iteration 14 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:34:57,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:57,511 INFO L82 PathProgramCache]: Analyzing trace with hash 143295047, now seen corresponding path program 11 times [2019-08-05 10:34:57,511 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:57,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:57,530 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 10:34:57,532 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:57,596 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:57,596 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:57,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:34:57,597 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:34:57,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:34:57,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:34:57,598 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand 7 states. [2019-08-05 10:34:57,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:57,718 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2019-08-05 10:34:57,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:34:57,719 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2019-08-05 10:34:57,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:57,720 INFO L225 Difference]: With dead ends: 20 [2019-08-05 10:34:57,720 INFO L226 Difference]: Without dead ends: 15 [2019-08-05 10:34:57,720 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:34:57,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-05 10:34:57,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-08-05 10:34:57,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 10:34:57,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2019-08-05 10:34:57,724 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 14 [2019-08-05 10:34:57,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:57,725 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-08-05 10:34:57,725 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:34:57,725 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2019-08-05 10:34:57,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 10:34:57,725 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:57,726 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1] [2019-08-05 10:34:57,726 INFO L418 AbstractCegarLoop]: === Iteration 15 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:34:57,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:57,726 INFO L82 PathProgramCache]: Analyzing trace with hash -1788276499, now seen corresponding path program 12 times [2019-08-05 10:34:57,727 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:57,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:57,740 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 10:34:57,741 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:57,851 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:57,851 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:57,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:34:57,852 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:34:57,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:34:57,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:34:57,852 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 8 states. [2019-08-05 10:34:57,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:57,927 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2019-08-05 10:34:57,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:34:57,928 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2019-08-05 10:34:57,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:57,929 INFO L225 Difference]: With dead ends: 16 [2019-08-05 10:34:57,929 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 10:34:57,930 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:34:57,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 10:34:57,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-08-05 10:34:57,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 10:34:57,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2019-08-05 10:34:57,933 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 14 [2019-08-05 10:34:57,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:57,933 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2019-08-05 10:34:57,933 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:34:57,933 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2019-08-05 10:34:57,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:34:57,934 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:57,934 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1] [2019-08-05 10:34:57,934 INFO L418 AbstractCegarLoop]: === Iteration 16 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:34:57,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:57,935 INFO L82 PathProgramCache]: Analyzing trace with hash 397941857, now seen corresponding path program 13 times [2019-08-05 10:34:57,935 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:57,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:57,948 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 10:34:57,950 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:58,098 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:58,099 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:58,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:34:58,099 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:34:58,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:34:58,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:34:58,100 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand 8 states. [2019-08-05 10:34:58,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:58,263 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2019-08-05 10:34:58,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:34:58,264 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2019-08-05 10:34:58,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:58,264 INFO L225 Difference]: With dead ends: 25 [2019-08-05 10:34:58,265 INFO L226 Difference]: Without dead ends: 23 [2019-08-05 10:34:58,265 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:34:58,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-08-05 10:34:58,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 18. [2019-08-05 10:34:58,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-05 10:34:58,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2019-08-05 10:34:58,269 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 15 [2019-08-05 10:34:58,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:58,269 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2019-08-05 10:34:58,269 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:34:58,270 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2019-08-05 10:34:58,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:34:58,270 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:58,270 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1] [2019-08-05 10:34:58,271 INFO L418 AbstractCegarLoop]: === Iteration 17 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:34:58,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:58,271 INFO L82 PathProgramCache]: Analyzing trace with hash -548765843, now seen corresponding path program 14 times [2019-08-05 10:34:58,272 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:58,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:58,288 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 10:34:58,289 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:58,395 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:58,395 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:58,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:34:58,396 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:34:58,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:34:58,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:34:58,399 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand 8 states. [2019-08-05 10:34:58,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:58,489 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2019-08-05 10:34:58,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:34:58,490 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2019-08-05 10:34:58,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:58,490 INFO L225 Difference]: With dead ends: 23 [2019-08-05 10:34:58,491 INFO L226 Difference]: Without dead ends: 17 [2019-08-05 10:34:58,491 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:34:58,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-05 10:34:58,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-08-05 10:34:58,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 10:34:58,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-08-05 10:34:58,494 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 16 [2019-08-05 10:34:58,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:58,495 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-08-05 10:34:58,495 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:34:58,495 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2019-08-05 10:34:58,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:34:58,495 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:58,496 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1] [2019-08-05 10:34:58,496 INFO L418 AbstractCegarLoop]: === Iteration 18 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:34:58,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:58,496 INFO L82 PathProgramCache]: Analyzing trace with hash -297941625, now seen corresponding path program 15 times [2019-08-05 10:34:58,497 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:58,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:58,508 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 10:34:58,510 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:58,644 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:58,644 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:58,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:34:58,645 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:34:58,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:34:58,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:34:58,645 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 9 states. [2019-08-05 10:34:58,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:58,687 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2019-08-05 10:34:58,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:34:58,687 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2019-08-05 10:34:58,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:58,688 INFO L225 Difference]: With dead ends: 18 [2019-08-05 10:34:58,688 INFO L226 Difference]: Without dead ends: 18 [2019-08-05 10:34:58,689 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 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-05 10:34:58,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-05 10:34:58,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-08-05 10:34:58,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-05 10:34:58,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2019-08-05 10:34:58,692 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 16 [2019-08-05 10:34:58,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:58,692 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2019-08-05 10:34:58,692 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:34:58,692 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2019-08-05 10:34:58,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 10:34:58,693 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:58,693 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1] [2019-08-05 10:34:58,693 INFO L418 AbstractCegarLoop]: === Iteration 19 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:34:58,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:58,693 INFO L82 PathProgramCache]: Analyzing trace with hash -646317305, now seen corresponding path program 16 times [2019-08-05 10:34:58,694 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:58,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:58,707 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 10:34:58,708 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:58,804 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:58,804 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:58,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:34:58,805 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:34:58,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:34:58,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:34:58,806 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 9 states. [2019-08-05 10:34:58,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:58,921 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2019-08-05 10:34:58,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:34:58,922 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2019-08-05 10:34:58,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:58,923 INFO L225 Difference]: With dead ends: 28 [2019-08-05 10:34:58,923 INFO L226 Difference]: Without dead ends: 26 [2019-08-05 10:34:58,924 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:34:58,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-08-05 10:34:58,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 20. [2019-08-05 10:34:58,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 10:34:58,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2019-08-05 10:34:58,927 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 17 [2019-08-05 10:34:58,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:58,927 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2019-08-05 10:34:58,927 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:34:58,928 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2019-08-05 10:34:58,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:34:58,928 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:58,928 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1] [2019-08-05 10:34:58,929 INFO L418 AbstractCegarLoop]: === Iteration 20 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:34:58,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:58,929 INFO L82 PathProgramCache]: Analyzing trace with hash 1438938503, now seen corresponding path program 17 times [2019-08-05 10:34:58,930 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:58,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:58,944 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 10:34:58,945 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:59,085 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 7 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:59,086 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:59,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:34:59,086 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:34:59,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:34:59,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:34:59,087 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand 9 states. [2019-08-05 10:34:59,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:59,182 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2019-08-05 10:34:59,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:34:59,182 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2019-08-05 10:34:59,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:59,183 INFO L225 Difference]: With dead ends: 26 [2019-08-05 10:34:59,183 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 10:34:59,184 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:34:59,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 10:34:59,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-08-05 10:34:59,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 10:34:59,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2019-08-05 10:34:59,187 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 18 [2019-08-05 10:34:59,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:59,187 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2019-08-05 10:34:59,187 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:34:59,187 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2019-08-05 10:34:59,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:34:59,188 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:59,188 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1] [2019-08-05 10:34:59,188 INFO L418 AbstractCegarLoop]: === Iteration 21 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:34:59,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:59,189 INFO L82 PathProgramCache]: Analyzing trace with hash 624554669, now seen corresponding path program 18 times [2019-08-05 10:34:59,190 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:59,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:59,203 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 10:34:59,205 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:59,293 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 28 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:59,293 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:59,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:34:59,294 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:34:59,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:34:59,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:34:59,294 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 10 states. [2019-08-05 10:34:59,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:59,361 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2019-08-05 10:34:59,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:34:59,361 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2019-08-05 10:34:59,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:59,362 INFO L225 Difference]: With dead ends: 20 [2019-08-05 10:34:59,362 INFO L226 Difference]: Without dead ends: 20 [2019-08-05 10:34:59,362 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:34:59,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-05 10:34:59,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-08-05 10:34:59,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 10:34:59,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2019-08-05 10:34:59,365 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 18 [2019-08-05 10:34:59,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:59,366 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2019-08-05 10:34:59,366 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:34:59,366 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2019-08-05 10:34:59,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:34:59,366 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:59,367 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1] [2019-08-05 10:34:59,367 INFO L418 AbstractCegarLoop]: === Iteration 22 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:34:59,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:59,367 INFO L82 PathProgramCache]: Analyzing trace with hash -2113703263, now seen corresponding path program 19 times [2019-08-05 10:34:59,368 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:59,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:59,381 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 10:34:59,383 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:59,472 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:59,472 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:59,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:34:59,473 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:34:59,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:34:59,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:34:59,474 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 10 states. [2019-08-05 10:34:59,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:59,617 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2019-08-05 10:34:59,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:34:59,619 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2019-08-05 10:34:59,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:59,619 INFO L225 Difference]: With dead ends: 31 [2019-08-05 10:34:59,620 INFO L226 Difference]: Without dead ends: 29 [2019-08-05 10:34:59,620 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:34:59,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-08-05 10:34:59,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 22. [2019-08-05 10:34:59,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-05 10:34:59,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2019-08-05 10:34:59,622 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 19 [2019-08-05 10:34:59,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:59,623 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2019-08-05 10:34:59,623 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:34:59,623 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2019-08-05 10:34:59,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:34:59,623 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:59,623 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1, 1] [2019-08-05 10:34:59,624 INFO L418 AbstractCegarLoop]: === Iteration 23 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:34:59,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:59,624 INFO L82 PathProgramCache]: Analyzing trace with hash -1100353235, now seen corresponding path program 20 times [2019-08-05 10:34:59,625 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:59,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:59,636 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 10:34:59,637 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:59,719 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 8 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:59,720 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:59,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:34:59,720 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:34:59,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:34:59,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:34:59,721 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 10 states. [2019-08-05 10:35:00,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:00,097 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2019-08-05 10:35:00,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:35:00,098 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-08-05 10:35:00,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:00,098 INFO L225 Difference]: With dead ends: 29 [2019-08-05 10:35:00,099 INFO L226 Difference]: Without dead ends: 21 [2019-08-05 10:35:00,099 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:35:00,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-05 10:35:00,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-08-05 10:35:00,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-05 10:35:00,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2019-08-05 10:35:00,103 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 20 [2019-08-05 10:35:00,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:00,103 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2019-08-05 10:35:00,103 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:35:00,103 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2019-08-05 10:35:00,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:35:00,104 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:00,104 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1, 1] [2019-08-05 10:35:00,104 INFO L418 AbstractCegarLoop]: === Iteration 24 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:00,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:00,105 INFO L82 PathProgramCache]: Analyzing trace with hash -576448313, now seen corresponding path program 21 times [2019-08-05 10:35:00,106 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:00,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:00,114 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 10:35:00,116 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:00,197 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 36 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:00,198 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:00,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:35:00,198 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:35:00,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:35:00,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:35:00,199 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 11 states. [2019-08-05 10:35:00,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:00,250 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2019-08-05 10:35:00,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:35:00,251 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2019-08-05 10:35:00,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:00,252 INFO L225 Difference]: With dead ends: 22 [2019-08-05 10:35:00,252 INFO L226 Difference]: Without dead ends: 22 [2019-08-05 10:35:00,252 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:35:00,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-05 10:35:00,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-08-05 10:35:00,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-05 10:35:00,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2019-08-05 10:35:00,256 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 20 [2019-08-05 10:35:00,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:00,256 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2019-08-05 10:35:00,256 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:35:00,256 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2019-08-05 10:35:00,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:35:00,257 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:00,257 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1] [2019-08-05 10:35:00,257 INFO L418 AbstractCegarLoop]: === Iteration 25 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:00,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:00,258 INFO L82 PathProgramCache]: Analyzing trace with hash -690090041, now seen corresponding path program 22 times [2019-08-05 10:35:00,258 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:00,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:00,268 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 35 conjunts are in the unsatisfiable core [2019-08-05 10:35:00,269 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:00,343 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:00,343 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:00,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:35:00,344 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:35:00,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:35:00,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:35:00,344 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand 11 states. [2019-08-05 10:35:00,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:00,477 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2019-08-05 10:35:00,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:35:00,477 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2019-08-05 10:35:00,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:00,478 INFO L225 Difference]: With dead ends: 34 [2019-08-05 10:35:00,478 INFO L226 Difference]: Without dead ends: 32 [2019-08-05 10:35:00,479 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:35:00,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-08-05 10:35:00,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 24. [2019-08-05 10:35:00,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-05 10:35:00,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2019-08-05 10:35:00,481 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 21 [2019-08-05 10:35:00,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:00,482 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-08-05 10:35:00,482 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:35:00,482 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2019-08-05 10:35:00,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:35:00,483 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:00,483 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1, 1, 1] [2019-08-05 10:35:00,483 INFO L418 AbstractCegarLoop]: === Iteration 26 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:00,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:00,483 INFO L82 PathProgramCache]: Analyzing trace with hash 81983687, now seen corresponding path program 23 times [2019-08-05 10:35:00,484 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:00,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:00,495 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 35 conjunts are in the unsatisfiable core [2019-08-05 10:35:00,497 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:00,592 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 9 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:00,592 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:00,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:35:00,593 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:35:00,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:35:00,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:35:00,593 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 11 states. [2019-08-05 10:35:00,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:00,832 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2019-08-05 10:35:00,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:35:00,833 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2019-08-05 10:35:00,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:00,833 INFO L225 Difference]: With dead ends: 32 [2019-08-05 10:35:00,834 INFO L226 Difference]: Without dead ends: 23 [2019-08-05 10:35:00,834 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:35:00,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-08-05 10:35:00,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-08-05 10:35:00,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-05 10:35:00,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2019-08-05 10:35:00,837 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 22 [2019-08-05 10:35:00,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:00,837 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-08-05 10:35:00,837 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:35:00,837 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2019-08-05 10:35:00,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:35:00,838 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:00,838 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1, 1, 1] [2019-08-05 10:35:00,838 INFO L418 AbstractCegarLoop]: === Iteration 27 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:00,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:00,839 INFO L82 PathProgramCache]: Analyzing trace with hash -856832915, now seen corresponding path program 24 times [2019-08-05 10:35:00,839 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:00,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:00,848 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 10:35:00,850 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:01,325 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 45 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:01,326 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:01,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:35:01,326 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:35:01,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:35:01,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:35:01,327 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 12 states. [2019-08-05 10:35:01,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:01,405 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2019-08-05 10:35:01,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:35:01,405 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2019-08-05 10:35:01,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:01,405 INFO L225 Difference]: With dead ends: 24 [2019-08-05 10:35:01,406 INFO L226 Difference]: Without dead ends: 24 [2019-08-05 10:35:01,406 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:35:01,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-08-05 10:35:01,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-08-05 10:35:01,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-05 10:35:01,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2019-08-05 10:35:01,409 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 22 [2019-08-05 10:35:01,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:01,409 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2019-08-05 10:35:01,409 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:35:01,409 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2019-08-05 10:35:01,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:35:01,410 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:01,410 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1] [2019-08-05 10:35:01,410 INFO L418 AbstractCegarLoop]: === Iteration 28 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:01,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:01,410 INFO L82 PathProgramCache]: Analyzing trace with hash -792078111, now seen corresponding path program 25 times [2019-08-05 10:35:01,411 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:01,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:01,423 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 39 conjunts are in the unsatisfiable core [2019-08-05 10:35:01,426 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:01,838 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:01,838 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:01,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:35:01,839 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:35:01,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:35:01,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:35:01,840 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 12 states. [2019-08-05 10:35:02,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:02,013 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2019-08-05 10:35:02,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:35:02,014 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2019-08-05 10:35:02,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:02,015 INFO L225 Difference]: With dead ends: 37 [2019-08-05 10:35:02,015 INFO L226 Difference]: Without dead ends: 35 [2019-08-05 10:35:02,016 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:35:02,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-08-05 10:35:02,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 26. [2019-08-05 10:35:02,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-08-05 10:35:02,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2019-08-05 10:35:02,018 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 23 [2019-08-05 10:35:02,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:02,018 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2019-08-05 10:35:02,018 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:35:02,018 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2019-08-05 10:35:02,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:35:02,019 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:02,019 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1, 1, 1] [2019-08-05 10:35:02,019 INFO L418 AbstractCegarLoop]: === Iteration 29 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:02,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:02,020 INFO L82 PathProgramCache]: Analyzing trace with hash 1215320813, now seen corresponding path program 26 times [2019-08-05 10:35:02,021 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:02,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:02,031 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 39 conjunts are in the unsatisfiable core [2019-08-05 10:35:02,032 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:02,126 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 10 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:02,127 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:02,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:35:02,127 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:35:02,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:35:02,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:35:02,128 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 12 states. [2019-08-05 10:35:02,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:02,310 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2019-08-05 10:35:02,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:35:02,311 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 24 [2019-08-05 10:35:02,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:02,311 INFO L225 Difference]: With dead ends: 35 [2019-08-05 10:35:02,312 INFO L226 Difference]: Without dead ends: 25 [2019-08-05 10:35:02,312 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:35:02,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-05 10:35:02,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-08-05 10:35:02,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-05 10:35:02,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2019-08-05 10:35:02,316 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 24 [2019-08-05 10:35:02,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:02,316 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2019-08-05 10:35:02,316 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:35:02,316 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2019-08-05 10:35:02,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:35:02,317 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:02,317 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1, 1, 1] [2019-08-05 10:35:02,317 INFO L418 AbstractCegarLoop]: === Iteration 30 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:02,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:02,318 INFO L82 PathProgramCache]: Analyzing trace with hash -2118190073, now seen corresponding path program 27 times [2019-08-05 10:35:02,318 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:02,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:02,328 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 10:35:02,330 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:02,684 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 55 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:02,684 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:02,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:35:02,685 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:35:02,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:35:02,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:35:02,686 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 13 states. [2019-08-05 10:35:02,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:02,731 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2019-08-05 10:35:02,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:35:02,731 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2019-08-05 10:35:02,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:02,732 INFO L225 Difference]: With dead ends: 26 [2019-08-05 10:35:02,732 INFO L226 Difference]: Without dead ends: 26 [2019-08-05 10:35:02,733 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:35:02,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-08-05 10:35:02,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-08-05 10:35:02,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-08-05 10:35:02,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2019-08-05 10:35:02,735 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 24 [2019-08-05 10:35:02,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:02,735 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2019-08-05 10:35:02,736 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:35:02,736 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2019-08-05 10:35:02,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:35:02,736 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:02,736 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1] [2019-08-05 10:35:02,737 INFO L418 AbstractCegarLoop]: === Iteration 31 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:02,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:02,737 INFO L82 PathProgramCache]: Analyzing trace with hash -1239444345, now seen corresponding path program 28 times [2019-08-05 10:35:02,738 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:02,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:02,748 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 43 conjunts are in the unsatisfiable core [2019-08-05 10:35:02,750 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:03,028 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:03,029 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:03,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:35:03,029 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:35:03,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:35:03,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:35:03,030 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 13 states. [2019-08-05 10:35:03,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:03,281 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2019-08-05 10:35:03,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:35:03,282 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2019-08-05 10:35:03,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:03,282 INFO L225 Difference]: With dead ends: 40 [2019-08-05 10:35:03,283 INFO L226 Difference]: Without dead ends: 38 [2019-08-05 10:35:03,283 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:35:03,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-08-05 10:35:03,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 28. [2019-08-05 10:35:03,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-05 10:35:03,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2019-08-05 10:35:03,287 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 25 [2019-08-05 10:35:03,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:03,288 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2019-08-05 10:35:03,288 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:35:03,288 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2019-08-05 10:35:03,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 10:35:03,288 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:03,288 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 1, 1, 1, 1, 1] [2019-08-05 10:35:03,289 INFO L418 AbstractCegarLoop]: === Iteration 32 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:03,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:03,289 INFO L82 PathProgramCache]: Analyzing trace with hash 231869447, now seen corresponding path program 29 times [2019-08-05 10:35:03,290 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:03,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:03,301 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 43 conjunts are in the unsatisfiable core [2019-08-05 10:35:03,302 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:03,456 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 11 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:03,456 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:03,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:35:03,457 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:35:03,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:35:03,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:35:03,458 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 13 states. [2019-08-05 10:35:03,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:03,685 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2019-08-05 10:35:03,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:35:03,685 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 26 [2019-08-05 10:35:03,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:03,686 INFO L225 Difference]: With dead ends: 38 [2019-08-05 10:35:03,686 INFO L226 Difference]: Without dead ends: 27 [2019-08-05 10:35:03,687 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:35:03,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-08-05 10:35:03,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-08-05 10:35:03,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-05 10:35:03,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2019-08-05 10:35:03,690 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 26 [2019-08-05 10:35:03,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:03,690 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2019-08-05 10:35:03,690 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:35:03,690 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2019-08-05 10:35:03,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 10:35:03,691 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:03,691 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 1, 1, 1, 1, 1] [2019-08-05 10:35:03,691 INFO L418 AbstractCegarLoop]: === Iteration 33 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:03,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:03,691 INFO L82 PathProgramCache]: Analyzing trace with hash -27752915, now seen corresponding path program 30 times [2019-08-05 10:35:03,692 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:03,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:03,701 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 10:35:03,703 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:03,814 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 66 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:03,815 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:03,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:35:03,815 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:35:03,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:35:03,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:35:03,816 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 14 states. [2019-08-05 10:35:03,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:03,930 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2019-08-05 10:35:03,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:35:03,930 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 26 [2019-08-05 10:35:03,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:03,931 INFO L225 Difference]: With dead ends: 28 [2019-08-05 10:35:03,931 INFO L226 Difference]: Without dead ends: 28 [2019-08-05 10:35:03,932 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:35:03,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-08-05 10:35:03,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-08-05 10:35:03,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-05 10:35:03,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2019-08-05 10:35:03,934 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 26 [2019-08-05 10:35:03,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:03,935 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2019-08-05 10:35:03,935 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:35:03,935 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2019-08-05 10:35:03,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:35:03,935 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:03,936 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1, 1] [2019-08-05 10:35:03,936 INFO L418 AbstractCegarLoop]: === Iteration 34 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:03,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:03,936 INFO L82 PathProgramCache]: Analyzing trace with hash -860401887, now seen corresponding path program 31 times [2019-08-05 10:35:03,937 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:03,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:03,948 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 47 conjunts are in the unsatisfiable core [2019-08-05 10:35:03,949 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:04,058 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:04,058 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:04,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:35:04,059 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:35:04,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:35:04,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:35:04,059 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 14 states. [2019-08-05 10:35:04,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:04,354 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2019-08-05 10:35:04,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:35:04,355 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 27 [2019-08-05 10:35:04,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:04,355 INFO L225 Difference]: With dead ends: 43 [2019-08-05 10:35:04,355 INFO L226 Difference]: Without dead ends: 41 [2019-08-05 10:35:04,356 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:35:04,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-08-05 10:35:04,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 30. [2019-08-05 10:35:04,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-05 10:35:04,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2019-08-05 10:35:04,358 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 27 [2019-08-05 10:35:04,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:04,359 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2019-08-05 10:35:04,359 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:35:04,359 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2019-08-05 10:35:04,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 10:35:04,359 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:04,359 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 1, 1, 1, 1, 1] [2019-08-05 10:35:04,360 INFO L418 AbstractCegarLoop]: === Iteration 35 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:04,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:04,360 INFO L82 PathProgramCache]: Analyzing trace with hash -902716243, now seen corresponding path program 32 times [2019-08-05 10:35:04,360 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:04,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:04,372 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 47 conjunts are in the unsatisfiable core [2019-08-05 10:35:04,373 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:05,303 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 12 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:05,304 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:05,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:35:05,304 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:35:05,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:35:05,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:35:05,305 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand 14 states. [2019-08-05 10:35:05,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:05,698 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2019-08-05 10:35:05,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:35:05,699 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 28 [2019-08-05 10:35:05,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:05,699 INFO L225 Difference]: With dead ends: 41 [2019-08-05 10:35:05,699 INFO L226 Difference]: Without dead ends: 29 [2019-08-05 10:35:05,700 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:35:05,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-08-05 10:35:05,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-08-05 10:35:05,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-08-05 10:35:05,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2019-08-05 10:35:05,702 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 28 [2019-08-05 10:35:05,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:05,702 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2019-08-05 10:35:05,702 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:35:05,702 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2019-08-05 10:35:05,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 10:35:05,702 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:05,703 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 1, 1, 1, 1, 1] [2019-08-05 10:35:05,703 INFO L418 AbstractCegarLoop]: === Iteration 36 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:05,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:05,708 INFO L82 PathProgramCache]: Analyzing trace with hash -361074873, now seen corresponding path program 33 times [2019-08-05 10:35:05,709 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:05,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:05,722 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 10:35:05,725 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:06,182 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 78 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:06,182 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:06,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:35:06,183 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 10:35:06,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 10:35:06,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:35:06,184 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 15 states. [2019-08-05 10:35:06,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:06,294 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2019-08-05 10:35:06,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:35:06,295 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 28 [2019-08-05 10:35:06,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:06,296 INFO L225 Difference]: With dead ends: 30 [2019-08-05 10:35:06,296 INFO L226 Difference]: Without dead ends: 30 [2019-08-05 10:35:06,296 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:35:06,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-08-05 10:35:06,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-08-05 10:35:06,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-05 10:35:06,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2019-08-05 10:35:06,299 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 28 [2019-08-05 10:35:06,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:06,300 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2019-08-05 10:35:06,300 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 10:35:06,300 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2019-08-05 10:35:06,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 10:35:06,301 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:06,301 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1, 1] [2019-08-05 10:35:06,301 INFO L418 AbstractCegarLoop]: === Iteration 37 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:06,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:06,301 INFO L82 PathProgramCache]: Analyzing trace with hash 1691519303, now seen corresponding path program 34 times [2019-08-05 10:35:06,302 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:06,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:06,315 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 51 conjunts are in the unsatisfiable core [2019-08-05 10:35:06,316 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:06,573 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:06,574 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:06,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:35:06,574 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 10:35:06,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 10:35:06,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:35:06,575 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 15 states. [2019-08-05 10:35:06,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:06,811 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2019-08-05 10:35:06,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:35:06,812 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 29 [2019-08-05 10:35:06,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:06,812 INFO L225 Difference]: With dead ends: 46 [2019-08-05 10:35:06,812 INFO L226 Difference]: Without dead ends: 44 [2019-08-05 10:35:06,813 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:35:06,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-08-05 10:35:06,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 32. [2019-08-05 10:35:06,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-05 10:35:06,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2019-08-05 10:35:06,816 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 29 [2019-08-05 10:35:06,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:06,816 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2019-08-05 10:35:06,816 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 10:35:06,816 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2019-08-05 10:35:06,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 10:35:06,817 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:06,817 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 1, 1, 1, 1, 1] [2019-08-05 10:35:06,817 INFO L418 AbstractCegarLoop]: === Iteration 38 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:06,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:06,818 INFO L82 PathProgramCache]: Analyzing trace with hash 897429319, now seen corresponding path program 35 times [2019-08-05 10:35:06,818 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:06,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:06,829 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 51 conjunts are in the unsatisfiable core [2019-08-05 10:35:06,830 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:07,025 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 13 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:07,026 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:07,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:35:07,026 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 10:35:07,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 10:35:07,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:35:07,027 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 15 states. [2019-08-05 10:35:07,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:07,273 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2019-08-05 10:35:07,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:35:07,274 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 30 [2019-08-05 10:35:07,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:07,274 INFO L225 Difference]: With dead ends: 44 [2019-08-05 10:35:07,274 INFO L226 Difference]: Without dead ends: 31 [2019-08-05 10:35:07,275 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:35:07,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-08-05 10:35:07,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-08-05 10:35:07,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-08-05 10:35:07,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2019-08-05 10:35:07,277 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 30 [2019-08-05 10:35:07,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:07,278 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2019-08-05 10:35:07,278 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 10:35:07,278 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2019-08-05 10:35:07,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 10:35:07,278 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:07,278 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 1, 1, 1, 1, 1] [2019-08-05 10:35:07,279 INFO L418 AbstractCegarLoop]: === Iteration 39 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:07,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:07,279 INFO L82 PathProgramCache]: Analyzing trace with hash 508442605, now seen corresponding path program 36 times [2019-08-05 10:35:07,280 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:07,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:07,289 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 10:35:07,290 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:07,499 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 91 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:07,500 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:07,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 10:35:07,500 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:35:07,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:35:07,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:35:07,501 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 16 states. [2019-08-05 10:35:07,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:07,577 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2019-08-05 10:35:07,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:35:07,578 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 30 [2019-08-05 10:35:07,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:07,579 INFO L225 Difference]: With dead ends: 32 [2019-08-05 10:35:07,579 INFO L226 Difference]: Without dead ends: 32 [2019-08-05 10:35:07,579 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:35:07,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-08-05 10:35:07,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-08-05 10:35:07,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-05 10:35:07,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2019-08-05 10:35:07,582 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 30 [2019-08-05 10:35:07,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:07,582 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2019-08-05 10:35:07,582 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:35:07,582 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2019-08-05 10:35:07,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-05 10:35:07,583 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:07,583 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 1, 1, 1, 1, 1] [2019-08-05 10:35:07,583 INFO L418 AbstractCegarLoop]: === Iteration 40 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:07,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:07,583 INFO L82 PathProgramCache]: Analyzing trace with hash -1418209951, now seen corresponding path program 37 times [2019-08-05 10:35:07,584 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:07,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:07,595 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 55 conjunts are in the unsatisfiable core [2019-08-05 10:35:07,596 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:07,770 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:07,770 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:07,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:35:07,772 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:35:07,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:35:07,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:35:07,773 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 16 states. [2019-08-05 10:35:08,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:08,114 INFO L93 Difference]: Finished difference Result 49 states and 51 transitions. [2019-08-05 10:35:08,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:35:08,115 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 31 [2019-08-05 10:35:08,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:08,116 INFO L225 Difference]: With dead ends: 49 [2019-08-05 10:35:08,116 INFO L226 Difference]: Without dead ends: 47 [2019-08-05 10:35:08,116 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:35:08,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-08-05 10:35:08,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 34. [2019-08-05 10:35:08,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-05 10:35:08,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2019-08-05 10:35:08,119 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 31 [2019-08-05 10:35:08,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:08,120 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2019-08-05 10:35:08,120 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:35:08,120 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2019-08-05 10:35:08,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 10:35:08,120 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:08,120 INFO L399 BasicCegarLoop]: trace histogram [14, 13, 1, 1, 1, 1, 1] [2019-08-05 10:35:08,121 INFO L418 AbstractCegarLoop]: === Iteration 41 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:08,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:08,121 INFO L82 PathProgramCache]: Analyzing trace with hash -1014897043, now seen corresponding path program 38 times [2019-08-05 10:35:08,122 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:08,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:08,130 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 55 conjunts are in the unsatisfiable core [2019-08-05 10:35:08,131 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:08,299 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 14 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:08,299 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:08,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 10:35:08,300 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:35:08,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:35:08,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:35:08,300 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand 16 states. [2019-08-05 10:35:08,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:08,583 INFO L93 Difference]: Finished difference Result 47 states and 48 transitions. [2019-08-05 10:35:08,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:35:08,584 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 32 [2019-08-05 10:35:08,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:08,585 INFO L225 Difference]: With dead ends: 47 [2019-08-05 10:35:08,585 INFO L226 Difference]: Without dead ends: 33 [2019-08-05 10:35:08,585 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:35:08,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-08-05 10:35:08,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-08-05 10:35:08,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-05 10:35:08,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2019-08-05 10:35:08,587 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 32 [2019-08-05 10:35:08,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:08,587 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2019-08-05 10:35:08,587 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:35:08,588 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2019-08-05 10:35:08,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 10:35:08,588 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:08,588 INFO L399 BasicCegarLoop]: trace histogram [14, 13, 1, 1, 1, 1, 1] [2019-08-05 10:35:08,589 INFO L418 AbstractCegarLoop]: === Iteration 42 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:08,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:08,589 INFO L82 PathProgramCache]: Analyzing trace with hash -188583289, now seen corresponding path program 39 times [2019-08-05 10:35:08,590 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:08,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:08,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 10:35:08,600 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:08,748 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 105 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:08,748 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:08,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:35:08,749 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 10:35:08,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 10:35:08,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:35:08,749 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 17 states. [2019-08-05 10:35:08,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:08,803 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2019-08-05 10:35:08,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:35:08,810 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 32 [2019-08-05 10:35:08,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:08,811 INFO L225 Difference]: With dead ends: 34 [2019-08-05 10:35:08,811 INFO L226 Difference]: Without dead ends: 34 [2019-08-05 10:35:08,811 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:35:08,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-08-05 10:35:08,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-08-05 10:35:08,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-05 10:35:08,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2019-08-05 10:35:08,813 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 32 [2019-08-05 10:35:08,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:08,813 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2019-08-05 10:35:08,813 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 10:35:08,813 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2019-08-05 10:35:08,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-05 10:35:08,814 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:08,814 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 1, 1, 1, 1, 1] [2019-08-05 10:35:08,814 INFO L418 AbstractCegarLoop]: === Iteration 43 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:08,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:08,814 INFO L82 PathProgramCache]: Analyzing trace with hash -1551176185, now seen corresponding path program 40 times [2019-08-05 10:35:08,815 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:08,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:08,826 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 59 conjunts are in the unsatisfiable core [2019-08-05 10:35:08,827 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:08,965 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:08,965 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:08,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 10:35:08,966 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 10:35:08,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 10:35:08,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:35:08,967 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand 17 states. [2019-08-05 10:35:09,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:09,433 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2019-08-05 10:35:09,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:35:09,434 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 33 [2019-08-05 10:35:09,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:09,434 INFO L225 Difference]: With dead ends: 52 [2019-08-05 10:35:09,434 INFO L226 Difference]: Without dead ends: 50 [2019-08-05 10:35:09,435 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:35:09,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-08-05 10:35:09,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 36. [2019-08-05 10:35:09,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-05 10:35:09,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2019-08-05 10:35:09,437 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 33 [2019-08-05 10:35:09,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:09,437 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2019-08-05 10:35:09,437 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 10:35:09,438 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2019-08-05 10:35:09,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-05 10:35:09,438 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:09,438 INFO L399 BasicCegarLoop]: trace histogram [15, 14, 1, 1, 1, 1, 1] [2019-08-05 10:35:09,438 INFO L418 AbstractCegarLoop]: === Iteration 44 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:09,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:09,438 INFO L82 PathProgramCache]: Analyzing trace with hash -841883001, now seen corresponding path program 41 times [2019-08-05 10:35:09,439 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:09,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:09,450 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 59 conjunts are in the unsatisfiable core [2019-08-05 10:35:09,451 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:09,773 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 15 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:09,773 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:09,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:35:09,774 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 10:35:09,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 10:35:09,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:35:09,774 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 17 states. [2019-08-05 10:35:10,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:10,133 INFO L93 Difference]: Finished difference Result 50 states and 51 transitions. [2019-08-05 10:35:10,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:35:10,133 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 34 [2019-08-05 10:35:10,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:10,134 INFO L225 Difference]: With dead ends: 50 [2019-08-05 10:35:10,134 INFO L226 Difference]: Without dead ends: 35 [2019-08-05 10:35:10,135 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:35:10,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-08-05 10:35:10,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-08-05 10:35:10,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-05 10:35:10,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2019-08-05 10:35:10,137 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 34 [2019-08-05 10:35:10,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:10,137 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2019-08-05 10:35:10,137 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 10:35:10,137 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2019-08-05 10:35:10,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-05 10:35:10,138 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:10,138 INFO L399 BasicCegarLoop]: trace histogram [15, 14, 1, 1, 1, 1, 1] [2019-08-05 10:35:10,138 INFO L418 AbstractCegarLoop]: === Iteration 45 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:10,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:10,138 INFO L82 PathProgramCache]: Analyzing trace with hash -995960403, now seen corresponding path program 42 times [2019-08-05 10:35:10,139 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:10,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:10,149 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 10:35:10,151 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:10,550 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 120 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:10,550 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:10,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:35:10,551 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:35:10,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:35:10,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:35:10,551 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 18 states. [2019-08-05 10:35:10,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:10,613 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2019-08-05 10:35:10,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 10:35:10,614 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 34 [2019-08-05 10:35:10,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:10,614 INFO L225 Difference]: With dead ends: 36 [2019-08-05 10:35:10,615 INFO L226 Difference]: Without dead ends: 36 [2019-08-05 10:35:10,615 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:35:10,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-08-05 10:35:10,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-08-05 10:35:10,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-05 10:35:10,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2019-08-05 10:35:10,617 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 34 [2019-08-05 10:35:10,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:10,617 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2019-08-05 10:35:10,617 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:35:10,617 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2019-08-05 10:35:10,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-05 10:35:10,617 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:10,618 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1, 1] [2019-08-05 10:35:10,618 INFO L418 AbstractCegarLoop]: === Iteration 46 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:10,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:10,618 INFO L82 PathProgramCache]: Analyzing trace with hash -810062943, now seen corresponding path program 43 times [2019-08-05 10:35:10,619 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:10,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:10,630 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 63 conjunts are in the unsatisfiable core [2019-08-05 10:35:10,631 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:10,792 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:10,792 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:10,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:35:10,792 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:35:10,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:35:10,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:35:10,793 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 18 states. [2019-08-05 10:35:11,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:11,199 INFO L93 Difference]: Finished difference Result 55 states and 57 transitions. [2019-08-05 10:35:11,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 10:35:11,199 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 35 [2019-08-05 10:35:11,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:11,200 INFO L225 Difference]: With dead ends: 55 [2019-08-05 10:35:11,200 INFO L226 Difference]: Without dead ends: 53 [2019-08-05 10:35:11,201 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:35:11,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-08-05 10:35:11,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 38. [2019-08-05 10:35:11,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-05 10:35:11,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2019-08-05 10:35:11,204 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 35 [2019-08-05 10:35:11,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:11,204 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2019-08-05 10:35:11,204 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:35:11,205 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2019-08-05 10:35:11,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-05 10:35:11,205 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:11,205 INFO L399 BasicCegarLoop]: trace histogram [16, 15, 1, 1, 1, 1, 1] [2019-08-05 10:35:11,205 INFO L418 AbstractCegarLoop]: === Iteration 47 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:11,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:11,206 INFO L82 PathProgramCache]: Analyzing trace with hash 657791021, now seen corresponding path program 44 times [2019-08-05 10:35:11,206 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:11,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:11,219 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 63 conjunts are in the unsatisfiable core [2019-08-05 10:35:11,220 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:11,523 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 16 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:11,523 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:11,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:35:11,523 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:35:11,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:35:11,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:35:11,524 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand 18 states. [2019-08-05 10:35:11,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:11,976 INFO L93 Difference]: Finished difference Result 53 states and 54 transitions. [2019-08-05 10:35:11,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 10:35:11,977 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 36 [2019-08-05 10:35:11,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:11,977 INFO L225 Difference]: With dead ends: 53 [2019-08-05 10:35:11,978 INFO L226 Difference]: Without dead ends: 37 [2019-08-05 10:35:11,978 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:35:11,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-08-05 10:35:11,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-08-05 10:35:11,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-05 10:35:11,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2019-08-05 10:35:11,980 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 36 [2019-08-05 10:35:11,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:11,980 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2019-08-05 10:35:11,980 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:35:11,980 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2019-08-05 10:35:11,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-05 10:35:11,981 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:11,981 INFO L399 BasicCegarLoop]: trace histogram [16, 15, 1, 1, 1, 1, 1] [2019-08-05 10:35:11,981 INFO L418 AbstractCegarLoop]: === Iteration 48 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:11,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:11,981 INFO L82 PathProgramCache]: Analyzing trace with hash 176358855, now seen corresponding path program 45 times [2019-08-05 10:35:11,982 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:11,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:11,993 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 33 conjunts are in the unsatisfiable core [2019-08-05 10:35:11,993 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:12,205 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 136 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:12,205 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:12,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:35:12,206 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:35:12,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:35:12,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:35:12,206 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 19 states. [2019-08-05 10:35:12,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:12,277 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2019-08-05 10:35:12,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:35:12,278 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 36 [2019-08-05 10:35:12,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:12,279 INFO L225 Difference]: With dead ends: 38 [2019-08-05 10:35:12,279 INFO L226 Difference]: Without dead ends: 38 [2019-08-05 10:35:12,279 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:35:12,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-08-05 10:35:12,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-08-05 10:35:12,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-05 10:35:12,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2019-08-05 10:35:12,282 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 36 [2019-08-05 10:35:12,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:12,282 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2019-08-05 10:35:12,282 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:35:12,282 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2019-08-05 10:35:12,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-08-05 10:35:12,283 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:12,283 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 1, 1, 1, 1, 1] [2019-08-05 10:35:12,283 INFO L418 AbstractCegarLoop]: === Iteration 49 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:12,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:12,283 INFO L82 PathProgramCache]: Analyzing trace with hash 1172095687, now seen corresponding path program 46 times [2019-08-05 10:35:12,284 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:12,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:12,295 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 67 conjunts are in the unsatisfiable core [2019-08-05 10:35:12,296 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:12,485 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:12,485 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:12,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:35:12,486 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:35:12,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:35:12,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:35:12,486 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 19 states. [2019-08-05 10:35:12,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:12,877 INFO L93 Difference]: Finished difference Result 58 states and 60 transitions. [2019-08-05 10:35:12,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:35:12,878 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 37 [2019-08-05 10:35:12,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:12,879 INFO L225 Difference]: With dead ends: 58 [2019-08-05 10:35:12,879 INFO L226 Difference]: Without dead ends: 56 [2019-08-05 10:35:12,880 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:35:12,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-08-05 10:35:12,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 40. [2019-08-05 10:35:12,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-05 10:35:12,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 42 transitions. [2019-08-05 10:35:12,882 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 42 transitions. Word has length 37 [2019-08-05 10:35:12,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:12,882 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 42 transitions. [2019-08-05 10:35:12,882 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:35:12,882 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2019-08-05 10:35:12,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-05 10:35:12,883 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:12,883 INFO L399 BasicCegarLoop]: trace histogram [17, 16, 1, 1, 1, 1, 1] [2019-08-05 10:35:12,883 INFO L418 AbstractCegarLoop]: === Iteration 50 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:12,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:12,883 INFO L82 PathProgramCache]: Analyzing trace with hash 1975166407, now seen corresponding path program 47 times [2019-08-05 10:35:12,884 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:12,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:12,897 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 67 conjunts are in the unsatisfiable core [2019-08-05 10:35:12,898 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:13,117 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 17 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:13,117 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:13,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:35:13,118 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:35:13,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:35:13,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:35:13,118 INFO L87 Difference]: Start difference. First operand 40 states and 42 transitions. Second operand 19 states. [2019-08-05 10:35:13,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:13,508 INFO L93 Difference]: Finished difference Result 56 states and 57 transitions. [2019-08-05 10:35:13,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:35:13,509 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 38 [2019-08-05 10:35:13,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:13,509 INFO L225 Difference]: With dead ends: 56 [2019-08-05 10:35:13,510 INFO L226 Difference]: Without dead ends: 39 [2019-08-05 10:35:13,510 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:35:13,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-08-05 10:35:13,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-08-05 10:35:13,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-05 10:35:13,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2019-08-05 10:35:13,512 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 38 [2019-08-05 10:35:13,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:13,513 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2019-08-05 10:35:13,513 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:35:13,513 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2019-08-05 10:35:13,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-05 10:35:13,514 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:13,514 INFO L399 BasicCegarLoop]: trace histogram [17, 16, 1, 1, 1, 1, 1] [2019-08-05 10:35:13,514 INFO L418 AbstractCegarLoop]: === Iteration 51 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:13,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:13,514 INFO L82 PathProgramCache]: Analyzing trace with hash -64328851, now seen corresponding path program 48 times [2019-08-05 10:35:13,515 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:13,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:13,525 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 35 conjunts are in the unsatisfiable core [2019-08-05 10:35:13,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:13,687 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 153 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:13,688 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:13,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:35:13,688 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:35:13,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:35:13,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:35:13,689 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 20 states. [2019-08-05 10:35:13,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:13,774 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2019-08-05 10:35:13,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 10:35:13,775 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 38 [2019-08-05 10:35:13,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:13,776 INFO L225 Difference]: With dead ends: 40 [2019-08-05 10:35:13,776 INFO L226 Difference]: Without dead ends: 40 [2019-08-05 10:35:13,777 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:35:13,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-08-05 10:35:13,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-08-05 10:35:13,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-05 10:35:13,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2019-08-05 10:35:13,779 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 38 [2019-08-05 10:35:13,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:13,779 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2019-08-05 10:35:13,779 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:35:13,780 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2019-08-05 10:35:13,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-08-05 10:35:13,780 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:13,780 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 1, 1, 1, 1, 1] [2019-08-05 10:35:13,781 INFO L418 AbstractCegarLoop]: === Iteration 52 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:13,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:13,781 INFO L82 PathProgramCache]: Analyzing trace with hash -1994255903, now seen corresponding path program 49 times [2019-08-05 10:35:13,782 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:13,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:13,797 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 71 conjunts are in the unsatisfiable core [2019-08-05 10:35:13,799 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:14,079 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:14,079 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:14,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:35:14,079 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:35:14,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:35:14,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:35:14,080 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand 20 states. [2019-08-05 10:35:14,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:14,591 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2019-08-05 10:35:14,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 10:35:14,591 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 39 [2019-08-05 10:35:14,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:14,592 INFO L225 Difference]: With dead ends: 61 [2019-08-05 10:35:14,592 INFO L226 Difference]: Without dead ends: 59 [2019-08-05 10:35:14,593 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:35:14,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-08-05 10:35:14,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 42. [2019-08-05 10:35:14,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-05 10:35:14,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2019-08-05 10:35:14,595 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 39 [2019-08-05 10:35:14,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:14,596 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2019-08-05 10:35:14,596 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:35:14,596 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2019-08-05 10:35:14,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 10:35:14,597 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:14,597 INFO L399 BasicCegarLoop]: trace histogram [18, 17, 1, 1, 1, 1, 1] [2019-08-05 10:35:14,597 INFO L418 AbstractCegarLoop]: === Iteration 53 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:14,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:14,597 INFO L82 PathProgramCache]: Analyzing trace with hash -1692452371, now seen corresponding path program 50 times [2019-08-05 10:35:14,598 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:14,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:14,611 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 71 conjunts are in the unsatisfiable core [2019-08-05 10:35:14,612 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:14,803 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 18 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:14,804 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:14,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:35:14,804 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:35:14,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:35:14,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:35:14,805 INFO L87 Difference]: Start difference. First operand 42 states and 44 transitions. Second operand 20 states. [2019-08-05 10:35:15,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:15,270 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2019-08-05 10:35:15,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 10:35:15,271 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 40 [2019-08-05 10:35:15,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:15,271 INFO L225 Difference]: With dead ends: 59 [2019-08-05 10:35:15,272 INFO L226 Difference]: Without dead ends: 41 [2019-08-05 10:35:15,272 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:35:15,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-08-05 10:35:15,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-08-05 10:35:15,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-05 10:35:15,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2019-08-05 10:35:15,274 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 40 [2019-08-05 10:35:15,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:15,275 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2019-08-05 10:35:15,275 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:35:15,275 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2019-08-05 10:35:15,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 10:35:15,276 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:15,276 INFO L399 BasicCegarLoop]: trace histogram [18, 17, 1, 1, 1, 1, 1] [2019-08-05 10:35:15,276 INFO L418 AbstractCegarLoop]: === Iteration 54 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:15,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:15,277 INFO L82 PathProgramCache]: Analyzing trace with hash -492295929, now seen corresponding path program 51 times [2019-08-05 10:35:15,277 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:15,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:15,288 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-05 10:35:15,289 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:15,489 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 171 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:15,489 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:15,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:35:15,489 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:35:15,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:35:15,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:35:15,490 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 21 states. [2019-08-05 10:35:15,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:15,554 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2019-08-05 10:35:15,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:35:15,554 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 40 [2019-08-05 10:35:15,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:15,555 INFO L225 Difference]: With dead ends: 42 [2019-08-05 10:35:15,555 INFO L226 Difference]: Without dead ends: 42 [2019-08-05 10:35:15,556 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:35:15,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-08-05 10:35:15,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-08-05 10:35:15,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-05 10:35:15,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2019-08-05 10:35:15,558 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 40 [2019-08-05 10:35:15,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:15,558 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2019-08-05 10:35:15,558 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:35:15,559 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2019-08-05 10:35:15,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-08-05 10:35:15,559 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:15,559 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 1, 1, 1, 1, 1] [2019-08-05 10:35:15,560 INFO L418 AbstractCegarLoop]: === Iteration 55 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:15,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:15,560 INFO L82 PathProgramCache]: Analyzing trace with hash 1918633863, now seen corresponding path program 52 times [2019-08-05 10:35:15,561 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:15,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:15,572 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 75 conjunts are in the unsatisfiable core [2019-08-05 10:35:15,573 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:15,846 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:15,846 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:15,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:35:15,847 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:35:15,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:35:15,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:35:15,847 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 21 states. [2019-08-05 10:35:16,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:16,368 INFO L93 Difference]: Finished difference Result 64 states and 66 transitions. [2019-08-05 10:35:16,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:35:16,368 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 41 [2019-08-05 10:35:16,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:16,369 INFO L225 Difference]: With dead ends: 64 [2019-08-05 10:35:16,369 INFO L226 Difference]: Without dead ends: 62 [2019-08-05 10:35:16,370 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:35:16,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-08-05 10:35:16,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 44. [2019-08-05 10:35:16,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-05 10:35:16,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2019-08-05 10:35:16,372 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 41 [2019-08-05 10:35:16,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:16,372 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2019-08-05 10:35:16,372 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:35:16,372 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2019-08-05 10:35:16,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-05 10:35:16,372 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:16,373 INFO L399 BasicCegarLoop]: trace histogram [19, 18, 1, 1, 1, 1, 1] [2019-08-05 10:35:16,373 INFO L418 AbstractCegarLoop]: === Iteration 56 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:16,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:16,373 INFO L82 PathProgramCache]: Analyzing trace with hash -651953913, now seen corresponding path program 53 times [2019-08-05 10:35:16,374 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:16,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:16,388 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 75 conjunts are in the unsatisfiable core [2019-08-05 10:35:16,389 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:16,802 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 19 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:16,802 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:16,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:35:16,802 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:35:16,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:35:16,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:35:16,803 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand 21 states. [2019-08-05 10:35:17,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:17,294 INFO L93 Difference]: Finished difference Result 62 states and 63 transitions. [2019-08-05 10:35:17,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:35:17,294 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 42 [2019-08-05 10:35:17,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:17,295 INFO L225 Difference]: With dead ends: 62 [2019-08-05 10:35:17,295 INFO L226 Difference]: Without dead ends: 43 [2019-08-05 10:35:17,295 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:35:17,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-08-05 10:35:17,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-08-05 10:35:17,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-05 10:35:17,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2019-08-05 10:35:17,297 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 42 [2019-08-05 10:35:17,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:17,298 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2019-08-05 10:35:17,298 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:35:17,298 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2019-08-05 10:35:17,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-05 10:35:17,299 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:17,299 INFO L399 BasicCegarLoop]: trace histogram [19, 18, 1, 1, 1, 1, 1] [2019-08-05 10:35:17,299 INFO L418 AbstractCegarLoop]: === Iteration 57 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:17,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:17,299 INFO L82 PathProgramCache]: Analyzing trace with hash -2101809875, now seen corresponding path program 54 times [2019-08-05 10:35:17,300 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:17,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:17,311 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 39 conjunts are in the unsatisfiable core [2019-08-05 10:35:17,313 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:17,515 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 190 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:17,516 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:17,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:35:17,516 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:35:17,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:35:17,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:35:17,517 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 22 states. [2019-08-05 10:35:17,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:17,588 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2019-08-05 10:35:17,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:35:17,588 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 42 [2019-08-05 10:35:17,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:17,589 INFO L225 Difference]: With dead ends: 44 [2019-08-05 10:35:17,589 INFO L226 Difference]: Without dead ends: 44 [2019-08-05 10:35:17,589 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:35:17,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-08-05 10:35:17,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-08-05 10:35:17,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-05 10:35:17,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2019-08-05 10:35:17,592 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 42 [2019-08-05 10:35:17,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:17,592 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2019-08-05 10:35:17,592 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:35:17,592 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2019-08-05 10:35:17,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-08-05 10:35:17,592 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:17,593 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 1, 1, 1, 1, 1] [2019-08-05 10:35:17,593 INFO L418 AbstractCegarLoop]: === Iteration 58 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:17,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:17,593 INFO L82 PathProgramCache]: Analyzing trace with hash -731658207, now seen corresponding path program 55 times [2019-08-05 10:35:17,594 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:17,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:17,608 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 79 conjunts are in the unsatisfiable core [2019-08-05 10:35:17,609 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:17,834 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:17,835 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:17,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:35:17,835 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:35:17,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:35:17,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:35:17,835 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand 22 states. [2019-08-05 10:35:18,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:18,369 INFO L93 Difference]: Finished difference Result 67 states and 69 transitions. [2019-08-05 10:35:18,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:35:18,369 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 43 [2019-08-05 10:35:18,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:18,370 INFO L225 Difference]: With dead ends: 67 [2019-08-05 10:35:18,370 INFO L226 Difference]: Without dead ends: 65 [2019-08-05 10:35:18,371 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:35:18,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-08-05 10:35:18,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 46. [2019-08-05 10:35:18,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-05 10:35:18,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 48 transitions. [2019-08-05 10:35:18,372 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 48 transitions. Word has length 43 [2019-08-05 10:35:18,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:18,372 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 48 transitions. [2019-08-05 10:35:18,372 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:35:18,372 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2019-08-05 10:35:18,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-08-05 10:35:18,372 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:18,373 INFO L399 BasicCegarLoop]: trace histogram [20, 19, 1, 1, 1, 1, 1] [2019-08-05 10:35:18,373 INFO L418 AbstractCegarLoop]: === Iteration 59 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:18,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:18,373 INFO L82 PathProgramCache]: Analyzing trace with hash -1206629459, now seen corresponding path program 56 times [2019-08-05 10:35:18,374 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:18,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:18,387 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 79 conjunts are in the unsatisfiable core [2019-08-05 10:35:18,388 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:18,875 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 20 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:18,875 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:18,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:35:18,876 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:35:18,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:35:18,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:35:18,876 INFO L87 Difference]: Start difference. First operand 46 states and 48 transitions. Second operand 22 states. [2019-08-05 10:35:19,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:19,410 INFO L93 Difference]: Finished difference Result 65 states and 66 transitions. [2019-08-05 10:35:19,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:35:19,411 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 44 [2019-08-05 10:35:19,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:19,412 INFO L225 Difference]: With dead ends: 65 [2019-08-05 10:35:19,412 INFO L226 Difference]: Without dead ends: 45 [2019-08-05 10:35:19,412 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:35:19,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-05 10:35:19,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-08-05 10:35:19,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-05 10:35:19,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2019-08-05 10:35:19,414 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 44 [2019-08-05 10:35:19,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:19,414 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2019-08-05 10:35:19,414 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:35:19,414 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2019-08-05 10:35:19,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-08-05 10:35:19,415 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:19,415 INFO L399 BasicCegarLoop]: trace histogram [20, 19, 1, 1, 1, 1, 1] [2019-08-05 10:35:19,415 INFO L418 AbstractCegarLoop]: === Iteration 60 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:19,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:19,416 INFO L82 PathProgramCache]: Analyzing trace with hash 1092475975, now seen corresponding path program 57 times [2019-08-05 10:35:19,416 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:19,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:19,428 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 41 conjunts are in the unsatisfiable core [2019-08-05 10:35:19,429 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:19,934 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 210 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:19,935 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:19,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:35:19,935 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:35:19,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:35:19,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:35:19,936 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 23 states. [2019-08-05 10:35:20,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:20,357 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2019-08-05 10:35:20,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 10:35:20,357 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 44 [2019-08-05 10:35:20,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:20,358 INFO L225 Difference]: With dead ends: 46 [2019-08-05 10:35:20,358 INFO L226 Difference]: Without dead ends: 46 [2019-08-05 10:35:20,358 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:35:20,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-08-05 10:35:20,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-08-05 10:35:20,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-05 10:35:20,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2019-08-05 10:35:20,360 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 44 [2019-08-05 10:35:20,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:20,360 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2019-08-05 10:35:20,361 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:35:20,361 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2019-08-05 10:35:20,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-08-05 10:35:20,361 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:20,361 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 1, 1, 1, 1, 1] [2019-08-05 10:35:20,362 INFO L418 AbstractCegarLoop]: === Iteration 61 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:20,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:20,363 INFO L82 PathProgramCache]: Analyzing trace with hash -493044665, now seen corresponding path program 58 times [2019-08-05 10:35:20,364 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:20,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:20,388 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 83 conjunts are in the unsatisfiable core [2019-08-05 10:35:20,389 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:20,841 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:20,841 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:20,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:35:20,841 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:35:20,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:35:20,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:35:20,842 INFO L87 Difference]: Start difference. First operand 46 states and 47 transitions. Second operand 23 states. [2019-08-05 10:35:21,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:21,449 INFO L93 Difference]: Finished difference Result 70 states and 72 transitions. [2019-08-05 10:35:21,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 10:35:21,450 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 45 [2019-08-05 10:35:21,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:21,450 INFO L225 Difference]: With dead ends: 70 [2019-08-05 10:35:21,451 INFO L226 Difference]: Without dead ends: 68 [2019-08-05 10:35:21,451 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:35:21,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-08-05 10:35:21,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 48. [2019-08-05 10:35:21,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-05 10:35:21,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2019-08-05 10:35:21,454 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 45 [2019-08-05 10:35:21,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:21,454 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2019-08-05 10:35:21,454 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:35:21,455 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2019-08-05 10:35:21,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-08-05 10:35:21,455 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:21,455 INFO L399 BasicCegarLoop]: trace histogram [21, 20, 1, 1, 1, 1, 1] [2019-08-05 10:35:21,455 INFO L418 AbstractCegarLoop]: === Iteration 62 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:21,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:21,456 INFO L82 PathProgramCache]: Analyzing trace with hash 1895423047, now seen corresponding path program 59 times [2019-08-05 10:35:21,456 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:21,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:21,472 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 83 conjunts are in the unsatisfiable core [2019-08-05 10:35:21,473 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:22,032 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 21 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:22,032 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:22,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:35:22,033 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:35:22,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:35:22,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:35:22,033 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand 23 states. [2019-08-05 10:35:22,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:22,632 INFO L93 Difference]: Finished difference Result 68 states and 69 transitions. [2019-08-05 10:35:22,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 10:35:22,633 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 46 [2019-08-05 10:35:22,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:22,634 INFO L225 Difference]: With dead ends: 68 [2019-08-05 10:35:22,634 INFO L226 Difference]: Without dead ends: 47 [2019-08-05 10:35:22,634 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:35:22,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-08-05 10:35:22,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-08-05 10:35:22,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-08-05 10:35:22,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2019-08-05 10:35:22,636 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 46 [2019-08-05 10:35:22,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:22,637 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2019-08-05 10:35:22,637 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:35:22,637 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2019-08-05 10:35:22,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-08-05 10:35:22,637 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:22,637 INFO L399 BasicCegarLoop]: trace histogram [21, 20, 1, 1, 1, 1, 1] [2019-08-05 10:35:22,637 INFO L418 AbstractCegarLoop]: === Iteration 63 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:22,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:22,638 INFO L82 PathProgramCache]: Analyzing trace with hash 153247469, now seen corresponding path program 60 times [2019-08-05 10:35:22,638 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:22,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:22,653 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 43 conjunts are in the unsatisfiable core [2019-08-05 10:35:22,655 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:23,244 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 231 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:23,244 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:23,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 10:35:23,245 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:35:23,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:35:23,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:35:23,246 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 24 states. [2019-08-05 10:35:23,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:23,436 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2019-08-05 10:35:23,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 10:35:23,436 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 46 [2019-08-05 10:35:23,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:23,437 INFO L225 Difference]: With dead ends: 48 [2019-08-05 10:35:23,437 INFO L226 Difference]: Without dead ends: 48 [2019-08-05 10:35:23,438 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:35:23,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-08-05 10:35:23,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-08-05 10:35:23,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-05 10:35:23,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2019-08-05 10:35:23,440 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 46 [2019-08-05 10:35:23,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:23,441 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2019-08-05 10:35:23,441 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:35:23,441 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2019-08-05 10:35:23,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 10:35:23,442 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:23,442 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 1, 1, 1, 1, 1] [2019-08-05 10:35:23,442 INFO L418 AbstractCegarLoop]: === Iteration 64 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:23,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:23,442 INFO L82 PathProgramCache]: Analyzing trace with hash 455642721, now seen corresponding path program 61 times [2019-08-05 10:35:23,443 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:23,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:23,459 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 87 conjunts are in the unsatisfiable core [2019-08-05 10:35:23,460 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:23,747 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:23,747 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:23,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:35:23,748 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:35:23,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:35:23,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:35:23,748 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand 24 states. [2019-08-05 10:35:24,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:24,452 INFO L93 Difference]: Finished difference Result 73 states and 75 transitions. [2019-08-05 10:35:24,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 10:35:24,452 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 47 [2019-08-05 10:35:24,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:24,453 INFO L225 Difference]: With dead ends: 73 [2019-08-05 10:35:24,453 INFO L226 Difference]: Without dead ends: 71 [2019-08-05 10:35:24,454 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:35:24,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-08-05 10:35:24,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 50. [2019-08-05 10:35:24,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-08-05 10:35:24,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 52 transitions. [2019-08-05 10:35:24,456 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 52 transitions. Word has length 47 [2019-08-05 10:35:24,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:24,457 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 52 transitions. [2019-08-05 10:35:24,457 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:35:24,457 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 52 transitions. [2019-08-05 10:35:24,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-08-05 10:35:24,457 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:24,457 INFO L399 BasicCegarLoop]: trace histogram [22, 21, 1, 1, 1, 1, 1] [2019-08-05 10:35:24,458 INFO L418 AbstractCegarLoop]: === Iteration 65 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:24,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:24,458 INFO L82 PathProgramCache]: Analyzing trace with hash 1239960941, now seen corresponding path program 62 times [2019-08-05 10:35:24,458 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:24,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:24,476 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 87 conjunts are in the unsatisfiable core [2019-08-05 10:35:24,477 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:24,827 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 22 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:24,827 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:24,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 10:35:24,828 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:35:24,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:35:24,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:35:24,828 INFO L87 Difference]: Start difference. First operand 50 states and 52 transitions. Second operand 24 states. [2019-08-05 10:35:25,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:25,581 INFO L93 Difference]: Finished difference Result 71 states and 72 transitions. [2019-08-05 10:35:25,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 10:35:25,582 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 48 [2019-08-05 10:35:25,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:25,582 INFO L225 Difference]: With dead ends: 71 [2019-08-05 10:35:25,582 INFO L226 Difference]: Without dead ends: 49 [2019-08-05 10:35:25,583 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:35:25,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-08-05 10:35:25,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-08-05 10:35:25,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-08-05 10:35:25,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2019-08-05 10:35:25,585 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 48 [2019-08-05 10:35:25,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:25,586 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2019-08-05 10:35:25,586 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:35:25,586 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2019-08-05 10:35:25,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-08-05 10:35:25,586 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:25,587 INFO L399 BasicCegarLoop]: trace histogram [22, 21, 1, 1, 1, 1, 1] [2019-08-05 10:35:25,587 INFO L418 AbstractCegarLoop]: === Iteration 66 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:25,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:25,587 INFO L82 PathProgramCache]: Analyzing trace with hash -1227874425, now seen corresponding path program 63 times [2019-08-05 10:35:25,588 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:25,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:25,601 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 45 conjunts are in the unsatisfiable core [2019-08-05 10:35:25,602 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:26,310 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 253 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:26,311 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:26,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 10:35:26,311 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 10:35:26,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 10:35:26,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:35:26,311 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 25 states. [2019-08-05 10:35:26,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:26,402 INFO L93 Difference]: Finished difference Result 50 states and 51 transitions. [2019-08-05 10:35:26,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:35:26,403 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 48 [2019-08-05 10:35:26,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:26,404 INFO L225 Difference]: With dead ends: 50 [2019-08-05 10:35:26,404 INFO L226 Difference]: Without dead ends: 50 [2019-08-05 10:35:26,404 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:35:26,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-08-05 10:35:26,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-08-05 10:35:26,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-08-05 10:35:26,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2019-08-05 10:35:26,406 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 51 transitions. Word has length 48 [2019-08-05 10:35:26,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:26,407 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 51 transitions. [2019-08-05 10:35:26,407 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 10:35:26,407 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2019-08-05 10:35:26,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-08-05 10:35:26,408 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:26,408 INFO L399 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1, 1] [2019-08-05 10:35:26,408 INFO L418 AbstractCegarLoop]: === Iteration 67 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:26,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:26,409 INFO L82 PathProgramCache]: Analyzing trace with hash 590536967, now seen corresponding path program 64 times [2019-08-05 10:35:26,409 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:26,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:26,428 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 91 conjunts are in the unsatisfiable core [2019-08-05 10:35:26,429 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:27,198 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:27,198 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:27,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 10:35:27,199 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 10:35:27,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 10:35:27,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:35:27,199 INFO L87 Difference]: Start difference. First operand 50 states and 51 transitions. Second operand 25 states. [2019-08-05 10:35:27,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:27,918 INFO L93 Difference]: Finished difference Result 76 states and 78 transitions. [2019-08-05 10:35:27,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:35:27,918 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 49 [2019-08-05 10:35:27,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:27,919 INFO L225 Difference]: With dead ends: 76 [2019-08-05 10:35:27,919 INFO L226 Difference]: Without dead ends: 74 [2019-08-05 10:35:27,920 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:35:27,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-08-05 10:35:27,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 52. [2019-08-05 10:35:27,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-05 10:35:27,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2019-08-05 10:35:27,922 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 49 [2019-08-05 10:35:27,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:27,922 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2019-08-05 10:35:27,922 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 10:35:27,923 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2019-08-05 10:35:27,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-08-05 10:35:27,923 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:27,923 INFO L399 BasicCegarLoop]: trace histogram [23, 22, 1, 1, 1, 1, 1] [2019-08-05 10:35:27,923 INFO L418 AbstractCegarLoop]: === Iteration 68 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:27,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:27,923 INFO L82 PathProgramCache]: Analyzing trace with hash 1126715271, now seen corresponding path program 65 times [2019-08-05 10:35:27,924 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:27,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:27,941 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 91 conjunts are in the unsatisfiable core [2019-08-05 10:35:27,942 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:28,212 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 23 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:28,212 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:28,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 10:35:28,213 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 10:35:28,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 10:35:28,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:35:28,213 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand 25 states. [2019-08-05 10:35:28,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:28,975 INFO L93 Difference]: Finished difference Result 74 states and 75 transitions. [2019-08-05 10:35:28,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:35:28,976 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 50 [2019-08-05 10:35:28,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:28,977 INFO L225 Difference]: With dead ends: 74 [2019-08-05 10:35:28,977 INFO L226 Difference]: Without dead ends: 51 [2019-08-05 10:35:28,977 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:35:28,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-05 10:35:28,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-08-05 10:35:28,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-08-05 10:35:28,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2019-08-05 10:35:28,979 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 50 [2019-08-05 10:35:28,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:28,979 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2019-08-05 10:35:28,980 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 10:35:28,980 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2019-08-05 10:35:28,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-08-05 10:35:28,980 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:28,980 INFO L399 BasicCegarLoop]: trace histogram [23, 22, 1, 1, 1, 1, 1] [2019-08-05 10:35:28,980 INFO L418 AbstractCegarLoop]: === Iteration 69 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:28,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:28,981 INFO L82 PathProgramCache]: Analyzing trace with hash 1933230253, now seen corresponding path program 66 times [2019-08-05 10:35:28,981 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:28,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:28,994 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 47 conjunts are in the unsatisfiable core [2019-08-05 10:35:28,995 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:29,240 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 276 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:29,240 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:29,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 10:35:29,241 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 10:35:29,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 10:35:29,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:35:29,241 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 26 states. [2019-08-05 10:35:29,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:29,330 INFO L93 Difference]: Finished difference Result 52 states and 53 transitions. [2019-08-05 10:35:29,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:35:29,330 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 50 [2019-08-05 10:35:29,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:29,331 INFO L225 Difference]: With dead ends: 52 [2019-08-05 10:35:29,331 INFO L226 Difference]: Without dead ends: 52 [2019-08-05 10:35:29,331 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:35:29,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-08-05 10:35:29,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-08-05 10:35:29,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-05 10:35:29,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2019-08-05 10:35:29,333 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 50 [2019-08-05 10:35:29,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:29,334 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 53 transitions. [2019-08-05 10:35:29,334 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 10:35:29,334 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2019-08-05 10:35:29,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-08-05 10:35:29,334 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:29,334 INFO L399 BasicCegarLoop]: trace histogram [23, 23, 1, 1, 1, 1, 1] [2019-08-05 10:35:29,335 INFO L418 AbstractCegarLoop]: === Iteration 70 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:29,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:29,335 INFO L82 PathProgramCache]: Analyzing trace with hash -199465823, now seen corresponding path program 67 times [2019-08-05 10:35:29,335 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:29,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:29,353 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 95 conjunts are in the unsatisfiable core [2019-08-05 10:35:29,354 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:30,201 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:30,201 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:30,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 10:35:30,202 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 10:35:30,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 10:35:30,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:35:30,202 INFO L87 Difference]: Start difference. First operand 52 states and 53 transitions. Second operand 26 states. [2019-08-05 10:35:30,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:30,986 INFO L93 Difference]: Finished difference Result 79 states and 81 transitions. [2019-08-05 10:35:30,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:35:30,987 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 51 [2019-08-05 10:35:30,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:30,988 INFO L225 Difference]: With dead ends: 79 [2019-08-05 10:35:30,988 INFO L226 Difference]: Without dead ends: 77 [2019-08-05 10:35:30,988 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:35:30,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-08-05 10:35:30,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 54. [2019-08-05 10:35:30,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-08-05 10:35:30,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 56 transitions. [2019-08-05 10:35:30,990 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 56 transitions. Word has length 51 [2019-08-05 10:35:30,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:30,990 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 56 transitions. [2019-08-05 10:35:30,990 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 10:35:30,990 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2019-08-05 10:35:30,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-08-05 10:35:30,991 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:30,991 INFO L399 BasicCegarLoop]: trace histogram [24, 23, 1, 1, 1, 1, 1] [2019-08-05 10:35:30,991 INFO L418 AbstractCegarLoop]: === Iteration 71 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:30,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:30,991 INFO L82 PathProgramCache]: Analyzing trace with hash -1888534739, now seen corresponding path program 68 times [2019-08-05 10:35:30,992 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:31,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:31,006 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 95 conjunts are in the unsatisfiable core [2019-08-05 10:35:31,007 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:31,263 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 24 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:31,263 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:31,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 10:35:31,263 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 10:35:31,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 10:35:31,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:35:31,264 INFO L87 Difference]: Start difference. First operand 54 states and 56 transitions. Second operand 26 states. [2019-08-05 10:35:32,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:32,194 INFO L93 Difference]: Finished difference Result 77 states and 78 transitions. [2019-08-05 10:35:32,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:35:32,195 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 52 [2019-08-05 10:35:32,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:32,196 INFO L225 Difference]: With dead ends: 77 [2019-08-05 10:35:32,196 INFO L226 Difference]: Without dead ends: 53 [2019-08-05 10:35:32,196 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:35:32,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-08-05 10:35:32,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-08-05 10:35:32,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-08-05 10:35:32,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2019-08-05 10:35:32,198 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 52 [2019-08-05 10:35:32,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:32,198 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2019-08-05 10:35:32,198 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 10:35:32,199 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2019-08-05 10:35:32,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-08-05 10:35:32,199 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:32,199 INFO L399 BasicCegarLoop]: trace histogram [24, 23, 1, 1, 1, 1, 1] [2019-08-05 10:35:32,200 INFO L418 AbstractCegarLoop]: === Iteration 72 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:32,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:32,200 INFO L82 PathProgramCache]: Analyzing trace with hash 1638593223, now seen corresponding path program 69 times [2019-08-05 10:35:32,200 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:32,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:32,214 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 49 conjunts are in the unsatisfiable core [2019-08-05 10:35:32,216 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:32,649 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 300 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:32,650 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:32,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 10:35:32,650 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 10:35:32,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 10:35:32,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:35:32,650 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 27 states. [2019-08-05 10:35:32,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:32,734 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2019-08-05 10:35:32,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 10:35:32,735 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 52 [2019-08-05 10:35:32,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:32,736 INFO L225 Difference]: With dead ends: 54 [2019-08-05 10:35:32,736 INFO L226 Difference]: Without dead ends: 54 [2019-08-05 10:35:32,736 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:35:32,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-05 10:35:32,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-08-05 10:35:32,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-08-05 10:35:32,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2019-08-05 10:35:32,738 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 52 [2019-08-05 10:35:32,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:32,738 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2019-08-05 10:35:32,738 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 10:35:32,739 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2019-08-05 10:35:32,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-08-05 10:35:32,739 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:32,739 INFO L399 BasicCegarLoop]: trace histogram [24, 24, 1, 1, 1, 1, 1] [2019-08-05 10:35:32,740 INFO L418 AbstractCegarLoop]: === Iteration 73 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:32,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:32,740 INFO L82 PathProgramCache]: Analyzing trace with hash -743279161, now seen corresponding path program 70 times [2019-08-05 10:35:32,740 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:32,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:32,757 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 99 conjunts are in the unsatisfiable core [2019-08-05 10:35:32,758 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:33,070 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:33,070 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:33,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 10:35:33,071 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 10:35:33,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 10:35:33,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:35:33,071 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand 27 states. [2019-08-05 10:35:33,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:33,927 INFO L93 Difference]: Finished difference Result 82 states and 84 transitions. [2019-08-05 10:35:33,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 10:35:33,928 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 53 [2019-08-05 10:35:33,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:33,929 INFO L225 Difference]: With dead ends: 82 [2019-08-05 10:35:33,929 INFO L226 Difference]: Without dead ends: 80 [2019-08-05 10:35:33,929 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:35:33,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-08-05 10:35:33,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 56. [2019-08-05 10:35:33,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-08-05 10:35:33,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2019-08-05 10:35:33,931 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 53 [2019-08-05 10:35:33,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:33,932 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2019-08-05 10:35:33,932 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 10:35:33,932 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2019-08-05 10:35:33,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 10:35:33,932 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:33,932 INFO L399 BasicCegarLoop]: trace histogram [25, 24, 1, 1, 1, 1, 1] [2019-08-05 10:35:33,933 INFO L418 AbstractCegarLoop]: === Iteration 74 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:33,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:33,933 INFO L82 PathProgramCache]: Analyzing trace with hash -1566879033, now seen corresponding path program 71 times [2019-08-05 10:35:33,934 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:33,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:33,949 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 99 conjunts are in the unsatisfiable core [2019-08-05 10:35:33,950 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:34,222 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 25 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:34,223 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:34,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 10:35:34,223 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 10:35:34,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 10:35:34,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:35:34,223 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand 27 states. [2019-08-05 10:35:35,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:35,071 INFO L93 Difference]: Finished difference Result 80 states and 81 transitions. [2019-08-05 10:35:35,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 10:35:35,072 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 54 [2019-08-05 10:35:35,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:35,073 INFO L225 Difference]: With dead ends: 80 [2019-08-05 10:35:35,073 INFO L226 Difference]: Without dead ends: 55 [2019-08-05 10:35:35,073 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:35:35,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-08-05 10:35:35,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-08-05 10:35:35,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-08-05 10:35:35,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2019-08-05 10:35:35,076 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 54 [2019-08-05 10:35:35,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:35,076 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2019-08-05 10:35:35,076 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 10:35:35,076 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2019-08-05 10:35:35,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 10:35:35,077 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:35,077 INFO L399 BasicCegarLoop]: trace histogram [25, 24, 1, 1, 1, 1, 1] [2019-08-05 10:35:35,077 INFO L418 AbstractCegarLoop]: === Iteration 75 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:35,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:35,078 INFO L82 PathProgramCache]: Analyzing trace with hash 399905389, now seen corresponding path program 72 times [2019-08-05 10:35:35,078 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:35,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:35,093 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 51 conjunts are in the unsatisfiable core [2019-08-05 10:35:35,094 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:35,440 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 325 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:35,441 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:35,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 10:35:35,441 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 10:35:35,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 10:35:35,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:35:35,442 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 28 states. [2019-08-05 10:35:35,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:35,535 INFO L93 Difference]: Finished difference Result 56 states and 57 transitions. [2019-08-05 10:35:35,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 10:35:35,536 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 54 [2019-08-05 10:35:35,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:35,536 INFO L225 Difference]: With dead ends: 56 [2019-08-05 10:35:35,537 INFO L226 Difference]: Without dead ends: 56 [2019-08-05 10:35:35,537 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:35:35,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-08-05 10:35:35,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-08-05 10:35:35,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-08-05 10:35:35,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 57 transitions. [2019-08-05 10:35:35,539 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 57 transitions. Word has length 54 [2019-08-05 10:35:35,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:35,539 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 57 transitions. [2019-08-05 10:35:35,540 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 10:35:35,540 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2019-08-05 10:35:35,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-08-05 10:35:35,540 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:35,540 INFO L399 BasicCegarLoop]: trace histogram [25, 25, 1, 1, 1, 1, 1] [2019-08-05 10:35:35,540 INFO L418 AbstractCegarLoop]: === Iteration 76 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:35,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:35,541 INFO L82 PathProgramCache]: Analyzing trace with hash -487896351, now seen corresponding path program 73 times [2019-08-05 10:35:35,541 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:35,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:35,570 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 103 conjunts are in the unsatisfiable core [2019-08-05 10:35:35,571 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:35,881 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:35,881 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:35,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 10:35:35,882 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 10:35:35,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 10:35:35,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:35:35,882 INFO L87 Difference]: Start difference. First operand 56 states and 57 transitions. Second operand 28 states. [2019-08-05 10:35:37,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:37,131 INFO L93 Difference]: Finished difference Result 85 states and 87 transitions. [2019-08-05 10:35:37,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 10:35:37,131 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 55 [2019-08-05 10:35:37,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:37,132 INFO L225 Difference]: With dead ends: 85 [2019-08-05 10:35:37,133 INFO L226 Difference]: Without dead ends: 83 [2019-08-05 10:35:37,133 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:35:37,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-08-05 10:35:37,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 58. [2019-08-05 10:35:37,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-08-05 10:35:37,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2019-08-05 10:35:37,136 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 55 [2019-08-05 10:35:37,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:37,136 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2019-08-05 10:35:37,137 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 10:35:37,137 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2019-08-05 10:35:37,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-08-05 10:35:37,137 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:37,138 INFO L399 BasicCegarLoop]: trace histogram [26, 25, 1, 1, 1, 1, 1] [2019-08-05 10:35:37,138 INFO L418 AbstractCegarLoop]: === Iteration 77 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:37,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:37,138 INFO L82 PathProgramCache]: Analyzing trace with hash 2055020781, now seen corresponding path program 74 times [2019-08-05 10:35:37,139 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:37,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:37,173 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 103 conjunts are in the unsatisfiable core [2019-08-05 10:35:37,175 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:37,818 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 26 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:37,818 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:37,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 10:35:37,818 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 10:35:37,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 10:35:37,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:35:37,819 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand 28 states. [2019-08-05 10:35:38,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:38,743 INFO L93 Difference]: Finished difference Result 83 states and 84 transitions. [2019-08-05 10:35:38,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 10:35:38,743 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 56 [2019-08-05 10:35:38,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:38,744 INFO L225 Difference]: With dead ends: 83 [2019-08-05 10:35:38,744 INFO L226 Difference]: Without dead ends: 57 [2019-08-05 10:35:38,745 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:35:38,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-05 10:35:38,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-08-05 10:35:38,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-08-05 10:35:38,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2019-08-05 10:35:38,747 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 56 [2019-08-05 10:35:38,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:38,747 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2019-08-05 10:35:38,747 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 10:35:38,748 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2019-08-05 10:35:38,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-08-05 10:35:38,748 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:38,748 INFO L399 BasicCegarLoop]: trace histogram [26, 25, 1, 1, 1, 1, 1] [2019-08-05 10:35:38,748 INFO L418 AbstractCegarLoop]: === Iteration 78 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:38,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:38,749 INFO L82 PathProgramCache]: Analyzing trace with hash -1399171577, now seen corresponding path program 75 times [2019-08-05 10:35:38,749 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:38,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:38,760 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 53 conjunts are in the unsatisfiable core [2019-08-05 10:35:38,761 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:39,243 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 351 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:39,243 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:39,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 10:35:39,244 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 10:35:39,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 10:35:39,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:35:39,245 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 29 states. [2019-08-05 10:35:39,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:39,359 INFO L93 Difference]: Finished difference Result 58 states and 59 transitions. [2019-08-05 10:35:39,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 10:35:39,360 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 56 [2019-08-05 10:35:39,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:39,360 INFO L225 Difference]: With dead ends: 58 [2019-08-05 10:35:39,360 INFO L226 Difference]: Without dead ends: 58 [2019-08-05 10:35:39,361 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:35:39,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-08-05 10:35:39,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-08-05 10:35:39,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-08-05 10:35:39,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 59 transitions. [2019-08-05 10:35:39,363 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 59 transitions. Word has length 56 [2019-08-05 10:35:39,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:39,363 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 59 transitions. [2019-08-05 10:35:39,364 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 10:35:39,364 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2019-08-05 10:35:39,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-08-05 10:35:39,364 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:39,365 INFO L399 BasicCegarLoop]: trace histogram [26, 26, 1, 1, 1, 1, 1] [2019-08-05 10:35:39,365 INFO L418 AbstractCegarLoop]: === Iteration 79 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:39,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:39,365 INFO L82 PathProgramCache]: Analyzing trace with hash -424707449, now seen corresponding path program 76 times [2019-08-05 10:35:39,366 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:39,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:39,384 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 107 conjunts are in the unsatisfiable core [2019-08-05 10:35:39,386 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:39,702 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:39,702 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:39,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 10:35:39,703 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 10:35:39,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 10:35:39,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:35:39,703 INFO L87 Difference]: Start difference. First operand 58 states and 59 transitions. Second operand 29 states. [2019-08-05 10:35:40,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:40,775 INFO L93 Difference]: Finished difference Result 88 states and 90 transitions. [2019-08-05 10:35:40,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 10:35:40,775 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 57 [2019-08-05 10:35:40,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:40,776 INFO L225 Difference]: With dead ends: 88 [2019-08-05 10:35:40,776 INFO L226 Difference]: Without dead ends: 86 [2019-08-05 10:35:40,777 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:35:40,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-08-05 10:35:40,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 60. [2019-08-05 10:35:40,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-08-05 10:35:40,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2019-08-05 10:35:40,779 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 57 [2019-08-05 10:35:40,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:40,780 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2019-08-05 10:35:40,780 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 10:35:40,780 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2019-08-05 10:35:40,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-08-05 10:35:40,781 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:40,781 INFO L399 BasicCegarLoop]: trace histogram [27, 26, 1, 1, 1, 1, 1] [2019-08-05 10:35:40,781 INFO L418 AbstractCegarLoop]: === Iteration 80 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:40,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:40,781 INFO L82 PathProgramCache]: Analyzing trace with hash -281090553, now seen corresponding path program 77 times [2019-08-05 10:35:40,782 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:40,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:40,802 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 107 conjunts are in the unsatisfiable core [2019-08-05 10:35:40,804 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:41,224 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 27 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:41,225 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:41,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 10:35:41,225 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 10:35:41,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 10:35:41,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:35:41,226 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand 29 states. [2019-08-05 10:35:42,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:42,318 INFO L93 Difference]: Finished difference Result 86 states and 87 transitions. [2019-08-05 10:35:42,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 10:35:42,318 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 58 [2019-08-05 10:35:42,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:42,319 INFO L225 Difference]: With dead ends: 86 [2019-08-05 10:35:42,319 INFO L226 Difference]: Without dead ends: 59 [2019-08-05 10:35:42,319 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:35:42,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-08-05 10:35:42,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-08-05 10:35:42,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-08-05 10:35:42,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2019-08-05 10:35:42,321 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 58 [2019-08-05 10:35:42,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:42,322 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2019-08-05 10:35:42,322 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 10:35:42,322 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2019-08-05 10:35:42,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-08-05 10:35:42,322 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:42,323 INFO L399 BasicCegarLoop]: trace histogram [27, 26, 1, 1, 1, 1, 1] [2019-08-05 10:35:42,323 INFO L418 AbstractCegarLoop]: === Iteration 81 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:42,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:42,323 INFO L82 PathProgramCache]: Analyzing trace with hash 13128749, now seen corresponding path program 78 times [2019-08-05 10:35:42,324 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:42,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:42,335 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 55 conjunts are in the unsatisfiable core [2019-08-05 10:35:42,336 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:42,652 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 378 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:42,652 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:42,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 10:35:42,653 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 10:35:42,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 10:35:42,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:35:42,653 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 30 states. [2019-08-05 10:35:42,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:42,753 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2019-08-05 10:35:42,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 10:35:42,754 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 58 [2019-08-05 10:35:42,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:42,754 INFO L225 Difference]: With dead ends: 60 [2019-08-05 10:35:42,754 INFO L226 Difference]: Without dead ends: 60 [2019-08-05 10:35:42,755 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:35:42,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-05 10:35:42,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-08-05 10:35:42,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-08-05 10:35:42,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2019-08-05 10:35:42,757 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 58 [2019-08-05 10:35:42,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:42,757 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2019-08-05 10:35:42,757 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 10:35:42,758 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2019-08-05 10:35:42,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-08-05 10:35:42,758 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:42,758 INFO L399 BasicCegarLoop]: trace histogram [27, 27, 1, 1, 1, 1, 1] [2019-08-05 10:35:42,758 INFO L418 AbstractCegarLoop]: === Iteration 82 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:42,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:42,759 INFO L82 PathProgramCache]: Analyzing trace with hash 406929697, now seen corresponding path program 79 times [2019-08-05 10:35:42,759 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:42,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:42,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 111 conjunts are in the unsatisfiable core [2019-08-05 10:35:42,779 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:43,126 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:43,127 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:43,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 10:35:43,127 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 10:35:43,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 10:35:43,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:35:43,127 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand 30 states. [2019-08-05 10:35:44,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:44,174 INFO L93 Difference]: Finished difference Result 91 states and 93 transitions. [2019-08-05 10:35:44,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 10:35:44,174 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 59 [2019-08-05 10:35:44,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:44,175 INFO L225 Difference]: With dead ends: 91 [2019-08-05 10:35:44,175 INFO L226 Difference]: Without dead ends: 89 [2019-08-05 10:35:44,176 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:35:44,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-08-05 10:35:44,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 62. [2019-08-05 10:35:44,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-08-05 10:35:44,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2019-08-05 10:35:44,178 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 59 [2019-08-05 10:35:44,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:44,179 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2019-08-05 10:35:44,179 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 10:35:44,179 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2019-08-05 10:35:44,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-08-05 10:35:44,179 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:44,179 INFO L399 BasicCegarLoop]: trace histogram [28, 27, 1, 1, 1, 1, 1] [2019-08-05 10:35:44,180 INFO L418 AbstractCegarLoop]: === Iteration 83 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:44,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:44,180 INFO L82 PathProgramCache]: Analyzing trace with hash -270142803, now seen corresponding path program 80 times [2019-08-05 10:35:44,181 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:44,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:44,204 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 111 conjunts are in the unsatisfiable core [2019-08-05 10:35:44,206 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:44,660 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 28 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:44,660 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:44,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 10:35:44,660 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 10:35:44,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 10:35:44,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:35:44,661 INFO L87 Difference]: Start difference. First operand 62 states and 64 transitions. Second operand 30 states. [2019-08-05 10:35:45,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:45,744 INFO L93 Difference]: Finished difference Result 89 states and 90 transitions. [2019-08-05 10:35:45,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 10:35:45,744 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 60 [2019-08-05 10:35:45,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:45,745 INFO L225 Difference]: With dead ends: 89 [2019-08-05 10:35:45,745 INFO L226 Difference]: Without dead ends: 61 [2019-08-05 10:35:45,745 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:35:45,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-08-05 10:35:45,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-08-05 10:35:45,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-08-05 10:35:45,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2019-08-05 10:35:45,748 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 60 [2019-08-05 10:35:45,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:45,748 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2019-08-05 10:35:45,748 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 10:35:45,748 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2019-08-05 10:35:45,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-08-05 10:35:45,748 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:45,749 INFO L399 BasicCegarLoop]: trace histogram [28, 27, 1, 1, 1, 1, 1] [2019-08-05 10:35:45,749 INFO L418 AbstractCegarLoop]: === Iteration 84 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:45,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:45,749 INFO L82 PathProgramCache]: Analyzing trace with hash 260720967, now seen corresponding path program 81 times [2019-08-05 10:35:45,750 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:45,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:45,765 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 57 conjunts are in the unsatisfiable core [2019-08-05 10:35:45,766 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:46,235 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 406 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:46,236 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:46,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-05 10:35:46,236 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-05 10:35:46,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-05 10:35:46,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:35:46,237 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand 31 states. [2019-08-05 10:35:46,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:46,340 INFO L93 Difference]: Finished difference Result 62 states and 63 transitions. [2019-08-05 10:35:46,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 10:35:46,341 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 60 [2019-08-05 10:35:46,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:46,341 INFO L225 Difference]: With dead ends: 62 [2019-08-05 10:35:46,341 INFO L226 Difference]: Without dead ends: 62 [2019-08-05 10:35:46,342 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:35:46,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-08-05 10:35:46,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-08-05 10:35:46,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-08-05 10:35:46,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 63 transitions. [2019-08-05 10:35:46,344 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 63 transitions. Word has length 60 [2019-08-05 10:35:46,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:46,344 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 63 transitions. [2019-08-05 10:35:46,344 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-05 10:35:46,344 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 63 transitions. [2019-08-05 10:35:46,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 10:35:46,345 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:46,345 INFO L399 BasicCegarLoop]: trace histogram [28, 28, 1, 1, 1, 1, 1] [2019-08-05 10:35:46,345 INFO L418 AbstractCegarLoop]: === Iteration 85 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:46,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:46,346 INFO L82 PathProgramCache]: Analyzing trace with hash -507646137, now seen corresponding path program 82 times [2019-08-05 10:35:46,346 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:46,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:46,370 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 115 conjunts are in the unsatisfiable core [2019-08-05 10:35:46,371 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:46,750 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:46,751 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:46,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 10:35:46,751 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-05 10:35:46,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-05 10:35:46,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:35:46,752 INFO L87 Difference]: Start difference. First operand 62 states and 63 transitions. Second operand 31 states. [2019-08-05 10:35:47,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:47,991 INFO L93 Difference]: Finished difference Result 94 states and 96 transitions. [2019-08-05 10:35:47,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 10:35:47,991 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 61 [2019-08-05 10:35:47,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:47,992 INFO L225 Difference]: With dead ends: 94 [2019-08-05 10:35:47,992 INFO L226 Difference]: Without dead ends: 92 [2019-08-05 10:35:47,993 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:35:47,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-08-05 10:35:47,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 64. [2019-08-05 10:35:47,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-08-05 10:35:47,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 66 transitions. [2019-08-05 10:35:47,995 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 66 transitions. Word has length 61 [2019-08-05 10:35:47,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:47,995 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 66 transitions. [2019-08-05 10:35:47,995 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-05 10:35:47,995 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 66 transitions. [2019-08-05 10:35:47,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-08-05 10:35:47,996 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:47,996 INFO L399 BasicCegarLoop]: trace histogram [29, 28, 1, 1, 1, 1, 1] [2019-08-05 10:35:47,996 INFO L418 AbstractCegarLoop]: === Iteration 86 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:47,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:47,996 INFO L82 PathProgramCache]: Analyzing trace with hash 1442777415, now seen corresponding path program 83 times [2019-08-05 10:35:47,997 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:48,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:48,023 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 115 conjunts are in the unsatisfiable core [2019-08-05 10:35:48,024 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:48,518 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 29 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:48,518 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:48,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-05 10:35:48,518 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-05 10:35:48,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-05 10:35:48,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:35:48,519 INFO L87 Difference]: Start difference. First operand 64 states and 66 transitions. Second operand 31 states. [2019-08-05 10:35:49,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:49,656 INFO L93 Difference]: Finished difference Result 92 states and 93 transitions. [2019-08-05 10:35:49,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 10:35:49,656 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 62 [2019-08-05 10:35:49,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:49,657 INFO L225 Difference]: With dead ends: 92 [2019-08-05 10:35:49,657 INFO L226 Difference]: Without dead ends: 63 [2019-08-05 10:35:49,658 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:35:49,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-05 10:35:49,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-08-05 10:35:49,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-08-05 10:35:49,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2019-08-05 10:35:49,660 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 62 [2019-08-05 10:35:49,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:49,660 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2019-08-05 10:35:49,660 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-05 10:35:49,660 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2019-08-05 10:35:49,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-08-05 10:35:49,661 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:49,661 INFO L399 BasicCegarLoop]: trace histogram [29, 28, 1, 1, 1, 1, 1] [2019-08-05 10:35:49,661 INFO L418 AbstractCegarLoop]: === Iteration 87 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:49,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:49,661 INFO L82 PathProgramCache]: Analyzing trace with hash 719685101, now seen corresponding path program 84 times [2019-08-05 10:35:49,662 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:49,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:49,680 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 59 conjunts are in the unsatisfiable core [2019-08-05 10:35:49,682 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:50,390 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 435 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:50,390 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:50,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-05 10:35:50,390 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 10:35:50,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 10:35:50,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:35:50,391 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 32 states. [2019-08-05 10:35:50,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:50,585 INFO L93 Difference]: Finished difference Result 64 states and 65 transitions. [2019-08-05 10:35:50,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-05 10:35:50,586 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 62 [2019-08-05 10:35:50,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:50,587 INFO L225 Difference]: With dead ends: 64 [2019-08-05 10:35:50,587 INFO L226 Difference]: Without dead ends: 64 [2019-08-05 10:35:50,587 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:35:50,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-08-05 10:35:50,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-08-05 10:35:50,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-08-05 10:35:50,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 65 transitions. [2019-08-05 10:35:50,589 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 65 transitions. Word has length 62 [2019-08-05 10:35:50,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:50,590 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 65 transitions. [2019-08-05 10:35:50,590 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 10:35:50,590 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2019-08-05 10:35:50,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-08-05 10:35:50,590 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:50,591 INFO L399 BasicCegarLoop]: trace histogram [29, 29, 1, 1, 1, 1, 1] [2019-08-05 10:35:50,591 INFO L418 AbstractCegarLoop]: === Iteration 88 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:50,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:50,591 INFO L82 PathProgramCache]: Analyzing trace with hash 835340129, now seen corresponding path program 85 times [2019-08-05 10:35:50,592 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:50,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:50,619 INFO L256 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 119 conjunts are in the unsatisfiable core [2019-08-05 10:35:50,620 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:51,895 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:51,895 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:51,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-05 10:35:51,896 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 10:35:51,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 10:35:51,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:35:51,896 INFO L87 Difference]: Start difference. First operand 64 states and 65 transitions. Second operand 32 states. [2019-08-05 10:35:53,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:53,191 INFO L93 Difference]: Finished difference Result 97 states and 99 transitions. [2019-08-05 10:35:53,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-05 10:35:53,191 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 63 [2019-08-05 10:35:53,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:53,193 INFO L225 Difference]: With dead ends: 97 [2019-08-05 10:35:53,193 INFO L226 Difference]: Without dead ends: 95 [2019-08-05 10:35:53,194 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:35:53,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-08-05 10:35:53,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 66. [2019-08-05 10:35:53,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-08-05 10:35:53,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 68 transitions. [2019-08-05 10:35:53,195 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 68 transitions. Word has length 63 [2019-08-05 10:35:53,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:53,196 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 68 transitions. [2019-08-05 10:35:53,196 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 10:35:53,196 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 68 transitions. [2019-08-05 10:35:53,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-08-05 10:35:53,197 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:53,197 INFO L399 BasicCegarLoop]: trace histogram [30, 29, 1, 1, 1, 1, 1] [2019-08-05 10:35:53,197 INFO L418 AbstractCegarLoop]: === Iteration 89 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:53,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:53,198 INFO L82 PathProgramCache]: Analyzing trace with hash 125678701, now seen corresponding path program 86 times [2019-08-05 10:35:53,198 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:53,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:53,225 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 119 conjunts are in the unsatisfiable core [2019-08-05 10:35:53,226 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:53,741 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 30 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:53,741 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:53,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-05 10:35:53,742 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 10:35:53,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 10:35:53,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:35:53,742 INFO L87 Difference]: Start difference. First operand 66 states and 68 transitions. Second operand 32 states. [2019-08-05 10:35:54,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:54,985 INFO L93 Difference]: Finished difference Result 95 states and 96 transitions. [2019-08-05 10:35:54,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-05 10:35:54,985 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 64 [2019-08-05 10:35:54,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:54,986 INFO L225 Difference]: With dead ends: 95 [2019-08-05 10:35:54,986 INFO L226 Difference]: Without dead ends: 65 [2019-08-05 10:35:54,987 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:35:54,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-08-05 10:35:54,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-08-05 10:35:54,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-08-05 10:35:54,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2019-08-05 10:35:54,988 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 64 [2019-08-05 10:35:54,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:54,989 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2019-08-05 10:35:54,989 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 10:35:54,989 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2019-08-05 10:35:54,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-08-05 10:35:54,989 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:54,989 INFO L399 BasicCegarLoop]: trace histogram [30, 29, 1, 1, 1, 1, 1] [2019-08-05 10:35:54,989 INFO L418 AbstractCegarLoop]: === Iteration 90 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:54,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:54,990 INFO L82 PathProgramCache]: Analyzing trace with hash -815346553, now seen corresponding path program 87 times [2019-08-05 10:35:54,990 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:55,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:55,009 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 61 conjunts are in the unsatisfiable core [2019-08-05 10:35:55,010 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:55,556 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 465 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:55,556 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:55,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-05 10:35:55,557 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-05 10:35:55,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-05 10:35:55,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:35:55,557 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand 33 states. [2019-08-05 10:35:55,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:55,716 INFO L93 Difference]: Finished difference Result 66 states and 67 transitions. [2019-08-05 10:35:55,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-05 10:35:55,717 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 64 [2019-08-05 10:35:55,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:55,717 INFO L225 Difference]: With dead ends: 66 [2019-08-05 10:35:55,718 INFO L226 Difference]: Without dead ends: 66 [2019-08-05 10:35:55,718 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:35:55,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-05 10:35:55,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-08-05 10:35:55,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-08-05 10:35:55,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 67 transitions. [2019-08-05 10:35:55,722 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 67 transitions. Word has length 64 [2019-08-05 10:35:55,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:55,723 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 67 transitions. [2019-08-05 10:35:55,723 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-05 10:35:55,723 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 67 transitions. [2019-08-05 10:35:55,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-08-05 10:35:55,723 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:55,723 INFO L399 BasicCegarLoop]: trace histogram [30, 30, 1, 1, 1, 1, 1] [2019-08-05 10:35:55,723 INFO L418 AbstractCegarLoop]: === Iteration 91 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:55,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:55,724 INFO L82 PathProgramCache]: Analyzing trace with hash 493999111, now seen corresponding path program 88 times [2019-08-05 10:35:55,724 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:55,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:55,741 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 123 conjunts are in the unsatisfiable core [2019-08-05 10:35:55,742 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:56,161 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:56,161 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:56,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-05 10:35:56,162 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-05 10:35:56,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-05 10:35:56,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:35:56,162 INFO L87 Difference]: Start difference. First operand 66 states and 67 transitions. Second operand 33 states. [2019-08-05 10:35:57,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:57,473 INFO L93 Difference]: Finished difference Result 100 states and 102 transitions. [2019-08-05 10:35:57,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-05 10:35:57,473 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 65 [2019-08-05 10:35:57,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:57,474 INFO L225 Difference]: With dead ends: 100 [2019-08-05 10:35:57,474 INFO L226 Difference]: Without dead ends: 98 [2019-08-05 10:35:57,474 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:35:57,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-08-05 10:35:57,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 68. [2019-08-05 10:35:57,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-08-05 10:35:57,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 70 transitions. [2019-08-05 10:35:57,477 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 70 transitions. Word has length 65 [2019-08-05 10:35:57,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:57,478 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 70 transitions. [2019-08-05 10:35:57,478 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-05 10:35:57,478 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2019-08-05 10:35:57,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-08-05 10:35:57,478 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:57,478 INFO L399 BasicCegarLoop]: trace histogram [31, 30, 1, 1, 1, 1, 1] [2019-08-05 10:35:57,478 INFO L418 AbstractCegarLoop]: === Iteration 92 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:57,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:57,479 INFO L82 PathProgramCache]: Analyzing trace with hash -1865958265, now seen corresponding path program 89 times [2019-08-05 10:35:57,479 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:57,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:57,499 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 123 conjunts are in the unsatisfiable core [2019-08-05 10:35:57,500 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:57,991 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 31 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:57,991 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:57,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-05 10:35:57,991 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-05 10:35:57,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-05 10:35:57,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:35:57,992 INFO L87 Difference]: Start difference. First operand 68 states and 70 transitions. Second operand 33 states. [2019-08-05 10:35:59,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:59,266 INFO L93 Difference]: Finished difference Result 98 states and 99 transitions. [2019-08-05 10:35:59,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-05 10:35:59,266 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 66 [2019-08-05 10:35:59,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:59,267 INFO L225 Difference]: With dead ends: 98 [2019-08-05 10:35:59,267 INFO L226 Difference]: Without dead ends: 67 [2019-08-05 10:35:59,268 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:35:59,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-08-05 10:35:59,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-08-05 10:35:59,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-08-05 10:35:59,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2019-08-05 10:35:59,270 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 66 [2019-08-05 10:35:59,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:59,270 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2019-08-05 10:35:59,270 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-05 10:35:59,270 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2019-08-05 10:35:59,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-08-05 10:35:59,271 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:59,271 INFO L399 BasicCegarLoop]: trace histogram [31, 30, 1, 1, 1, 1, 1] [2019-08-05 10:35:59,271 INFO L418 AbstractCegarLoop]: === Iteration 93 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:59,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:59,272 INFO L82 PathProgramCache]: Analyzing trace with hash -972970067, now seen corresponding path program 90 times [2019-08-05 10:35:59,272 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:59,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:59,287 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 63 conjunts are in the unsatisfiable core [2019-08-05 10:35:59,288 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:59,786 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 496 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:59,786 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:59,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 10:35:59,786 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 10:35:59,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 10:35:59,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:35:59,787 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 34 states. [2019-08-05 10:35:59,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:59,950 INFO L93 Difference]: Finished difference Result 68 states and 69 transitions. [2019-08-05 10:35:59,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-05 10:35:59,950 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 66 [2019-08-05 10:35:59,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:59,951 INFO L225 Difference]: With dead ends: 68 [2019-08-05 10:35:59,951 INFO L226 Difference]: Without dead ends: 68 [2019-08-05 10:35:59,952 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:35:59,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-08-05 10:35:59,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-08-05 10:35:59,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-08-05 10:35:59,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 69 transitions. [2019-08-05 10:35:59,954 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 69 transitions. Word has length 66 [2019-08-05 10:35:59,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:59,954 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 69 transitions. [2019-08-05 10:35:59,954 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 10:35:59,954 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 69 transitions. [2019-08-05 10:35:59,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-08-05 10:35:59,955 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:59,955 INFO L399 BasicCegarLoop]: trace histogram [31, 31, 1, 1, 1, 1, 1] [2019-08-05 10:35:59,955 INFO L418 AbstractCegarLoop]: === Iteration 94 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:59,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:59,955 INFO L82 PathProgramCache]: Analyzing trace with hash -97362527, now seen corresponding path program 91 times [2019-08-05 10:35:59,956 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:59,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:59,975 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 127 conjunts are in the unsatisfiable core [2019-08-05 10:35:59,976 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:00,368 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:00,369 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:00,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-05 10:36:00,369 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 10:36:00,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 10:36:00,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:36:00,369 INFO L87 Difference]: Start difference. First operand 68 states and 69 transitions. Second operand 34 states. [2019-08-05 10:36:01,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:01,722 INFO L93 Difference]: Finished difference Result 103 states and 105 transitions. [2019-08-05 10:36:01,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-05 10:36:01,722 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 67 [2019-08-05 10:36:01,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:01,723 INFO L225 Difference]: With dead ends: 103 [2019-08-05 10:36:01,723 INFO L226 Difference]: Without dead ends: 101 [2019-08-05 10:36:01,724 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:36:01,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-08-05 10:36:01,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 70. [2019-08-05 10:36:01,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-08-05 10:36:01,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 72 transitions. [2019-08-05 10:36:01,726 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 72 transitions. Word has length 67 [2019-08-05 10:36:01,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:01,726 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 72 transitions. [2019-08-05 10:36:01,727 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 10:36:01,727 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 72 transitions. [2019-08-05 10:36:01,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 10:36:01,727 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:01,727 INFO L399 BasicCegarLoop]: trace histogram [32, 31, 1, 1, 1, 1, 1] [2019-08-05 10:36:01,727 INFO L418 AbstractCegarLoop]: === Iteration 95 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:01,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:01,728 INFO L82 PathProgramCache]: Analyzing trace with hash 1276667437, now seen corresponding path program 92 times [2019-08-05 10:36:01,728 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:01,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:01,750 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 127 conjunts are in the unsatisfiable core [2019-08-05 10:36:01,751 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:03,052 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 32 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:03,052 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:03,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 10:36:03,052 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 10:36:03,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 10:36:03,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:36:03,053 INFO L87 Difference]: Start difference. First operand 70 states and 72 transitions. Second operand 34 states. [2019-08-05 10:36:06,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:06,814 INFO L93 Difference]: Finished difference Result 101 states and 102 transitions. [2019-08-05 10:36:06,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-05 10:36:06,815 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 68 [2019-08-05 10:36:06,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:06,816 INFO L225 Difference]: With dead ends: 101 [2019-08-05 10:36:06,816 INFO L226 Difference]: Without dead ends: 69 [2019-08-05 10:36:06,816 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:36:06,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-05 10:36:06,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-08-05 10:36:06,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-05 10:36:06,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2019-08-05 10:36:06,818 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 68 [2019-08-05 10:36:06,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:06,818 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2019-08-05 10:36:06,819 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 10:36:06,819 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2019-08-05 10:36:06,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 10:36:06,819 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:06,820 INFO L399 BasicCegarLoop]: trace histogram [32, 31, 1, 1, 1, 1, 1] [2019-08-05 10:36:06,820 INFO L418 AbstractCegarLoop]: === Iteration 96 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:06,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:06,820 INFO L82 PathProgramCache]: Analyzing trace with hash -1105469497, now seen corresponding path program 93 times [2019-08-05 10:36:06,821 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:06,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:06,836 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 65 conjunts are in the unsatisfiable core [2019-08-05 10:36:06,838 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:07,315 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 528 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:07,315 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:07,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-05 10:36:07,315 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 10:36:07,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 10:36:07,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:36:07,316 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 35 states. [2019-08-05 10:36:07,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:07,461 INFO L93 Difference]: Finished difference Result 70 states and 71 transitions. [2019-08-05 10:36:07,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 10:36:07,461 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 68 [2019-08-05 10:36:07,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:07,462 INFO L225 Difference]: With dead ends: 70 [2019-08-05 10:36:07,462 INFO L226 Difference]: Without dead ends: 70 [2019-08-05 10:36:07,462 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:36:07,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-08-05 10:36:07,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-08-05 10:36:07,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-08-05 10:36:07,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 71 transitions. [2019-08-05 10:36:07,464 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 71 transitions. Word has length 68 [2019-08-05 10:36:07,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:07,465 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 71 transitions. [2019-08-05 10:36:07,465 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 10:36:07,465 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2019-08-05 10:36:07,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-08-05 10:36:07,466 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:07,466 INFO L399 BasicCegarLoop]: trace histogram [32, 32, 1, 1, 1, 1, 1] [2019-08-05 10:36:07,466 INFO L418 AbstractCegarLoop]: === Iteration 97 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:07,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:07,467 INFO L82 PathProgramCache]: Analyzing trace with hash 90122439, now seen corresponding path program 94 times [2019-08-05 10:36:07,467 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:07,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:07,495 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 131 conjunts are in the unsatisfiable core [2019-08-05 10:36:07,496 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:08,249 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:08,249 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:08,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 10:36:08,250 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 10:36:08,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 10:36:08,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:36:08,250 INFO L87 Difference]: Start difference. First operand 70 states and 71 transitions. Second operand 35 states. [2019-08-05 10:36:09,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:09,679 INFO L93 Difference]: Finished difference Result 106 states and 108 transitions. [2019-08-05 10:36:09,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 10:36:09,680 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 69 [2019-08-05 10:36:09,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:09,681 INFO L225 Difference]: With dead ends: 106 [2019-08-05 10:36:09,681 INFO L226 Difference]: Without dead ends: 104 [2019-08-05 10:36:09,681 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:36:09,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-08-05 10:36:09,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 72. [2019-08-05 10:36:09,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-08-05 10:36:09,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 74 transitions. [2019-08-05 10:36:09,684 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 74 transitions. Word has length 69 [2019-08-05 10:36:09,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:09,684 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 74 transitions. [2019-08-05 10:36:09,684 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 10:36:09,684 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 74 transitions. [2019-08-05 10:36:09,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-08-05 10:36:09,685 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:09,685 INFO L399 BasicCegarLoop]: trace histogram [33, 32, 1, 1, 1, 1, 1] [2019-08-05 10:36:09,685 INFO L418 AbstractCegarLoop]: === Iteration 98 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:09,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:09,685 INFO L82 PathProgramCache]: Analyzing trace with hash -1501233209, now seen corresponding path program 95 times [2019-08-05 10:36:09,686 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:09,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:09,706 INFO L256 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 131 conjunts are in the unsatisfiable core [2019-08-05 10:36:09,707 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:10,259 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 33 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:10,259 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:10,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-05 10:36:10,260 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 10:36:10,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 10:36:10,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:36:10,260 INFO L87 Difference]: Start difference. First operand 72 states and 74 transitions. Second operand 35 states. [2019-08-05 10:36:11,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:11,696 INFO L93 Difference]: Finished difference Result 104 states and 105 transitions. [2019-08-05 10:36:11,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 10:36:11,697 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 70 [2019-08-05 10:36:11,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:11,698 INFO L225 Difference]: With dead ends: 104 [2019-08-05 10:36:11,698 INFO L226 Difference]: Without dead ends: 71 [2019-08-05 10:36:11,698 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:36:11,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-08-05 10:36:11,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-08-05 10:36:11,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-08-05 10:36:11,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2019-08-05 10:36:11,701 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 70 [2019-08-05 10:36:11,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:11,701 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2019-08-05 10:36:11,701 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 10:36:11,702 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2019-08-05 10:36:11,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-08-05 10:36:11,702 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:11,702 INFO L399 BasicCegarLoop]: trace histogram [33, 32, 1, 1, 1, 1, 1] [2019-08-05 10:36:11,702 INFO L418 AbstractCegarLoop]: === Iteration 99 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:11,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:11,703 INFO L82 PathProgramCache]: Analyzing trace with hash 1961933165, now seen corresponding path program 96 times [2019-08-05 10:36:11,703 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:11,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:11,718 INFO L256 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 67 conjunts are in the unsatisfiable core [2019-08-05 10:36:11,719 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:12,214 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 561 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:12,214 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:12,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-05 10:36:12,215 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-05 10:36:12,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-05 10:36:12,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:36:12,215 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand 36 states. [2019-08-05 10:36:12,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:12,350 INFO L93 Difference]: Finished difference Result 72 states and 73 transitions. [2019-08-05 10:36:12,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-05 10:36:12,350 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 70 [2019-08-05 10:36:12,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:12,351 INFO L225 Difference]: With dead ends: 72 [2019-08-05 10:36:12,351 INFO L226 Difference]: Without dead ends: 72 [2019-08-05 10:36:12,351 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:36:12,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-08-05 10:36:12,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-08-05 10:36:12,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-08-05 10:36:12,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2019-08-05 10:36:12,354 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 73 transitions. Word has length 70 [2019-08-05 10:36:12,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:12,354 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 73 transitions. [2019-08-05 10:36:12,354 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-05 10:36:12,354 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2019-08-05 10:36:12,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-08-05 10:36:12,355 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:12,355 INFO L399 BasicCegarLoop]: trace histogram [33, 33, 1, 1, 1, 1, 1] [2019-08-05 10:36:12,355 INFO L418 AbstractCegarLoop]: === Iteration 100 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:12,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:12,355 INFO L82 PathProgramCache]: Analyzing trace with hash 690324449, now seen corresponding path program 97 times [2019-08-05 10:36:12,356 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:12,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:12,386 INFO L256 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 135 conjunts are in the unsatisfiable core [2019-08-05 10:36:12,387 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:13,054 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:13,054 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:13,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-05 10:36:13,054 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-05 10:36:13,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-05 10:36:13,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:36:13,055 INFO L87 Difference]: Start difference. First operand 72 states and 73 transitions. Second operand 36 states. [2019-08-05 10:36:14,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:14,595 INFO L93 Difference]: Finished difference Result 109 states and 111 transitions. [2019-08-05 10:36:14,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-05 10:36:14,596 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 71 [2019-08-05 10:36:14,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:14,597 INFO L225 Difference]: With dead ends: 109 [2019-08-05 10:36:14,597 INFO L226 Difference]: Without dead ends: 107 [2019-08-05 10:36:14,597 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:36:14,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-08-05 10:36:14,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 74. [2019-08-05 10:36:14,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-08-05 10:36:14,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 76 transitions. [2019-08-05 10:36:14,599 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 76 transitions. Word has length 71 [2019-08-05 10:36:14,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:14,599 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 76 transitions. [2019-08-05 10:36:14,599 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-05 10:36:14,600 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 76 transitions. [2019-08-05 10:36:14,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-08-05 10:36:14,600 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:14,600 INFO L399 BasicCegarLoop]: trace histogram [34, 33, 1, 1, 1, 1, 1] [2019-08-05 10:36:14,600 INFO L418 AbstractCegarLoop]: === Iteration 101 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:14,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:14,601 INFO L82 PathProgramCache]: Analyzing trace with hash -74840083, now seen corresponding path program 98 times [2019-08-05 10:36:14,601 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:14,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:14,629 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 135 conjunts are in the unsatisfiable core [2019-08-05 10:36:14,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:15,187 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 34 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:15,187 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:15,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-05 10:36:15,188 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-05 10:36:15,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-05 10:36:15,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:36:15,189 INFO L87 Difference]: Start difference. First operand 74 states and 76 transitions. Second operand 36 states. [2019-08-05 10:36:16,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:16,717 INFO L93 Difference]: Finished difference Result 107 states and 108 transitions. [2019-08-05 10:36:16,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-05 10:36:16,717 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 72 [2019-08-05 10:36:16,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:16,718 INFO L225 Difference]: With dead ends: 107 [2019-08-05 10:36:16,718 INFO L226 Difference]: Without dead ends: 73 [2019-08-05 10:36:16,718 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:36:16,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-08-05 10:36:16,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-08-05 10:36:16,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-08-05 10:36:16,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 74 transitions. [2019-08-05 10:36:16,720 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 74 transitions. Word has length 72 [2019-08-05 10:36:16,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:16,721 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 74 transitions. [2019-08-05 10:36:16,721 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-05 10:36:16,721 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2019-08-05 10:36:16,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-08-05 10:36:16,721 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:16,721 INFO L399 BasicCegarLoop]: trace histogram [34, 33, 1, 1, 1, 1, 1] [2019-08-05 10:36:16,722 INFO L418 AbstractCegarLoop]: === Iteration 102 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:16,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:16,722 INFO L82 PathProgramCache]: Analyzing trace with hash -90864889, now seen corresponding path program 99 times [2019-08-05 10:36:16,722 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:16,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:16,738 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 69 conjunts are in the unsatisfiable core [2019-08-05 10:36:16,740 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:17,368 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 595 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:17,369 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:17,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-05 10:36:17,369 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-05 10:36:17,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-05 10:36:17,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:36:17,369 INFO L87 Difference]: Start difference. First operand 73 states and 74 transitions. Second operand 37 states. [2019-08-05 10:36:17,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:17,492 INFO L93 Difference]: Finished difference Result 74 states and 75 transitions. [2019-08-05 10:36:17,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-05 10:36:17,493 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 72 [2019-08-05 10:36:17,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:17,493 INFO L225 Difference]: With dead ends: 74 [2019-08-05 10:36:17,494 INFO L226 Difference]: Without dead ends: 74 [2019-08-05 10:36:17,494 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 36 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-05 10:36:17,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-08-05 10:36:17,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-08-05 10:36:17,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-08-05 10:36:17,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 75 transitions. [2019-08-05 10:36:17,496 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 75 transitions. Word has length 72 [2019-08-05 10:36:17,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:17,497 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 75 transitions. [2019-08-05 10:36:17,497 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-05 10:36:17,497 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 75 transitions. [2019-08-05 10:36:17,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-08-05 10:36:17,497 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:17,497 INFO L399 BasicCegarLoop]: trace histogram [34, 34, 1, 1, 1, 1, 1] [2019-08-05 10:36:17,498 INFO L418 AbstractCegarLoop]: === Iteration 103 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:17,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:17,498 INFO L82 PathProgramCache]: Analyzing trace with hash 1478094215, now seen corresponding path program 100 times [2019-08-05 10:36:17,499 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:17,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:17,529 INFO L256 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 139 conjunts are in the unsatisfiable core [2019-08-05 10:36:17,530 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:18,296 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:18,297 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:18,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-05 10:36:18,297 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-05 10:36:18,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-05 10:36:18,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:36:18,298 INFO L87 Difference]: Start difference. First operand 74 states and 75 transitions. Second operand 37 states. [2019-08-05 10:36:19,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:19,911 INFO L93 Difference]: Finished difference Result 112 states and 114 transitions. [2019-08-05 10:36:19,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-05 10:36:19,911 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 73 [2019-08-05 10:36:19,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:19,912 INFO L225 Difference]: With dead ends: 112 [2019-08-05 10:36:19,912 INFO L226 Difference]: Without dead ends: 110 [2019-08-05 10:36:19,913 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:36:19,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-08-05 10:36:19,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 76. [2019-08-05 10:36:19,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-08-05 10:36:19,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 78 transitions. [2019-08-05 10:36:19,915 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 78 transitions. Word has length 73 [2019-08-05 10:36:19,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:19,915 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 78 transitions. [2019-08-05 10:36:19,915 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-05 10:36:19,915 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 78 transitions. [2019-08-05 10:36:19,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-08-05 10:36:19,915 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:19,916 INFO L399 BasicCegarLoop]: trace histogram [35, 34, 1, 1, 1, 1, 1] [2019-08-05 10:36:19,916 INFO L418 AbstractCegarLoop]: === Iteration 104 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:19,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:19,916 INFO L82 PathProgramCache]: Analyzing trace with hash -1423781113, now seen corresponding path program 101 times [2019-08-05 10:36:19,916 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:19,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:19,943 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 139 conjunts are in the unsatisfiable core [2019-08-05 10:36:19,944 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:20,427 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 35 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:20,428 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:20,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-05 10:36:20,428 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-05 10:36:20,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-05 10:36:20,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:36:20,429 INFO L87 Difference]: Start difference. First operand 76 states and 78 transitions. Second operand 37 states. [2019-08-05 10:36:22,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:22,044 INFO L93 Difference]: Finished difference Result 110 states and 111 transitions. [2019-08-05 10:36:22,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-05 10:36:22,044 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 74 [2019-08-05 10:36:22,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:22,045 INFO L225 Difference]: With dead ends: 110 [2019-08-05 10:36:22,045 INFO L226 Difference]: Without dead ends: 75 [2019-08-05 10:36:22,045 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:36:22,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-08-05 10:36:22,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-08-05 10:36:22,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-05 10:36:22,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2019-08-05 10:36:22,048 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 74 [2019-08-05 10:36:22,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:22,048 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2019-08-05 10:36:22,048 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-05 10:36:22,048 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2019-08-05 10:36:22,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-08-05 10:36:22,049 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:22,049 INFO L399 BasicCegarLoop]: trace histogram [35, 34, 1, 1, 1, 1, 1] [2019-08-05 10:36:22,049 INFO L418 AbstractCegarLoop]: === Iteration 105 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:22,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:22,050 INFO L82 PathProgramCache]: Analyzing trace with hash -1920550099, now seen corresponding path program 102 times [2019-08-05 10:36:22,050 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:22,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:22,065 INFO L256 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 71 conjunts are in the unsatisfiable core [2019-08-05 10:36:22,067 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:22,583 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 630 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:22,583 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:22,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-05 10:36:22,584 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-05 10:36:22,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-05 10:36:22,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:36:22,584 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand 38 states. [2019-08-05 10:36:22,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:22,711 INFO L93 Difference]: Finished difference Result 76 states and 77 transitions. [2019-08-05 10:36:22,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-05 10:36:22,711 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 74 [2019-08-05 10:36:22,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:22,712 INFO L225 Difference]: With dead ends: 76 [2019-08-05 10:36:22,712 INFO L226 Difference]: Without dead ends: 76 [2019-08-05 10:36:22,713 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:36:22,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-08-05 10:36:22,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-08-05 10:36:22,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-08-05 10:36:22,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 77 transitions. [2019-08-05 10:36:22,715 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 77 transitions. Word has length 74 [2019-08-05 10:36:22,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:22,716 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 77 transitions. [2019-08-05 10:36:22,716 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-05 10:36:22,716 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 77 transitions. [2019-08-05 10:36:22,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-08-05 10:36:22,716 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:22,717 INFO L399 BasicCegarLoop]: trace histogram [35, 35, 1, 1, 1, 1, 1] [2019-08-05 10:36:22,717 INFO L418 AbstractCegarLoop]: === Iteration 106 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:22,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:22,717 INFO L82 PathProgramCache]: Analyzing trace with hash 592427553, now seen corresponding path program 103 times [2019-08-05 10:36:22,718 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:22,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:22,751 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 143 conjunts are in the unsatisfiable core [2019-08-05 10:36:22,752 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:23,542 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:23,543 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:23,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-05 10:36:23,543 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-05 10:36:23,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-05 10:36:23,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:36:23,544 INFO L87 Difference]: Start difference. First operand 76 states and 77 transitions. Second operand 38 states. [2019-08-05 10:36:25,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:25,252 INFO L93 Difference]: Finished difference Result 115 states and 117 transitions. [2019-08-05 10:36:25,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-05 10:36:25,252 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 75 [2019-08-05 10:36:25,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:25,253 INFO L225 Difference]: With dead ends: 115 [2019-08-05 10:36:25,254 INFO L226 Difference]: Without dead ends: 113 [2019-08-05 10:36:25,254 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:36:25,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-08-05 10:36:25,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 78. [2019-08-05 10:36:25,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-08-05 10:36:25,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 80 transitions. [2019-08-05 10:36:25,256 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 80 transitions. Word has length 75 [2019-08-05 10:36:25,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:25,257 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 80 transitions. [2019-08-05 10:36:25,257 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-05 10:36:25,257 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 80 transitions. [2019-08-05 10:36:25,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-08-05 10:36:25,257 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:25,257 INFO L399 BasicCegarLoop]: trace histogram [36, 35, 1, 1, 1, 1, 1] [2019-08-05 10:36:25,258 INFO L418 AbstractCegarLoop]: === Iteration 107 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:25,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:25,258 INFO L82 PathProgramCache]: Analyzing trace with hash 1185323437, now seen corresponding path program 104 times [2019-08-05 10:36:25,258 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:25,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:25,295 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 143 conjunts are in the unsatisfiable core [2019-08-05 10:36:25,296 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:25,975 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 36 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:25,975 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:25,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-05 10:36:25,976 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-05 10:36:25,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-05 10:36:25,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:36:25,976 INFO L87 Difference]: Start difference. First operand 78 states and 80 transitions. Second operand 38 states. [2019-08-05 10:36:27,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:27,669 INFO L93 Difference]: Finished difference Result 113 states and 114 transitions. [2019-08-05 10:36:27,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-05 10:36:27,670 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 76 [2019-08-05 10:36:27,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:27,671 INFO L225 Difference]: With dead ends: 113 [2019-08-05 10:36:27,671 INFO L226 Difference]: Without dead ends: 77 [2019-08-05 10:36:27,671 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:36:27,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-08-05 10:36:27,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-08-05 10:36:27,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-05 10:36:27,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2019-08-05 10:36:27,673 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 76 [2019-08-05 10:36:27,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:27,673 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2019-08-05 10:36:27,673 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-05 10:36:27,673 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2019-08-05 10:36:27,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-08-05 10:36:27,674 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:27,674 INFO L399 BasicCegarLoop]: trace histogram [36, 35, 1, 1, 1, 1, 1] [2019-08-05 10:36:27,674 INFO L418 AbstractCegarLoop]: === Iteration 108 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:27,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:27,675 INFO L82 PathProgramCache]: Analyzing trace with hash -1329613241, now seen corresponding path program 105 times [2019-08-05 10:36:27,675 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:27,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:27,691 INFO L256 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 73 conjunts are in the unsatisfiable core [2019-08-05 10:36:27,692 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:28,411 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 666 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:28,412 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:28,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-05 10:36:28,412 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-05 10:36:28,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-05 10:36:28,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:36:28,413 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand 39 states. [2019-08-05 10:36:28,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:28,610 INFO L93 Difference]: Finished difference Result 78 states and 79 transitions. [2019-08-05 10:36:28,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-05 10:36:28,611 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 76 [2019-08-05 10:36:28,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:28,611 INFO L225 Difference]: With dead ends: 78 [2019-08-05 10:36:28,612 INFO L226 Difference]: Without dead ends: 78 [2019-08-05 10:36:28,612 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:36:28,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-08-05 10:36:28,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-08-05 10:36:28,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-08-05 10:36:28,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 79 transitions. [2019-08-05 10:36:28,614 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 79 transitions. Word has length 76 [2019-08-05 10:36:28,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:28,614 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 79 transitions. [2019-08-05 10:36:28,615 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-05 10:36:28,615 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 79 transitions. [2019-08-05 10:36:28,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 10:36:28,615 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:28,615 INFO L399 BasicCegarLoop]: trace histogram [36, 36, 1, 1, 1, 1, 1] [2019-08-05 10:36:28,615 INFO L418 AbstractCegarLoop]: === Iteration 109 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:28,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:28,616 INFO L82 PathProgramCache]: Analyzing trace with hash 1731600967, now seen corresponding path program 106 times [2019-08-05 10:36:28,616 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:28,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:28,645 INFO L256 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 147 conjunts are in the unsatisfiable core [2019-08-05 10:36:28,646 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:29,209 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:29,209 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:29,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-05 10:36:29,209 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-05 10:36:29,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-05 10:36:29,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:36:29,210 INFO L87 Difference]: Start difference. First operand 78 states and 79 transitions. Second operand 39 states. [2019-08-05 10:36:31,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:31,006 INFO L93 Difference]: Finished difference Result 118 states and 120 transitions. [2019-08-05 10:36:31,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-05 10:36:31,006 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 77 [2019-08-05 10:36:31,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:31,007 INFO L225 Difference]: With dead ends: 118 [2019-08-05 10:36:31,007 INFO L226 Difference]: Without dead ends: 116 [2019-08-05 10:36:31,008 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:36:31,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-08-05 10:36:31,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 80. [2019-08-05 10:36:31,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-08-05 10:36:31,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 82 transitions. [2019-08-05 10:36:31,010 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 82 transitions. Word has length 77 [2019-08-05 10:36:31,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:31,010 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 82 transitions. [2019-08-05 10:36:31,010 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-05 10:36:31,010 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 82 transitions. [2019-08-05 10:36:31,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-08-05 10:36:31,011 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:31,011 INFO L399 BasicCegarLoop]: trace histogram [37, 36, 1, 1, 1, 1, 1] [2019-08-05 10:36:31,011 INFO L418 AbstractCegarLoop]: === Iteration 110 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:31,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:31,011 INFO L82 PathProgramCache]: Analyzing trace with hash 2139960903, now seen corresponding path program 107 times [2019-08-05 10:36:31,012 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:31,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:31,054 INFO L256 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 147 conjunts are in the unsatisfiable core [2019-08-05 10:36:31,056 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:31,668 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 37 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:31,669 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:31,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-05 10:36:31,669 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-05 10:36:31,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-05 10:36:31,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:36:31,669 INFO L87 Difference]: Start difference. First operand 80 states and 82 transitions. Second operand 39 states. [2019-08-05 10:36:33,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:33,606 INFO L93 Difference]: Finished difference Result 116 states and 117 transitions. [2019-08-05 10:36:33,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-05 10:36:33,606 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 78 [2019-08-05 10:36:33,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:33,607 INFO L225 Difference]: With dead ends: 116 [2019-08-05 10:36:33,607 INFO L226 Difference]: Without dead ends: 79 [2019-08-05 10:36:33,607 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:36:33,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-08-05 10:36:33,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-08-05 10:36:33,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-08-05 10:36:33,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2019-08-05 10:36:33,610 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 78 [2019-08-05 10:36:33,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:33,610 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2019-08-05 10:36:33,610 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-05 10:36:33,610 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2019-08-05 10:36:33,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-08-05 10:36:33,611 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:33,611 INFO L399 BasicCegarLoop]: trace histogram [37, 36, 1, 1, 1, 1, 1] [2019-08-05 10:36:33,611 INFO L418 AbstractCegarLoop]: === Iteration 111 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:33,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:33,611 INFO L82 PathProgramCache]: Analyzing trace with hash 1486335213, now seen corresponding path program 108 times [2019-08-05 10:36:33,612 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:33,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:33,634 INFO L256 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 75 conjunts are in the unsatisfiable core [2019-08-05 10:36:33,636 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:34,584 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 703 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:34,585 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:34,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-05 10:36:34,585 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-05 10:36:34,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-05 10:36:34,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:36:34,585 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand 40 states. [2019-08-05 10:36:34,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:34,725 INFO L93 Difference]: Finished difference Result 80 states and 81 transitions. [2019-08-05 10:36:34,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-05 10:36:34,726 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 78 [2019-08-05 10:36:34,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:34,726 INFO L225 Difference]: With dead ends: 80 [2019-08-05 10:36:34,726 INFO L226 Difference]: Without dead ends: 80 [2019-08-05 10:36:34,727 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:36:34,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-08-05 10:36:34,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-08-05 10:36:34,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-08-05 10:36:34,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 81 transitions. [2019-08-05 10:36:34,729 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 81 transitions. Word has length 78 [2019-08-05 10:36:34,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:34,730 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 81 transitions. [2019-08-05 10:36:34,730 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-05 10:36:34,730 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 81 transitions. [2019-08-05 10:36:34,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-08-05 10:36:34,731 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:34,731 INFO L399 BasicCegarLoop]: trace histogram [37, 37, 1, 1, 1, 1, 1] [2019-08-05 10:36:34,731 INFO L418 AbstractCegarLoop]: === Iteration 112 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:34,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:34,731 INFO L82 PathProgramCache]: Analyzing trace with hash -1168310175, now seen corresponding path program 109 times [2019-08-05 10:36:34,732 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:34,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:34,759 INFO L256 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 151 conjunts are in the unsatisfiable core [2019-08-05 10:36:34,760 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:35,355 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:35,355 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:35,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-05 10:36:35,355 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-05 10:36:35,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-05 10:36:35,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:36:35,356 INFO L87 Difference]: Start difference. First operand 80 states and 81 transitions. Second operand 40 states. [2019-08-05 10:36:37,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:37,246 INFO L93 Difference]: Finished difference Result 121 states and 123 transitions. [2019-08-05 10:36:37,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-05 10:36:37,246 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 79 [2019-08-05 10:36:37,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:37,247 INFO L225 Difference]: With dead ends: 121 [2019-08-05 10:36:37,247 INFO L226 Difference]: Without dead ends: 119 [2019-08-05 10:36:37,247 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:36:37,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-08-05 10:36:37,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 82. [2019-08-05 10:36:37,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-08-05 10:36:37,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 84 transitions. [2019-08-05 10:36:37,250 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 84 transitions. Word has length 79 [2019-08-05 10:36:37,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:37,250 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 84 transitions. [2019-08-05 10:36:37,250 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-05 10:36:37,250 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 84 transitions. [2019-08-05 10:36:37,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-08-05 10:36:37,251 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:37,251 INFO L399 BasicCegarLoop]: trace histogram [38, 37, 1, 1, 1, 1, 1] [2019-08-05 10:36:37,251 INFO L418 AbstractCegarLoop]: === Iteration 113 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:37,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:37,252 INFO L82 PathProgramCache]: Analyzing trace with hash -1857938579, now seen corresponding path program 110 times [2019-08-05 10:36:37,252 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:37,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:37,301 INFO L256 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 151 conjunts are in the unsatisfiable core [2019-08-05 10:36:37,303 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:37,975 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 38 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:37,975 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:37,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-05 10:36:37,976 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-05 10:36:37,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-05 10:36:37,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:36:37,976 INFO L87 Difference]: Start difference. First operand 82 states and 84 transitions. Second operand 40 states. [2019-08-05 10:36:40,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:40,093 INFO L93 Difference]: Finished difference Result 119 states and 120 transitions. [2019-08-05 10:36:40,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-05 10:36:40,094 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 80 [2019-08-05 10:36:40,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:40,094 INFO L225 Difference]: With dead ends: 119 [2019-08-05 10:36:40,094 INFO L226 Difference]: Without dead ends: 81 [2019-08-05 10:36:40,095 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:36:40,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-08-05 10:36:40,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-08-05 10:36:40,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-08-05 10:36:40,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2019-08-05 10:36:40,096 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 80 [2019-08-05 10:36:40,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:40,097 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2019-08-05 10:36:40,097 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-05 10:36:40,097 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2019-08-05 10:36:40,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-08-05 10:36:40,097 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:40,098 INFO L399 BasicCegarLoop]: trace histogram [38, 37, 1, 1, 1, 1, 1] [2019-08-05 10:36:40,098 INFO L418 AbstractCegarLoop]: === Iteration 114 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:40,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:40,098 INFO L82 PathProgramCache]: Analyzing trace with hash -645498489, now seen corresponding path program 111 times [2019-08-05 10:36:40,099 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:40,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:40,116 INFO L256 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 77 conjunts are in the unsatisfiable core [2019-08-05 10:36:40,116 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:40,734 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 741 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:40,734 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:40,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-05 10:36:40,735 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-05 10:36:40,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-05 10:36:40,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:36:40,735 INFO L87 Difference]: Start difference. First operand 81 states and 82 transitions. Second operand 41 states. [2019-08-05 10:36:40,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:40,878 INFO L93 Difference]: Finished difference Result 82 states and 83 transitions. [2019-08-05 10:36:40,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-05 10:36:40,878 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 80 [2019-08-05 10:36:40,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:40,879 INFO L225 Difference]: With dead ends: 82 [2019-08-05 10:36:40,879 INFO L226 Difference]: Without dead ends: 82 [2019-08-05 10:36:40,879 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:36:40,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-08-05 10:36:40,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2019-08-05 10:36:40,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-08-05 10:36:40,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 83 transitions. [2019-08-05 10:36:40,881 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 83 transitions. Word has length 80 [2019-08-05 10:36:40,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:40,881 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 83 transitions. [2019-08-05 10:36:40,882 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-05 10:36:40,882 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 83 transitions. [2019-08-05 10:36:40,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-08-05 10:36:40,882 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:40,883 INFO L399 BasicCegarLoop]: trace histogram [38, 38, 1, 1, 1, 1, 1] [2019-08-05 10:36:40,883 INFO L418 AbstractCegarLoop]: === Iteration 115 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:40,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:40,883 INFO L82 PathProgramCache]: Analyzing trace with hash 1464321799, now seen corresponding path program 112 times [2019-08-05 10:36:40,884 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:40,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:40,909 INFO L256 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 155 conjunts are in the unsatisfiable core [2019-08-05 10:36:40,910 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:41,505 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:41,506 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:41,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-05 10:36:41,506 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-05 10:36:41,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-05 10:36:41,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:36:41,507 INFO L87 Difference]: Start difference. First operand 82 states and 83 transitions. Second operand 41 states. [2019-08-05 10:36:43,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:43,559 INFO L93 Difference]: Finished difference Result 124 states and 126 transitions. [2019-08-05 10:36:43,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-05 10:36:43,560 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 81 [2019-08-05 10:36:43,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:43,560 INFO L225 Difference]: With dead ends: 124 [2019-08-05 10:36:43,560 INFO L226 Difference]: Without dead ends: 122 [2019-08-05 10:36:43,560 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:36:43,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-08-05 10:36:43,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 84. [2019-08-05 10:36:43,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-08-05 10:36:43,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 86 transitions. [2019-08-05 10:36:43,562 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 86 transitions. Word has length 81 [2019-08-05 10:36:43,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:43,562 INFO L475 AbstractCegarLoop]: Abstraction has 84 states and 86 transitions. [2019-08-05 10:36:43,562 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-05 10:36:43,562 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 86 transitions. [2019-08-05 10:36:43,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-08-05 10:36:43,563 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:43,563 INFO L399 BasicCegarLoop]: trace histogram [39, 38, 1, 1, 1, 1, 1] [2019-08-05 10:36:43,563 INFO L418 AbstractCegarLoop]: === Iteration 116 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:43,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:43,563 INFO L82 PathProgramCache]: Analyzing trace with hash -1850726009, now seen corresponding path program 113 times [2019-08-05 10:36:43,563 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:43,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:43,590 INFO L256 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 155 conjunts are in the unsatisfiable core [2019-08-05 10:36:43,591 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:44,372 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 39 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:44,372 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:44,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-05 10:36:44,372 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-05 10:36:44,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-05 10:36:44,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:36:44,373 INFO L87 Difference]: Start difference. First operand 84 states and 86 transitions. Second operand 41 states. [2019-08-05 10:36:46,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:46,363 INFO L93 Difference]: Finished difference Result 122 states and 123 transitions. [2019-08-05 10:36:46,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-05 10:36:46,364 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 82 [2019-08-05 10:36:46,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:46,365 INFO L225 Difference]: With dead ends: 122 [2019-08-05 10:36:46,365 INFO L226 Difference]: Without dead ends: 83 [2019-08-05 10:36:46,365 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:36:46,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-08-05 10:36:46,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-08-05 10:36:46,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-08-05 10:36:46,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 84 transitions. [2019-08-05 10:36:46,368 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 84 transitions. Word has length 82 [2019-08-05 10:36:46,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:46,368 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 84 transitions. [2019-08-05 10:36:46,368 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-05 10:36:46,368 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 84 transitions. [2019-08-05 10:36:46,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-08-05 10:36:46,369 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:46,369 INFO L399 BasicCegarLoop]: trace histogram [39, 38, 1, 1, 1, 1, 1] [2019-08-05 10:36:46,369 INFO L418 AbstractCegarLoop]: === Iteration 117 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:46,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:46,370 INFO L82 PathProgramCache]: Analyzing trace with hash 1375178413, now seen corresponding path program 114 times [2019-08-05 10:36:46,370 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:46,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:46,393 INFO L256 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 79 conjunts are in the unsatisfiable core [2019-08-05 10:36:46,394 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:47,027 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 780 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:47,027 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:47,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-05 10:36:47,028 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-05 10:36:47,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-05 10:36:47,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:36:47,029 INFO L87 Difference]: Start difference. First operand 83 states and 84 transitions. Second operand 42 states. [2019-08-05 10:36:47,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:47,200 INFO L93 Difference]: Finished difference Result 84 states and 85 transitions. [2019-08-05 10:36:47,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-05 10:36:47,201 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 82 [2019-08-05 10:36:47,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:47,202 INFO L225 Difference]: With dead ends: 84 [2019-08-05 10:36:47,202 INFO L226 Difference]: Without dead ends: 84 [2019-08-05 10:36:47,202 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:36:47,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-08-05 10:36:47,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2019-08-05 10:36:47,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-08-05 10:36:47,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 85 transitions. [2019-08-05 10:36:47,204 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 85 transitions. Word has length 82 [2019-08-05 10:36:47,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:47,204 INFO L475 AbstractCegarLoop]: Abstraction has 84 states and 85 transitions. [2019-08-05 10:36:47,204 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-05 10:36:47,204 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 85 transitions. [2019-08-05 10:36:47,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-08-05 10:36:47,205 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:47,205 INFO L399 BasicCegarLoop]: trace histogram [39, 39, 1, 1, 1, 1, 1] [2019-08-05 10:36:47,205 INFO L418 AbstractCegarLoop]: === Iteration 118 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:47,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:47,206 INFO L82 PathProgramCache]: Analyzing trace with hash -319203679, now seen corresponding path program 115 times [2019-08-05 10:36:47,206 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:47,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:47,240 INFO L256 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 159 conjunts are in the unsatisfiable core [2019-08-05 10:36:47,241 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:47,913 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:47,914 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:47,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-05 10:36:47,914 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-05 10:36:47,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-05 10:36:47,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:36:47,914 INFO L87 Difference]: Start difference. First operand 84 states and 85 transitions. Second operand 42 states. [2019-08-05 10:36:50,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:50,199 INFO L93 Difference]: Finished difference Result 127 states and 129 transitions. [2019-08-05 10:36:50,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-05 10:36:50,200 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 83 [2019-08-05 10:36:50,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:50,200 INFO L225 Difference]: With dead ends: 127 [2019-08-05 10:36:50,200 INFO L226 Difference]: Without dead ends: 125 [2019-08-05 10:36:50,201 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:36:50,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-08-05 10:36:50,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 86. [2019-08-05 10:36:50,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-08-05 10:36:50,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 88 transitions. [2019-08-05 10:36:50,202 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 88 transitions. Word has length 83 [2019-08-05 10:36:50,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:50,203 INFO L475 AbstractCegarLoop]: Abstraction has 86 states and 88 transitions. [2019-08-05 10:36:50,203 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-05 10:36:50,203 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 88 transitions. [2019-08-05 10:36:50,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-08-05 10:36:50,204 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:50,204 INFO L399 BasicCegarLoop]: trace histogram [40, 39, 1, 1, 1, 1, 1] [2019-08-05 10:36:50,204 INFO L418 AbstractCegarLoop]: === Iteration 119 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:50,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:50,204 INFO L82 PathProgramCache]: Analyzing trace with hash -1305440979, now seen corresponding path program 116 times [2019-08-05 10:36:50,205 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:50,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:50,242 INFO L256 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 159 conjunts are in the unsatisfiable core [2019-08-05 10:36:50,243 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:50,899 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 40 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:50,899 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:50,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-05 10:36:50,900 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-05 10:36:50,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-05 10:36:50,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:36:50,900 INFO L87 Difference]: Start difference. First operand 86 states and 88 transitions. Second operand 42 states. [2019-08-05 10:36:52,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:52,994 INFO L93 Difference]: Finished difference Result 125 states and 126 transitions. [2019-08-05 10:36:52,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-05 10:36:52,994 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 84 [2019-08-05 10:36:52,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:52,995 INFO L225 Difference]: With dead ends: 125 [2019-08-05 10:36:52,995 INFO L226 Difference]: Without dead ends: 85 [2019-08-05 10:36:52,995 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:36:52,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-08-05 10:36:52,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-08-05 10:36:52,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-08-05 10:36:52,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2019-08-05 10:36:52,998 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 84 [2019-08-05 10:36:52,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:52,998 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2019-08-05 10:36:52,998 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-05 10:36:52,998 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2019-08-05 10:36:52,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-08-05 10:36:52,999 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:52,999 INFO L399 BasicCegarLoop]: trace histogram [40, 39, 1, 1, 1, 1, 1] [2019-08-05 10:36:52,999 INFO L418 AbstractCegarLoop]: === Iteration 120 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:52,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:52,999 INFO L82 PathProgramCache]: Analyzing trace with hash -86651705, now seen corresponding path program 117 times [2019-08-05 10:36:53,000 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:53,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:53,026 INFO L256 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 81 conjunts are in the unsatisfiable core [2019-08-05 10:36:53,027 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:53,728 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 820 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:53,728 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:53,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-05 10:36:53,729 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-05 10:36:53,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-05 10:36:53,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:36:53,729 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand 43 states. [2019-08-05 10:36:54,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:54,028 INFO L93 Difference]: Finished difference Result 86 states and 87 transitions. [2019-08-05 10:36:54,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-05 10:36:54,028 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 84 [2019-08-05 10:36:54,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:54,028 INFO L225 Difference]: With dead ends: 86 [2019-08-05 10:36:54,028 INFO L226 Difference]: Without dead ends: 86 [2019-08-05 10:36:54,029 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:36:54,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-08-05 10:36:54,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2019-08-05 10:36:54,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-08-05 10:36:54,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 87 transitions. [2019-08-05 10:36:54,030 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 87 transitions. Word has length 84 [2019-08-05 10:36:54,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:54,030 INFO L475 AbstractCegarLoop]: Abstraction has 86 states and 87 transitions. [2019-08-05 10:36:54,030 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-05 10:36:54,030 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 87 transitions. [2019-08-05 10:36:54,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 10:36:54,030 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:54,031 INFO L399 BasicCegarLoop]: trace histogram [40, 40, 1, 1, 1, 1, 1] [2019-08-05 10:36:54,031 INFO L418 AbstractCegarLoop]: === Iteration 121 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:54,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:54,031 INFO L82 PathProgramCache]: Analyzing trace with hash 1608702919, now seen corresponding path program 118 times [2019-08-05 10:36:54,031 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:54,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:54,066 INFO L256 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 163 conjunts are in the unsatisfiable core [2019-08-05 10:36:54,067 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:54,765 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:54,765 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:54,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-05 10:36:54,765 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-05 10:36:54,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-05 10:36:54,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:36:54,766 INFO L87 Difference]: Start difference. First operand 86 states and 87 transitions. Second operand 43 states. [2019-08-05 10:36:56,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:56,974 INFO L93 Difference]: Finished difference Result 130 states and 132 transitions. [2019-08-05 10:36:56,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-05 10:36:56,974 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 85 [2019-08-05 10:36:56,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:56,975 INFO L225 Difference]: With dead ends: 130 [2019-08-05 10:36:56,975 INFO L226 Difference]: Without dead ends: 128 [2019-08-05 10:36:56,976 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:36:56,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-08-05 10:36:56,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 88. [2019-08-05 10:36:56,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-08-05 10:36:56,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 90 transitions. [2019-08-05 10:36:56,978 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 90 transitions. Word has length 85 [2019-08-05 10:36:56,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:56,978 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 90 transitions. [2019-08-05 10:36:56,978 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-05 10:36:56,979 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 90 transitions. [2019-08-05 10:36:56,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-08-05 10:36:56,979 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:56,979 INFO L399 BasicCegarLoop]: trace histogram [41, 40, 1, 1, 1, 1, 1] [2019-08-05 10:36:56,979 INFO L418 AbstractCegarLoop]: === Iteration 122 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:56,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:56,980 INFO L82 PathProgramCache]: Analyzing trace with hash -1669878585, now seen corresponding path program 119 times [2019-08-05 10:36:56,980 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:57,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:57,010 INFO L256 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 163 conjunts are in the unsatisfiable core [2019-08-05 10:36:57,011 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:57,724 INFO L134 CoverageAnalysis]: Checked inductivity of 1681 backedges. 41 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:57,724 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:57,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-05 10:36:57,725 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-05 10:36:57,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-05 10:36:57,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:36:57,725 INFO L87 Difference]: Start difference. First operand 88 states and 90 transitions. Second operand 43 states. [2019-08-05 10:37:00,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:00,150 INFO L93 Difference]: Finished difference Result 128 states and 129 transitions. [2019-08-05 10:37:00,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-05 10:37:00,151 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 86 [2019-08-05 10:37:00,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:00,152 INFO L225 Difference]: With dead ends: 128 [2019-08-05 10:37:00,152 INFO L226 Difference]: Without dead ends: 87 [2019-08-05 10:37:00,152 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:37:00,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-08-05 10:37:00,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-08-05 10:37:00,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-08-05 10:37:00,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2019-08-05 10:37:00,154 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 86 [2019-08-05 10:37:00,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:00,155 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2019-08-05 10:37:00,155 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-05 10:37:00,155 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2019-08-05 10:37:00,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-08-05 10:37:00,155 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:00,155 INFO L399 BasicCegarLoop]: trace histogram [41, 40, 1, 1, 1, 1, 1] [2019-08-05 10:37:00,156 INFO L418 AbstractCegarLoop]: === Iteration 123 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:00,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:00,156 INFO L82 PathProgramCache]: Analyzing trace with hash 1752850541, now seen corresponding path program 120 times [2019-08-05 10:37:00,156 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:00,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:00,188 INFO L256 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 83 conjunts are in the unsatisfiable core [2019-08-05 10:37:00,189 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:00,867 INFO L134 CoverageAnalysis]: Checked inductivity of 1681 backedges. 861 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:37:00,868 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:00,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-05 10:37:00,868 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-05 10:37:00,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-05 10:37:00,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:37:00,869 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand 44 states. [2019-08-05 10:37:01,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:01,020 INFO L93 Difference]: Finished difference Result 88 states and 89 transitions. [2019-08-05 10:37:01,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-05 10:37:01,021 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 86 [2019-08-05 10:37:01,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:01,021 INFO L225 Difference]: With dead ends: 88 [2019-08-05 10:37:01,021 INFO L226 Difference]: Without dead ends: 88 [2019-08-05 10:37:01,022 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:37:01,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-08-05 10:37:01,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2019-08-05 10:37:01,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-08-05 10:37:01,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 89 transitions. [2019-08-05 10:37:01,023 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 89 transitions. Word has length 86 [2019-08-05 10:37:01,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:01,024 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 89 transitions. [2019-08-05 10:37:01,024 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-05 10:37:01,024 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 89 transitions. [2019-08-05 10:37:01,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-08-05 10:37:01,024 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:01,025 INFO L399 BasicCegarLoop]: trace histogram [41, 41, 1, 1, 1, 1, 1] [2019-08-05 10:37:01,025 INFO L418 AbstractCegarLoop]: === Iteration 124 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:01,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:01,025 INFO L82 PathProgramCache]: Analyzing trace with hash -1496269599, now seen corresponding path program 121 times [2019-08-05 10:37:01,026 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:01,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:01,056 INFO L256 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 167 conjunts are in the unsatisfiable core [2019-08-05 10:37:01,057 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:01,822 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:37:01,822 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:01,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-05 10:37:01,823 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-05 10:37:01,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-05 10:37:01,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:37:01,823 INFO L87 Difference]: Start difference. First operand 88 states and 89 transitions. Second operand 44 states. [2019-08-05 10:37:04,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:04,273 INFO L93 Difference]: Finished difference Result 133 states and 135 transitions. [2019-08-05 10:37:04,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-05 10:37:04,273 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 87 [2019-08-05 10:37:04,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:04,273 INFO L225 Difference]: With dead ends: 133 [2019-08-05 10:37:04,273 INFO L226 Difference]: Without dead ends: 131 [2019-08-05 10:37:04,274 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:37:04,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-08-05 10:37:04,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 90. [2019-08-05 10:37:04,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-08-05 10:37:04,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 92 transitions. [2019-08-05 10:37:04,275 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 92 transitions. Word has length 87 [2019-08-05 10:37:04,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:04,275 INFO L475 AbstractCegarLoop]: Abstraction has 90 states and 92 transitions. [2019-08-05 10:37:04,275 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-05 10:37:04,275 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 92 transitions. [2019-08-05 10:37:04,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-08-05 10:37:04,275 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:04,276 INFO L399 BasicCegarLoop]: trace histogram [42, 41, 1, 1, 1, 1, 1] [2019-08-05 10:37:04,276 INFO L418 AbstractCegarLoop]: === Iteration 125 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:04,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:04,276 INFO L82 PathProgramCache]: Analyzing trace with hash 860221165, now seen corresponding path program 122 times [2019-08-05 10:37:04,276 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:04,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:04,313 INFO L256 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 167 conjunts are in the unsatisfiable core [2019-08-05 10:37:04,314 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:05,099 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 42 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:37:05,099 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:05,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-05 10:37:05,100 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-05 10:37:05,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-05 10:37:05,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:37:05,100 INFO L87 Difference]: Start difference. First operand 90 states and 92 transitions. Second operand 44 states. [2019-08-05 10:37:07,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:07,782 INFO L93 Difference]: Finished difference Result 131 states and 132 transitions. [2019-08-05 10:37:07,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-05 10:37:07,782 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 88 [2019-08-05 10:37:07,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:07,783 INFO L225 Difference]: With dead ends: 131 [2019-08-05 10:37:07,783 INFO L226 Difference]: Without dead ends: 89 [2019-08-05 10:37:07,783 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:37:07,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-08-05 10:37:07,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-08-05 10:37:07,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-08-05 10:37:07,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 90 transitions. [2019-08-05 10:37:07,785 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 90 transitions. Word has length 88 [2019-08-05 10:37:07,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:07,785 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 90 transitions. [2019-08-05 10:37:07,786 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-05 10:37:07,786 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2019-08-05 10:37:07,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-08-05 10:37:07,786 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:07,787 INFO L399 BasicCegarLoop]: trace histogram [42, 41, 1, 1, 1, 1, 1] [2019-08-05 10:37:07,787 INFO L418 AbstractCegarLoop]: === Iteration 126 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:07,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:07,787 INFO L82 PathProgramCache]: Analyzing trace with hash -409358329, now seen corresponding path program 123 times [2019-08-05 10:37:07,788 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:07,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:07,806 INFO L256 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 85 conjunts are in the unsatisfiable core [2019-08-05 10:37:07,807 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:08,513 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 903 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:37:08,513 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:08,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-05 10:37:08,514 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-05 10:37:08,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-05 10:37:08,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:37:08,514 INFO L87 Difference]: Start difference. First operand 89 states and 90 transitions. Second operand 45 states. [2019-08-05 10:37:08,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:08,757 INFO L93 Difference]: Finished difference Result 90 states and 91 transitions. [2019-08-05 10:37:08,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-05 10:37:08,758 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 88 [2019-08-05 10:37:08,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:08,758 INFO L225 Difference]: With dead ends: 90 [2019-08-05 10:37:08,759 INFO L226 Difference]: Without dead ends: 90 [2019-08-05 10:37:08,759 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:37:08,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-08-05 10:37:08,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2019-08-05 10:37:08,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-08-05 10:37:08,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 91 transitions. [2019-08-05 10:37:08,761 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 91 transitions. Word has length 88 [2019-08-05 10:37:08,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:08,761 INFO L475 AbstractCegarLoop]: Abstraction has 90 states and 91 transitions. [2019-08-05 10:37:08,761 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-05 10:37:08,761 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 91 transitions. [2019-08-05 10:37:08,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-08-05 10:37:08,761 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:08,761 INFO L399 BasicCegarLoop]: trace histogram [42, 42, 1, 1, 1, 1, 1] [2019-08-05 10:37:08,762 INFO L418 AbstractCegarLoop]: === Iteration 127 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:08,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:08,762 INFO L82 PathProgramCache]: Analyzing trace with hash 194732167, now seen corresponding path program 124 times [2019-08-05 10:37:08,763 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:08,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:08,795 INFO L256 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 171 conjunts are in the unsatisfiable core [2019-08-05 10:37:08,796 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:09,801 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:37:09,801 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:09,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-05 10:37:09,802 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-05 10:37:09,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-05 10:37:09,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:37:09,802 INFO L87 Difference]: Start difference. First operand 90 states and 91 transitions. Second operand 45 states. [2019-08-05 10:37:12,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:12,217 INFO L93 Difference]: Finished difference Result 136 states and 138 transitions. [2019-08-05 10:37:12,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-05 10:37:12,217 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 89 [2019-08-05 10:37:12,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:12,218 INFO L225 Difference]: With dead ends: 136 [2019-08-05 10:37:12,218 INFO L226 Difference]: Without dead ends: 134 [2019-08-05 10:37:12,218 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:37:12,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-08-05 10:37:12,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 92. [2019-08-05 10:37:12,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-08-05 10:37:12,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 94 transitions. [2019-08-05 10:37:12,220 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 94 transitions. Word has length 89 [2019-08-05 10:37:12,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:12,221 INFO L475 AbstractCegarLoop]: Abstraction has 92 states and 94 transitions. [2019-08-05 10:37:12,221 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-05 10:37:12,221 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 94 transitions. [2019-08-05 10:37:12,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-08-05 10:37:12,221 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:12,221 INFO L399 BasicCegarLoop]: trace histogram [43, 42, 1, 1, 1, 1, 1] [2019-08-05 10:37:12,222 INFO L418 AbstractCegarLoop]: === Iteration 128 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:12,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:12,222 INFO L82 PathProgramCache]: Analyzing trace with hash 1741668359, now seen corresponding path program 125 times [2019-08-05 10:37:12,223 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:12,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:12,263 INFO L256 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 171 conjunts are in the unsatisfiable core [2019-08-05 10:37:12,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:12,998 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 43 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:37:12,998 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:12,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-05 10:37:12,998 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-05 10:37:12,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-05 10:37:12,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:37:12,999 INFO L87 Difference]: Start difference. First operand 92 states and 94 transitions. Second operand 45 states. [2019-08-05 10:37:15,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:15,613 INFO L93 Difference]: Finished difference Result 134 states and 135 transitions. [2019-08-05 10:37:15,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-05 10:37:15,614 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 90 [2019-08-05 10:37:15,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:15,615 INFO L225 Difference]: With dead ends: 134 [2019-08-05 10:37:15,615 INFO L226 Difference]: Without dead ends: 91 [2019-08-05 10:37:15,616 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:37:15,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-08-05 10:37:15,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-08-05 10:37:15,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-08-05 10:37:15,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 92 transitions. [2019-08-05 10:37:15,617 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 92 transitions. Word has length 90 [2019-08-05 10:37:15,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:15,618 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 92 transitions. [2019-08-05 10:37:15,618 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-05 10:37:15,618 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 92 transitions. [2019-08-05 10:37:15,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-08-05 10:37:15,618 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:15,619 INFO L399 BasicCegarLoop]: trace histogram [43, 42, 1, 1, 1, 1, 1] [2019-08-05 10:37:15,619 INFO L418 AbstractCegarLoop]: === Iteration 129 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:15,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:15,619 INFO L82 PathProgramCache]: Analyzing trace with hash 1039409709, now seen corresponding path program 126 times [2019-08-05 10:37:15,620 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:15,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:15,643 INFO L256 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 87 conjunts are in the unsatisfiable core [2019-08-05 10:37:15,643 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:16,446 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 946 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:37:16,446 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:16,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-05 10:37:16,447 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-05 10:37:16,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-05 10:37:16,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:37:16,447 INFO L87 Difference]: Start difference. First operand 91 states and 92 transitions. Second operand 46 states. [2019-08-05 10:37:16,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:16,620 INFO L93 Difference]: Finished difference Result 92 states and 93 transitions. [2019-08-05 10:37:16,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-05 10:37:16,620 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 90 [2019-08-05 10:37:16,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:16,621 INFO L225 Difference]: With dead ends: 92 [2019-08-05 10:37:16,621 INFO L226 Difference]: Without dead ends: 92 [2019-08-05 10:37:16,622 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:37:16,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-08-05 10:37:16,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2019-08-05 10:37:16,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-08-05 10:37:16,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 93 transitions. [2019-08-05 10:37:16,623 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 93 transitions. Word has length 90 [2019-08-05 10:37:16,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:16,624 INFO L475 AbstractCegarLoop]: Abstraction has 92 states and 93 transitions. [2019-08-05 10:37:16,624 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-05 10:37:16,624 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 93 transitions. [2019-08-05 10:37:16,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-08-05 10:37:16,625 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:16,625 INFO L399 BasicCegarLoop]: trace histogram [43, 43, 1, 1, 1, 1, 1] [2019-08-05 10:37:16,625 INFO L418 AbstractCegarLoop]: === Iteration 130 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:16,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:16,625 INFO L82 PathProgramCache]: Analyzing trace with hash -2138098911, now seen corresponding path program 127 times [2019-08-05 10:37:16,626 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:16,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:16,659 INFO L256 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 175 conjunts are in the unsatisfiable core [2019-08-05 10:37:16,660 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:17,436 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:37:17,436 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:17,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-05 10:37:17,437 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-05 10:37:17,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-05 10:37:17,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:37:17,437 INFO L87 Difference]: Start difference. First operand 92 states and 93 transitions. Second operand 46 states. [2019-08-05 10:37:20,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:20,244 INFO L93 Difference]: Finished difference Result 139 states and 141 transitions. [2019-08-05 10:37:20,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-05 10:37:20,245 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 91 [2019-08-05 10:37:20,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:20,245 INFO L225 Difference]: With dead ends: 139 [2019-08-05 10:37:20,245 INFO L226 Difference]: Without dead ends: 137 [2019-08-05 10:37:20,246 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:37:20,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-08-05 10:37:20,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 94. [2019-08-05 10:37:20,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-08-05 10:37:20,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 96 transitions. [2019-08-05 10:37:20,248 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 96 transitions. Word has length 91 [2019-08-05 10:37:20,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:20,248 INFO L475 AbstractCegarLoop]: Abstraction has 94 states and 96 transitions. [2019-08-05 10:37:20,248 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-05 10:37:20,248 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 96 transitions. [2019-08-05 10:37:20,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-08-05 10:37:20,249 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:20,249 INFO L399 BasicCegarLoop]: trace histogram [44, 43, 1, 1, 1, 1, 1] [2019-08-05 10:37:20,249 INFO L418 AbstractCegarLoop]: === Iteration 131 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:20,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:20,249 INFO L82 PathProgramCache]: Analyzing trace with hash -1856618323, now seen corresponding path program 128 times [2019-08-05 10:37:20,250 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:20,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:20,291 INFO L256 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 175 conjunts are in the unsatisfiable core [2019-08-05 10:37:20,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:21,057 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 44 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:37:21,057 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:21,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-05 10:37:21,057 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-05 10:37:21,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-05 10:37:21,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:37:21,058 INFO L87 Difference]: Start difference. First operand 94 states and 96 transitions. Second operand 46 states. [2019-08-05 10:37:23,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:23,586 INFO L93 Difference]: Finished difference Result 137 states and 138 transitions. [2019-08-05 10:37:23,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-05 10:37:23,586 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 92 [2019-08-05 10:37:23,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:23,587 INFO L225 Difference]: With dead ends: 137 [2019-08-05 10:37:23,587 INFO L226 Difference]: Without dead ends: 93 [2019-08-05 10:37:23,587 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:37:23,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-08-05 10:37:23,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2019-08-05 10:37:23,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-08-05 10:37:23,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 94 transitions. [2019-08-05 10:37:23,589 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 94 transitions. Word has length 92 [2019-08-05 10:37:23,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:23,590 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 94 transitions. [2019-08-05 10:37:23,590 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-05 10:37:23,590 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2019-08-05 10:37:23,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-08-05 10:37:23,590 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:23,590 INFO L399 BasicCegarLoop]: trace histogram [44, 43, 1, 1, 1, 1, 1] [2019-08-05 10:37:23,591 INFO L418 AbstractCegarLoop]: === Iteration 132 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:23,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:23,591 INFO L82 PathProgramCache]: Analyzing trace with hash 2143167303, now seen corresponding path program 129 times [2019-08-05 10:37:23,591 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:23,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:23,613 INFO L256 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 89 conjunts are in the unsatisfiable core [2019-08-05 10:37:23,614 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:24,355 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 990 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:37:24,356 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:24,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-05 10:37:24,356 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-05 10:37:24,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-05 10:37:24,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:37:24,356 INFO L87 Difference]: Start difference. First operand 93 states and 94 transitions. Second operand 47 states. [2019-08-05 10:37:24,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:24,574 INFO L93 Difference]: Finished difference Result 94 states and 95 transitions. [2019-08-05 10:37:24,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-05 10:37:24,574 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 92 [2019-08-05 10:37:24,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:24,574 INFO L225 Difference]: With dead ends: 94 [2019-08-05 10:37:24,574 INFO L226 Difference]: Without dead ends: 94 [2019-08-05 10:37:24,575 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:37:24,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-08-05 10:37:24,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2019-08-05 10:37:24,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-08-05 10:37:24,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 95 transitions. [2019-08-05 10:37:24,577 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 95 transitions. Word has length 92 [2019-08-05 10:37:24,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:24,577 INFO L475 AbstractCegarLoop]: Abstraction has 94 states and 95 transitions. [2019-08-05 10:37:24,577 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-05 10:37:24,578 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 95 transitions. [2019-08-05 10:37:24,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 10:37:24,578 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:24,578 INFO L399 BasicCegarLoop]: trace histogram [44, 44, 1, 1, 1, 1, 1] [2019-08-05 10:37:24,578 INFO L418 AbstractCegarLoop]: === Iteration 133 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:24,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:24,579 INFO L82 PathProgramCache]: Analyzing trace with hash 2013615431, now seen corresponding path program 130 times [2019-08-05 10:37:24,579 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:24,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:24,621 INFO L256 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 179 conjunts are in the unsatisfiable core [2019-08-05 10:37:24,622 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:25,489 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:37:25,489 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:25,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-05 10:37:25,490 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-05 10:37:25,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-05 10:37:25,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:37:25,490 INFO L87 Difference]: Start difference. First operand 94 states and 95 transitions. Second operand 47 states. [2019-08-05 10:37:28,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:28,133 INFO L93 Difference]: Finished difference Result 142 states and 144 transitions. [2019-08-05 10:37:28,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-05 10:37:28,133 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 93 [2019-08-05 10:37:28,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:28,134 INFO L225 Difference]: With dead ends: 142 [2019-08-05 10:37:28,134 INFO L226 Difference]: Without dead ends: 140 [2019-08-05 10:37:28,134 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:37:28,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-08-05 10:37:28,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 96. [2019-08-05 10:37:28,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-08-05 10:37:28,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 98 transitions. [2019-08-05 10:37:28,136 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 98 transitions. Word has length 93 [2019-08-05 10:37:28,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:28,136 INFO L475 AbstractCegarLoop]: Abstraction has 96 states and 98 transitions. [2019-08-05 10:37:28,136 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-05 10:37:28,137 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 98 transitions. [2019-08-05 10:37:28,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-08-05 10:37:28,137 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:28,137 INFO L399 BasicCegarLoop]: trace histogram [45, 44, 1, 1, 1, 1, 1] [2019-08-05 10:37:28,138 INFO L418 AbstractCegarLoop]: === Iteration 134 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:28,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:28,138 INFO L82 PathProgramCache]: Analyzing trace with hash -2002492601, now seen corresponding path program 131 times [2019-08-05 10:37:28,138 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:28,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:28,183 INFO L256 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 179 conjunts are in the unsatisfiable core [2019-08-05 10:37:28,184 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:28,988 INFO L134 CoverageAnalysis]: Checked inductivity of 2025 backedges. 45 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:37:28,988 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:28,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-05 10:37:28,988 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-05 10:37:28,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-05 10:37:28,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:37:28,989 INFO L87 Difference]: Start difference. First operand 96 states and 98 transitions. Second operand 47 states. [2019-08-05 10:37:31,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:31,769 INFO L93 Difference]: Finished difference Result 140 states and 141 transitions. [2019-08-05 10:37:31,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-05 10:37:31,770 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 94 [2019-08-05 10:37:31,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:31,770 INFO L225 Difference]: With dead ends: 140 [2019-08-05 10:37:31,770 INFO L226 Difference]: Without dead ends: 95 [2019-08-05 10:37:31,771 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:37:31,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-08-05 10:37:31,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2019-08-05 10:37:31,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-08-05 10:37:31,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 96 transitions. [2019-08-05 10:37:31,772 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 96 transitions. Word has length 94 [2019-08-05 10:37:31,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:31,773 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 96 transitions. [2019-08-05 10:37:31,773 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-05 10:37:31,773 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 96 transitions. [2019-08-05 10:37:31,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-08-05 10:37:31,773 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:31,774 INFO L399 BasicCegarLoop]: trace histogram [45, 44, 1, 1, 1, 1, 1] [2019-08-05 10:37:31,774 INFO L418 AbstractCegarLoop]: === Iteration 135 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:31,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:31,774 INFO L82 PathProgramCache]: Analyzing trace with hash 1731777517, now seen corresponding path program 132 times [2019-08-05 10:37:31,775 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:31,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:31,796 INFO L256 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 91 conjunts are in the unsatisfiable core [2019-08-05 10:37:31,797 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:32,591 INFO L134 CoverageAnalysis]: Checked inductivity of 2025 backedges. 1035 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:37:32,592 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:32,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-05 10:37:32,592 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-05 10:37:32,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-05 10:37:32,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:37:32,593 INFO L87 Difference]: Start difference. First operand 95 states and 96 transitions. Second operand 48 states. [2019-08-05 10:37:32,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:32,764 INFO L93 Difference]: Finished difference Result 96 states and 97 transitions. [2019-08-05 10:37:32,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-05 10:37:32,764 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 94 [2019-08-05 10:37:32,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:32,765 INFO L225 Difference]: With dead ends: 96 [2019-08-05 10:37:32,765 INFO L226 Difference]: Without dead ends: 96 [2019-08-05 10:37:32,765 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:37:32,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-08-05 10:37:32,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2019-08-05 10:37:32,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-08-05 10:37:32,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 97 transitions. [2019-08-05 10:37:32,767 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 97 transitions. Word has length 94 [2019-08-05 10:37:32,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:32,767 INFO L475 AbstractCegarLoop]: Abstraction has 96 states and 97 transitions. [2019-08-05 10:37:32,767 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-05 10:37:32,768 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 97 transitions. [2019-08-05 10:37:32,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-08-05 10:37:32,768 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:32,768 INFO L399 BasicCegarLoop]: trace histogram [45, 45, 1, 1, 1, 1, 1] [2019-08-05 10:37:32,768 INFO L418 AbstractCegarLoop]: === Iteration 136 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:32,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:32,768 INFO L82 PathProgramCache]: Analyzing trace with hash 2145433953, now seen corresponding path program 133 times [2019-08-05 10:37:32,769 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:32,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:32,809 INFO L256 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 183 conjunts are in the unsatisfiable core [2019-08-05 10:37:32,810 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:33,691 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:37:33,692 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:33,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-05 10:37:33,692 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-05 10:37:33,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-05 10:37:33,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:37:33,692 INFO L87 Difference]: Start difference. First operand 96 states and 97 transitions. Second operand 48 states. [2019-08-05 10:37:36,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:36,640 INFO L93 Difference]: Finished difference Result 145 states and 147 transitions. [2019-08-05 10:37:36,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-05 10:37:36,640 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 95 [2019-08-05 10:37:36,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:36,641 INFO L225 Difference]: With dead ends: 145 [2019-08-05 10:37:36,641 INFO L226 Difference]: Without dead ends: 143 [2019-08-05 10:37:36,641 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:37:36,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-08-05 10:37:36,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 98. [2019-08-05 10:37:36,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-08-05 10:37:36,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 100 transitions. [2019-08-05 10:37:36,643 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 100 transitions. Word has length 95 [2019-08-05 10:37:36,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:36,643 INFO L475 AbstractCegarLoop]: Abstraction has 98 states and 100 transitions. [2019-08-05 10:37:36,644 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-05 10:37:36,644 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 100 transitions. [2019-08-05 10:37:36,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-08-05 10:37:36,644 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:36,644 INFO L399 BasicCegarLoop]: trace histogram [46, 45, 1, 1, 1, 1, 1] [2019-08-05 10:37:36,644 INFO L418 AbstractCegarLoop]: === Iteration 137 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:36,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:36,645 INFO L82 PathProgramCache]: Analyzing trace with hash 2083881581, now seen corresponding path program 134 times [2019-08-05 10:37:36,645 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:36,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:36,711 INFO L256 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 183 conjunts are in the unsatisfiable core [2019-08-05 10:37:36,713 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:37,599 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 46 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:37:37,599 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:37,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-05 10:37:37,600 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-05 10:37:37,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-05 10:37:37,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:37:37,600 INFO L87 Difference]: Start difference. First operand 98 states and 100 transitions. Second operand 48 states. [2019-08-05 10:37:40,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:40,559 INFO L93 Difference]: Finished difference Result 143 states and 144 transitions. [2019-08-05 10:37:40,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-05 10:37:40,560 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 96 [2019-08-05 10:37:40,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:40,560 INFO L225 Difference]: With dead ends: 143 [2019-08-05 10:37:40,560 INFO L226 Difference]: Without dead ends: 97 [2019-08-05 10:37:40,561 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:37:40,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-08-05 10:37:40,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2019-08-05 10:37:40,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-08-05 10:37:40,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2019-08-05 10:37:40,563 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 96 [2019-08-05 10:37:40,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:40,564 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2019-08-05 10:37:40,564 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-05 10:37:40,564 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2019-08-05 10:37:40,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-08-05 10:37:40,564 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:40,564 INFO L399 BasicCegarLoop]: trace histogram [46, 45, 1, 1, 1, 1, 1] [2019-08-05 10:37:40,564 INFO L418 AbstractCegarLoop]: === Iteration 138 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:40,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:40,565 INFO L82 PathProgramCache]: Analyzing trace with hash 1882138247, now seen corresponding path program 135 times [2019-08-05 10:37:40,565 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:40,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:40,588 INFO L256 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 93 conjunts are in the unsatisfiable core [2019-08-05 10:37:40,589 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:41,478 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 1081 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:37:41,479 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:41,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-08-05 10:37:41,479 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-05 10:37:41,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-05 10:37:41,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:37:41,480 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand 49 states. [2019-08-05 10:37:41,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:41,657 INFO L93 Difference]: Finished difference Result 98 states and 99 transitions. [2019-08-05 10:37:41,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-08-05 10:37:41,658 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 96 [2019-08-05 10:37:41,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:41,658 INFO L225 Difference]: With dead ends: 98 [2019-08-05 10:37:41,658 INFO L226 Difference]: Without dead ends: 98 [2019-08-05 10:37:41,659 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:37:41,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-08-05 10:37:41,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2019-08-05 10:37:41,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-08-05 10:37:41,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 99 transitions. [2019-08-05 10:37:41,661 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 99 transitions. Word has length 96 [2019-08-05 10:37:41,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:41,661 INFO L475 AbstractCegarLoop]: Abstraction has 98 states and 99 transitions. [2019-08-05 10:37:41,661 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-05 10:37:41,661 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 99 transitions. [2019-08-05 10:37:41,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-08-05 10:37:41,662 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:41,662 INFO L399 BasicCegarLoop]: trace histogram [46, 46, 1, 1, 1, 1, 1] [2019-08-05 10:37:41,662 INFO L418 AbstractCegarLoop]: === Iteration 139 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:41,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:41,662 INFO L82 PathProgramCache]: Analyzing trace with hash -1783318009, now seen corresponding path program 136 times [2019-08-05 10:37:41,663 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:41,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:41,701 INFO L256 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 187 conjunts are in the unsatisfiable core [2019-08-05 10:37:41,702 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:42,551 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:37:42,551 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:42,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-05 10:37:42,552 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-05 10:37:42,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-05 10:37:42,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:37:42,552 INFO L87 Difference]: Start difference. First operand 98 states and 99 transitions. Second operand 49 states. [2019-08-05 10:37:45,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:45,629 INFO L93 Difference]: Finished difference Result 148 states and 150 transitions. [2019-08-05 10:37:45,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-08-05 10:37:45,629 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 97 [2019-08-05 10:37:45,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:45,630 INFO L225 Difference]: With dead ends: 148 [2019-08-05 10:37:45,630 INFO L226 Difference]: Without dead ends: 146 [2019-08-05 10:37:45,631 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:37:45,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-08-05 10:37:45,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 100. [2019-08-05 10:37:45,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-08-05 10:37:45,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 102 transitions. [2019-08-05 10:37:45,632 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 102 transitions. Word has length 97 [2019-08-05 10:37:45,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:45,633 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 102 transitions. [2019-08-05 10:37:45,633 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-05 10:37:45,633 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 102 transitions. [2019-08-05 10:37:45,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-08-05 10:37:45,634 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:45,634 INFO L399 BasicCegarLoop]: trace histogram [47, 46, 1, 1, 1, 1, 1] [2019-08-05 10:37:45,634 INFO L418 AbstractCegarLoop]: === Iteration 140 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:45,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:45,634 INFO L82 PathProgramCache]: Analyzing trace with hash 551655047, now seen corresponding path program 137 times [2019-08-05 10:37:45,635 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:45,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:45,676 INFO L256 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 187 conjunts are in the unsatisfiable core [2019-08-05 10:37:45,677 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:46,573 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 47 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:37:46,573 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:46,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-08-05 10:37:46,574 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-05 10:37:46,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-05 10:37:46,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:37:46,574 INFO L87 Difference]: Start difference. First operand 100 states and 102 transitions. Second operand 49 states. [2019-08-05 10:37:49,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:49,462 INFO L93 Difference]: Finished difference Result 146 states and 147 transitions. [2019-08-05 10:37:49,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-08-05 10:37:49,462 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 98 [2019-08-05 10:37:49,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:49,463 INFO L225 Difference]: With dead ends: 146 [2019-08-05 10:37:49,463 INFO L226 Difference]: Without dead ends: 99 [2019-08-05 10:37:49,463 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:37:49,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-08-05 10:37:49,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2019-08-05 10:37:49,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-08-05 10:37:49,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2019-08-05 10:37:49,465 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 98 [2019-08-05 10:37:49,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:49,465 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2019-08-05 10:37:49,465 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-05 10:37:49,466 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2019-08-05 10:37:49,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-08-05 10:37:49,466 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:49,466 INFO L399 BasicCegarLoop]: trace histogram [47, 46, 1, 1, 1, 1, 1] [2019-08-05 10:37:49,466 INFO L418 AbstractCegarLoop]: === Iteration 141 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:49,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:49,466 INFO L82 PathProgramCache]: Analyzing trace with hash -1407421011, now seen corresponding path program 138 times [2019-08-05 10:37:49,467 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:49,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:49,490 INFO L256 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 95 conjunts are in the unsatisfiable core [2019-08-05 10:37:49,492 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:50,653 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 1128 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:37:50,654 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:50,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-05 10:37:50,654 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-05 10:37:50,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-05 10:37:50,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:37:50,655 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand 50 states. [2019-08-05 10:37:50,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:50,851 INFO L93 Difference]: Finished difference Result 100 states and 101 transitions. [2019-08-05 10:37:50,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-05 10:37:50,851 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 98 [2019-08-05 10:37:50,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:50,852 INFO L225 Difference]: With dead ends: 100 [2019-08-05 10:37:50,852 INFO L226 Difference]: Without dead ends: 100 [2019-08-05 10:37:50,852 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:37:50,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-08-05 10:37:50,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-08-05 10:37:50,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-08-05 10:37:50,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 101 transitions. [2019-08-05 10:37:50,854 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 101 transitions. Word has length 98 [2019-08-05 10:37:50,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:50,854 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 101 transitions. [2019-08-05 10:37:50,854 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-05 10:37:50,855 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 101 transitions. [2019-08-05 10:37:50,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-08-05 10:37:50,855 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:50,855 INFO L399 BasicCegarLoop]: trace histogram [47, 47, 1, 1, 1, 1, 1] [2019-08-05 10:37:50,855 INFO L418 AbstractCegarLoop]: === Iteration 142 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:50,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:50,856 INFO L82 PathProgramCache]: Analyzing trace with hash -680439903, now seen corresponding path program 139 times [2019-08-05 10:37:50,856 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:50,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:50,913 INFO L256 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 191 conjunts are in the unsatisfiable core [2019-08-05 10:37:50,914 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:51,847 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:37:51,848 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:51,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-08-05 10:37:51,848 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-05 10:37:51,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-05 10:37:51,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:37:51,849 INFO L87 Difference]: Start difference. First operand 100 states and 101 transitions. Second operand 50 states. [2019-08-05 10:37:54,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:54,874 INFO L93 Difference]: Finished difference Result 151 states and 153 transitions. [2019-08-05 10:37:54,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-05 10:37:54,875 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 99 [2019-08-05 10:37:54,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:54,875 INFO L225 Difference]: With dead ends: 151 [2019-08-05 10:37:54,876 INFO L226 Difference]: Without dead ends: 149 [2019-08-05 10:37:54,876 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:37:54,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-08-05 10:37:54,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 102. [2019-08-05 10:37:54,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-08-05 10:37:54,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 104 transitions. [2019-08-05 10:37:54,878 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 104 transitions. Word has length 99 [2019-08-05 10:37:54,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:54,879 INFO L475 AbstractCegarLoop]: Abstraction has 102 states and 104 transitions. [2019-08-05 10:37:54,879 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-05 10:37:54,879 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 104 transitions. [2019-08-05 10:37:54,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-08-05 10:37:54,879 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:54,879 INFO L399 BasicCegarLoop]: trace histogram [48, 47, 1, 1, 1, 1, 1] [2019-08-05 10:37:54,879 INFO L418 AbstractCegarLoop]: === Iteration 143 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:54,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:54,880 INFO L82 PathProgramCache]: Analyzing trace with hash 381137965, now seen corresponding path program 140 times [2019-08-05 10:37:54,880 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:54,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:54,927 INFO L256 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 191 conjunts are in the unsatisfiable core [2019-08-05 10:37:54,929 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:56,310 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 48 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:37:56,311 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:56,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-05 10:37:56,311 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-05 10:37:56,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-05 10:37:56,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:37:56,311 INFO L87 Difference]: Start difference. First operand 102 states and 104 transitions. Second operand 50 states. [2019-08-05 10:37:59,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:59,316 INFO L93 Difference]: Finished difference Result 149 states and 150 transitions. [2019-08-05 10:37:59,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-05 10:37:59,317 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 100 [2019-08-05 10:37:59,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:59,317 INFO L225 Difference]: With dead ends: 149 [2019-08-05 10:37:59,317 INFO L226 Difference]: Without dead ends: 101 [2019-08-05 10:37:59,318 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:37:59,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-08-05 10:37:59,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2019-08-05 10:37:59,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-08-05 10:37:59,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 102 transitions. [2019-08-05 10:37:59,320 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 102 transitions. Word has length 100 [2019-08-05 10:37:59,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:59,320 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 102 transitions. [2019-08-05 10:37:59,321 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-05 10:37:59,321 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 102 transitions. [2019-08-05 10:37:59,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-08-05 10:37:59,321 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:59,321 INFO L399 BasicCegarLoop]: trace histogram [48, 47, 1, 1, 1, 1, 1] [2019-08-05 10:37:59,321 INFO L418 AbstractCegarLoop]: === Iteration 144 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:59,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:59,322 INFO L82 PathProgramCache]: Analyzing trace with hash -220677689, now seen corresponding path program 141 times [2019-08-05 10:37:59,322 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:59,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:59,359 INFO L256 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 97 conjunts are in the unsatisfiable core [2019-08-05 10:37:59,361 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:00,285 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 1176 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:38:00,285 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:00,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-08-05 10:38:00,286 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-05 10:38:00,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-05 10:38:00,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:38:00,286 INFO L87 Difference]: Start difference. First operand 101 states and 102 transitions. Second operand 51 states. [2019-08-05 10:38:00,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:00,556 INFO L93 Difference]: Finished difference Result 102 states and 103 transitions. [2019-08-05 10:38:00,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-05 10:38:00,557 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 100 [2019-08-05 10:38:00,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:00,557 INFO L225 Difference]: With dead ends: 102 [2019-08-05 10:38:00,557 INFO L226 Difference]: Without dead ends: 102 [2019-08-05 10:38:00,557 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:38:00,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-08-05 10:38:00,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2019-08-05 10:38:00,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-08-05 10:38:00,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 103 transitions. [2019-08-05 10:38:00,559 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 103 transitions. Word has length 100 [2019-08-05 10:38:00,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:00,559 INFO L475 AbstractCegarLoop]: Abstraction has 102 states and 103 transitions. [2019-08-05 10:38:00,559 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-08-05 10:38:00,559 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 103 transitions. [2019-08-05 10:38:00,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 10:38:00,560 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:00,560 INFO L399 BasicCegarLoop]: trace histogram [48, 48, 1, 1, 1, 1, 1] [2019-08-05 10:38:00,560 INFO L418 AbstractCegarLoop]: === Iteration 145 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:38:00,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:00,560 INFO L82 PathProgramCache]: Analyzing trace with hash 1748864711, now seen corresponding path program 142 times [2019-08-05 10:38:00,561 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:00,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:00,601 INFO L256 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 195 conjunts are in the unsatisfiable core [2019-08-05 10:38:00,602 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:01,617 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:38:01,618 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:01,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-05 10:38:01,618 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-05 10:38:01,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-05 10:38:01,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:38:01,619 INFO L87 Difference]: Start difference. First operand 102 states and 103 transitions. Second operand 51 states. [2019-08-05 10:38:04,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:04,763 INFO L93 Difference]: Finished difference Result 154 states and 156 transitions. [2019-08-05 10:38:04,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-05 10:38:04,764 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 101 [2019-08-05 10:38:04,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:04,764 INFO L225 Difference]: With dead ends: 154 [2019-08-05 10:38:04,764 INFO L226 Difference]: Without dead ends: 152 [2019-08-05 10:38:04,765 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:38:04,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-08-05 10:38:04,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 104. [2019-08-05 10:38:04,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-08-05 10:38:04,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 106 transitions. [2019-08-05 10:38:04,767 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 106 transitions. Word has length 101 [2019-08-05 10:38:04,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:04,767 INFO L475 AbstractCegarLoop]: Abstraction has 104 states and 106 transitions. [2019-08-05 10:38:04,767 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-08-05 10:38:04,767 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 106 transitions. [2019-08-05 10:38:04,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-08-05 10:38:04,768 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:04,768 INFO L399 BasicCegarLoop]: trace histogram [49, 48, 1, 1, 1, 1, 1] [2019-08-05 10:38:04,768 INFO L418 AbstractCegarLoop]: === Iteration 146 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:38:04,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:04,768 INFO L82 PathProgramCache]: Analyzing trace with hash -1619830329, now seen corresponding path program 143 times [2019-08-05 10:38:04,769 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:04,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:04,818 INFO L256 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 195 conjunts are in the unsatisfiable core [2019-08-05 10:38:04,819 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:06,012 INFO L134 CoverageAnalysis]: Checked inductivity of 2401 backedges. 49 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:38:06,012 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:06,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-08-05 10:38:06,013 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-05 10:38:06,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-05 10:38:06,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:38:06,013 INFO L87 Difference]: Start difference. First operand 104 states and 106 transitions. Second operand 51 states. [2019-08-05 10:38:09,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:09,139 INFO L93 Difference]: Finished difference Result 152 states and 153 transitions. [2019-08-05 10:38:09,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-05 10:38:09,139 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 102 [2019-08-05 10:38:09,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:09,140 INFO L225 Difference]: With dead ends: 152 [2019-08-05 10:38:09,140 INFO L226 Difference]: Without dead ends: 103 [2019-08-05 10:38:09,140 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:38:09,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-08-05 10:38:09,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2019-08-05 10:38:09,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-08-05 10:38:09,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 104 transitions. [2019-08-05 10:38:09,142 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 104 transitions. Word has length 102 [2019-08-05 10:38:09,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:09,142 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 104 transitions. [2019-08-05 10:38:09,142 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-08-05 10:38:09,143 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 104 transitions. [2019-08-05 10:38:09,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-08-05 10:38:09,143 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:09,143 INFO L399 BasicCegarLoop]: trace histogram [49, 48, 1, 1, 1, 1, 1] [2019-08-05 10:38:09,143 INFO L418 AbstractCegarLoop]: === Iteration 147 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:38:09,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:09,144 INFO L82 PathProgramCache]: Analyzing trace with hash 1198720877, now seen corresponding path program 144 times [2019-08-05 10:38:09,144 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:09,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:09,181 INFO L256 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 99 conjunts are in the unsatisfiable core [2019-08-05 10:38:09,182 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:10,277 INFO L134 CoverageAnalysis]: Checked inductivity of 2401 backedges. 1225 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:38:10,278 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:10,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-05 10:38:10,278 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-05 10:38:10,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-05 10:38:10,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:38:10,279 INFO L87 Difference]: Start difference. First operand 103 states and 104 transitions. Second operand 52 states. [2019-08-05 10:38:10,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:10,666 INFO L93 Difference]: Finished difference Result 104 states and 105 transitions. [2019-08-05 10:38:10,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-05 10:38:10,667 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 102 [2019-08-05 10:38:10,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:10,667 INFO L225 Difference]: With dead ends: 104 [2019-08-05 10:38:10,667 INFO L226 Difference]: Without dead ends: 104 [2019-08-05 10:38:10,668 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:38:10,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-08-05 10:38:10,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-08-05 10:38:10,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-08-05 10:38:10,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 105 transitions. [2019-08-05 10:38:10,670 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 105 transitions. Word has length 102 [2019-08-05 10:38:10,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:10,670 INFO L475 AbstractCegarLoop]: Abstraction has 104 states and 105 transitions. [2019-08-05 10:38:10,670 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-05 10:38:10,670 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 105 transitions. [2019-08-05 10:38:10,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-08-05 10:38:10,671 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:10,671 INFO L399 BasicCegarLoop]: trace histogram [49, 49, 1, 1, 1, 1, 1] [2019-08-05 10:38:10,671 INFO L418 AbstractCegarLoop]: === Iteration 148 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:38:10,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:10,671 INFO L82 PathProgramCache]: Analyzing trace with hash -1494419999, now seen corresponding path program 145 times [2019-08-05 10:38:10,671 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:10,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:10,715 INFO L256 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 199 conjunts are in the unsatisfiable core [2019-08-05 10:38:10,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:11,692 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:38:11,692 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:11,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-08-05 10:38:11,692 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-05 10:38:11,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-05 10:38:11,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:38:11,693 INFO L87 Difference]: Start difference. First operand 104 states and 105 transitions. Second operand 52 states. [2019-08-05 10:38:14,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:14,973 INFO L93 Difference]: Finished difference Result 157 states and 159 transitions. [2019-08-05 10:38:14,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-05 10:38:14,974 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 103 [2019-08-05 10:38:14,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:14,975 INFO L225 Difference]: With dead ends: 157 [2019-08-05 10:38:14,975 INFO L226 Difference]: Without dead ends: 155 [2019-08-05 10:38:14,975 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:38:14,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-08-05 10:38:14,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 106. [2019-08-05 10:38:14,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-08-05 10:38:14,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 108 transitions. [2019-08-05 10:38:14,977 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 108 transitions. Word has length 103 [2019-08-05 10:38:14,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:14,977 INFO L475 AbstractCegarLoop]: Abstraction has 106 states and 108 transitions. [2019-08-05 10:38:14,977 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-05 10:38:14,978 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 108 transitions. [2019-08-05 10:38:14,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-08-05 10:38:14,978 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:14,978 INFO L399 BasicCegarLoop]: trace histogram [50, 49, 1, 1, 1, 1, 1] [2019-08-05 10:38:14,978 INFO L418 AbstractCegarLoop]: === Iteration 149 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:38:14,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:14,979 INFO L82 PathProgramCache]: Analyzing trace with hash 917558765, now seen corresponding path program 146 times [2019-08-05 10:38:14,979 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:15,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:15,025 INFO L256 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 199 conjunts are in the unsatisfiable core [2019-08-05 10:38:15,026 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:16,252 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 50 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:38:16,253 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:16,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-05 10:38:16,253 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-05 10:38:16,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-05 10:38:16,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:38:16,254 INFO L87 Difference]: Start difference. First operand 106 states and 108 transitions. Second operand 52 states. [2019-08-05 10:38:19,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:19,511 INFO L93 Difference]: Finished difference Result 155 states and 156 transitions. [2019-08-05 10:38:19,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-05 10:38:19,511 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 104 [2019-08-05 10:38:19,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:19,512 INFO L225 Difference]: With dead ends: 155 [2019-08-05 10:38:19,512 INFO L226 Difference]: Without dead ends: 105 [2019-08-05 10:38:19,512 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:38:19,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-08-05 10:38:19,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2019-08-05 10:38:19,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-08-05 10:38:19,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 106 transitions. [2019-08-05 10:38:19,514 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 106 transitions. Word has length 104 [2019-08-05 10:38:19,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:19,514 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 106 transitions. [2019-08-05 10:38:19,515 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-05 10:38:19,515 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 106 transitions. [2019-08-05 10:38:19,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-08-05 10:38:19,515 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:19,515 INFO L399 BasicCegarLoop]: trace histogram [50, 49, 1, 1, 1, 1, 1] [2019-08-05 10:38:19,516 INFO L418 AbstractCegarLoop]: === Iteration 150 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:38:19,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:19,516 INFO L82 PathProgramCache]: Analyzing trace with hash -1901667065, now seen corresponding path program 147 times [2019-08-05 10:38:19,517 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:19,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:19,548 INFO L256 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 101 conjunts are in the unsatisfiable core [2019-08-05 10:38:19,548 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:20,558 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 1275 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:38:20,559 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:20,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-08-05 10:38:20,559 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-08-05 10:38:20,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-08-05 10:38:20,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:38:20,560 INFO L87 Difference]: Start difference. First operand 105 states and 106 transitions. Second operand 53 states. [2019-08-05 10:38:20,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:20,740 INFO L93 Difference]: Finished difference Result 106 states and 107 transitions. [2019-08-05 10:38:20,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-08-05 10:38:20,741 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 104 [2019-08-05 10:38:20,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:20,742 INFO L225 Difference]: With dead ends: 106 [2019-08-05 10:38:20,742 INFO L226 Difference]: Without dead ends: 106 [2019-08-05 10:38:20,742 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 52 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-05 10:38:20,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-08-05 10:38:20,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2019-08-05 10:38:20,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-08-05 10:38:20,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 107 transitions. [2019-08-05 10:38:20,744 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 107 transitions. Word has length 104 [2019-08-05 10:38:20,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:20,744 INFO L475 AbstractCegarLoop]: Abstraction has 106 states and 107 transitions. [2019-08-05 10:38:20,744 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-08-05 10:38:20,744 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 107 transitions. [2019-08-05 10:38:20,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-08-05 10:38:20,745 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:20,745 INFO L399 BasicCegarLoop]: trace histogram [50, 50, 1, 1, 1, 1, 1] [2019-08-05 10:38:20,745 INFO L418 AbstractCegarLoop]: === Iteration 151 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:38:20,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:20,746 INFO L82 PathProgramCache]: Analyzing trace with hash 1177801607, now seen corresponding path program 148 times [2019-08-05 10:38:20,746 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:20,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:20,799 INFO L256 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 203 conjunts are in the unsatisfiable core [2019-08-05 10:38:20,800 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:22,067 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:38:22,068 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:22,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-05 10:38:22,068 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-08-05 10:38:22,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-08-05 10:38:22,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:38:22,068 INFO L87 Difference]: Start difference. First operand 106 states and 107 transitions. Second operand 53 states. [2019-08-05 10:38:25,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:25,469 INFO L93 Difference]: Finished difference Result 160 states and 162 transitions. [2019-08-05 10:38:25,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-08-05 10:38:25,470 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 105 [2019-08-05 10:38:25,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:25,470 INFO L225 Difference]: With dead ends: 160 [2019-08-05 10:38:25,470 INFO L226 Difference]: Without dead ends: 158 [2019-08-05 10:38:25,471 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:38:25,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-08-05 10:38:25,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 108. [2019-08-05 10:38:25,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-08-05 10:38:25,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 110 transitions. [2019-08-05 10:38:25,472 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 110 transitions. Word has length 105 [2019-08-05 10:38:25,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:25,472 INFO L475 AbstractCegarLoop]: Abstraction has 108 states and 110 transitions. [2019-08-05 10:38:25,473 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-08-05 10:38:25,473 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 110 transitions. [2019-08-05 10:38:25,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-08-05 10:38:25,473 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:25,473 INFO L399 BasicCegarLoop]: trace histogram [51, 50, 1, 1, 1, 1, 1] [2019-08-05 10:38:25,473 INFO L418 AbstractCegarLoop]: === Iteration 152 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:38:25,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:25,473 INFO L82 PathProgramCache]: Analyzing trace with hash -2142917369, now seen corresponding path program 149 times [2019-08-05 10:38:25,474 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:25,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:25,524 INFO L256 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 203 conjunts are in the unsatisfiable core [2019-08-05 10:38:25,525 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:26,861 INFO L134 CoverageAnalysis]: Checked inductivity of 2601 backedges. 51 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:38:26,862 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:26,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-08-05 10:38:26,862 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-08-05 10:38:26,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-08-05 10:38:26,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:38:26,862 INFO L87 Difference]: Start difference. First operand 108 states and 110 transitions. Second operand 53 states. [2019-08-05 10:38:30,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:30,271 INFO L93 Difference]: Finished difference Result 158 states and 159 transitions. [2019-08-05 10:38:30,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-08-05 10:38:30,272 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 106 [2019-08-05 10:38:30,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:30,272 INFO L225 Difference]: With dead ends: 158 [2019-08-05 10:38:30,272 INFO L226 Difference]: Without dead ends: 107 [2019-08-05 10:38:30,273 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:38:30,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-08-05 10:38:30,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-08-05 10:38:30,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-08-05 10:38:30,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 108 transitions. [2019-08-05 10:38:30,275 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 108 transitions. Word has length 106 [2019-08-05 10:38:30,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:30,275 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 108 transitions. [2019-08-05 10:38:30,275 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-08-05 10:38:30,275 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 108 transitions. [2019-08-05 10:38:30,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-08-05 10:38:30,276 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:30,276 INFO L399 BasicCegarLoop]: trace histogram [51, 50, 1, 1, 1, 1, 1] [2019-08-05 10:38:30,276 INFO L418 AbstractCegarLoop]: === Iteration 153 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:38:30,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:30,277 INFO L82 PathProgramCache]: Analyzing trace with hash 655395117, now seen corresponding path program 150 times [2019-08-05 10:38:30,277 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:30,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:30,311 INFO L256 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 103 conjunts are in the unsatisfiable core [2019-08-05 10:38:30,312 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:31,666 INFO L134 CoverageAnalysis]: Checked inductivity of 2601 backedges. 1326 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:38:31,666 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:31,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-05 10:38:31,666 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-08-05 10:38:31,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-08-05 10:38:31,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:38:31,667 INFO L87 Difference]: Start difference. First operand 107 states and 108 transitions. Second operand 54 states. [2019-08-05 10:38:31,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:31,849 INFO L93 Difference]: Finished difference Result 108 states and 109 transitions. [2019-08-05 10:38:31,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-05 10:38:31,850 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 106 [2019-08-05 10:38:31,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:31,850 INFO L225 Difference]: With dead ends: 108 [2019-08-05 10:38:31,851 INFO L226 Difference]: Without dead ends: 108 [2019-08-05 10:38:31,851 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:38:31,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-08-05 10:38:31,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2019-08-05 10:38:31,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-08-05 10:38:31,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 109 transitions. [2019-08-05 10:38:31,853 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 109 transitions. Word has length 106 [2019-08-05 10:38:31,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:31,853 INFO L475 AbstractCegarLoop]: Abstraction has 108 states and 109 transitions. [2019-08-05 10:38:31,853 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-08-05 10:38:31,853 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 109 transitions. [2019-08-05 10:38:31,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-08-05 10:38:31,854 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:31,854 INFO L399 BasicCegarLoop]: trace histogram [51, 51, 1, 1, 1, 1, 1] [2019-08-05 10:38:31,854 INFO L418 AbstractCegarLoop]: === Iteration 154 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:38:31,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:31,854 INFO L82 PathProgramCache]: Analyzing trace with hash -1157649375, now seen corresponding path program 151 times [2019-08-05 10:38:31,855 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:31,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:31,923 INFO L256 TraceCheckSpWp]: Trace formula consists of 471 conjuncts, 207 conjunts are in the unsatisfiable core [2019-08-05 10:38:31,925 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:33,025 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:38:33,025 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:33,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-08-05 10:38:33,025 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-08-05 10:38:33,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-08-05 10:38:33,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:38:33,026 INFO L87 Difference]: Start difference. First operand 108 states and 109 transitions. Second operand 54 states. [2019-08-05 10:38:36,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:36,729 INFO L93 Difference]: Finished difference Result 163 states and 165 transitions. [2019-08-05 10:38:36,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-05 10:38:36,730 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 107 [2019-08-05 10:38:36,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:36,730 INFO L225 Difference]: With dead ends: 163 [2019-08-05 10:38:36,730 INFO L226 Difference]: Without dead ends: 161 [2019-08-05 10:38:36,731 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:38:36,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-08-05 10:38:36,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 110. [2019-08-05 10:38:36,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-08-05 10:38:36,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 112 transitions. [2019-08-05 10:38:36,732 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 112 transitions. Word has length 107 [2019-08-05 10:38:36,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:36,733 INFO L475 AbstractCegarLoop]: Abstraction has 110 states and 112 transitions. [2019-08-05 10:38:36,733 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-08-05 10:38:36,733 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 112 transitions. [2019-08-05 10:38:36,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-08-05 10:38:36,733 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:36,733 INFO L399 BasicCegarLoop]: trace histogram [52, 51, 1, 1, 1, 1, 1] [2019-08-05 10:38:36,733 INFO L418 AbstractCegarLoop]: === Iteration 155 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:38:36,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:36,734 INFO L82 PathProgramCache]: Analyzing trace with hash -1527453779, now seen corresponding path program 152 times [2019-08-05 10:38:36,734 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:36,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:36,818 INFO L256 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 207 conjunts are in the unsatisfiable core [2019-08-05 10:38:36,819 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:37,928 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 52 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:38:37,928 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:37,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-05 10:38:37,928 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-08-05 10:38:37,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-08-05 10:38:37,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:38:37,929 INFO L87 Difference]: Start difference. First operand 110 states and 112 transitions. Second operand 54 states. [2019-08-05 10:38:41,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:41,644 INFO L93 Difference]: Finished difference Result 161 states and 162 transitions. [2019-08-05 10:38:41,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-05 10:38:41,645 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 108 [2019-08-05 10:38:41,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:41,645 INFO L225 Difference]: With dead ends: 161 [2019-08-05 10:38:41,646 INFO L226 Difference]: Without dead ends: 109 [2019-08-05 10:38:41,646 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:38:41,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-08-05 10:38:41,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2019-08-05 10:38:41,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-08-05 10:38:41,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 110 transitions. [2019-08-05 10:38:41,648 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 110 transitions. Word has length 108 [2019-08-05 10:38:41,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:41,648 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 110 transitions. [2019-08-05 10:38:41,648 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-08-05 10:38:41,648 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 110 transitions. [2019-08-05 10:38:41,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-08-05 10:38:41,649 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:41,649 INFO L399 BasicCegarLoop]: trace histogram [52, 51, 1, 1, 1, 1, 1] [2019-08-05 10:38:41,649 INFO L418 AbstractCegarLoop]: === Iteration 156 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:38:41,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:41,650 INFO L82 PathProgramCache]: Analyzing trace with hash -679112633, now seen corresponding path program 153 times [2019-08-05 10:38:41,650 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:41,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:41,679 INFO L256 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 105 conjunts are in the unsatisfiable core [2019-08-05 10:38:41,680 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:42,718 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 1378 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:38:42,718 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:42,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-08-05 10:38:42,719 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-08-05 10:38:42,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-08-05 10:38:42,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:38:42,720 INFO L87 Difference]: Start difference. First operand 109 states and 110 transitions. Second operand 55 states. [2019-08-05 10:38:42,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:42,923 INFO L93 Difference]: Finished difference Result 110 states and 111 transitions. [2019-08-05 10:38:42,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-05 10:38:42,924 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 108 [2019-08-05 10:38:42,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:42,924 INFO L225 Difference]: With dead ends: 110 [2019-08-05 10:38:42,925 INFO L226 Difference]: Without dead ends: 110 [2019-08-05 10:38:42,925 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:38:42,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-08-05 10:38:42,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2019-08-05 10:38:42,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-08-05 10:38:42,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 111 transitions. [2019-08-05 10:38:42,927 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 111 transitions. Word has length 108 [2019-08-05 10:38:42,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:42,927 INFO L475 AbstractCegarLoop]: Abstraction has 110 states and 111 transitions. [2019-08-05 10:38:42,927 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-08-05 10:38:42,927 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 111 transitions. [2019-08-05 10:38:42,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-08-05 10:38:42,927 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:42,927 INFO L399 BasicCegarLoop]: trace histogram [52, 52, 1, 1, 1, 1, 1] [2019-08-05 10:38:42,928 INFO L418 AbstractCegarLoop]: === Iteration 157 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:38:42,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:42,928 INFO L82 PathProgramCache]: Analyzing trace with hash 422283335, now seen corresponding path program 154 times [2019-08-05 10:38:42,928 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:42,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:42,977 INFO L256 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 211 conjunts are in the unsatisfiable core [2019-08-05 10:38:42,978 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:44,097 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:38:44,097 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:44,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-05 10:38:44,098 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-08-05 10:38:44,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-08-05 10:38:44,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:38:44,098 INFO L87 Difference]: Start difference. First operand 110 states and 111 transitions. Second operand 55 states. [2019-08-05 10:38:47,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:47,941 INFO L93 Difference]: Finished difference Result 166 states and 168 transitions. [2019-08-05 10:38:47,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-05 10:38:47,941 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 109 [2019-08-05 10:38:47,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:47,942 INFO L225 Difference]: With dead ends: 166 [2019-08-05 10:38:47,942 INFO L226 Difference]: Without dead ends: 164 [2019-08-05 10:38:47,942 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:38:47,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-08-05 10:38:47,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 112. [2019-08-05 10:38:47,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-08-05 10:38:47,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 114 transitions. [2019-08-05 10:38:47,944 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 114 transitions. Word has length 109 [2019-08-05 10:38:47,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:47,944 INFO L475 AbstractCegarLoop]: Abstraction has 112 states and 114 transitions. [2019-08-05 10:38:47,945 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-08-05 10:38:47,945 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 114 transitions. [2019-08-05 10:38:47,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-08-05 10:38:47,945 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:47,945 INFO L399 BasicCegarLoop]: trace histogram [53, 52, 1, 1, 1, 1, 1] [2019-08-05 10:38:47,946 INFO L418 AbstractCegarLoop]: === Iteration 158 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:38:47,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:47,946 INFO L82 PathProgramCache]: Analyzing trace with hash 205819975, now seen corresponding path program 155 times [2019-08-05 10:38:47,946 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:47,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:47,998 INFO L256 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 211 conjunts are in the unsatisfiable core [2019-08-05 10:38:47,999 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:49,105 INFO L134 CoverageAnalysis]: Checked inductivity of 2809 backedges. 53 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:38:49,105 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:49,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-08-05 10:38:49,105 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-08-05 10:38:49,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-08-05 10:38:49,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:38:49,106 INFO L87 Difference]: Start difference. First operand 112 states and 114 transitions. Second operand 55 states. [2019-08-05 10:38:52,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:52,928 INFO L93 Difference]: Finished difference Result 164 states and 165 transitions. [2019-08-05 10:38:52,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-05 10:38:52,929 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 110 [2019-08-05 10:38:52,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:52,929 INFO L225 Difference]: With dead ends: 164 [2019-08-05 10:38:52,929 INFO L226 Difference]: Without dead ends: 111 [2019-08-05 10:38:52,930 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:38:52,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-08-05 10:38:52,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-08-05 10:38:52,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-08-05 10:38:52,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 112 transitions. [2019-08-05 10:38:52,932 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 112 transitions. Word has length 110 [2019-08-05 10:38:52,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:52,932 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 112 transitions. [2019-08-05 10:38:52,932 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-08-05 10:38:52,932 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 112 transitions. [2019-08-05 10:38:52,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-08-05 10:38:52,933 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:52,933 INFO L399 BasicCegarLoop]: trace histogram [53, 52, 1, 1, 1, 1, 1] [2019-08-05 10:38:52,933 INFO L418 AbstractCegarLoop]: === Iteration 159 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:38:52,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:52,933 INFO L82 PathProgramCache]: Analyzing trace with hash 734591725, now seen corresponding path program 156 times [2019-08-05 10:38:52,934 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:52,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:52,962 INFO L256 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 107 conjunts are in the unsatisfiable core [2019-08-05 10:38:52,963 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:54,074 INFO L134 CoverageAnalysis]: Checked inductivity of 2809 backedges. 1431 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:38:54,074 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:54,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-08-05 10:38:54,075 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-08-05 10:38:54,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-08-05 10:38:54,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:38:54,075 INFO L87 Difference]: Start difference. First operand 111 states and 112 transitions. Second operand 56 states. [2019-08-05 10:38:54,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:54,270 INFO L93 Difference]: Finished difference Result 112 states and 113 transitions. [2019-08-05 10:38:54,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-08-05 10:38:54,270 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 110 [2019-08-05 10:38:54,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:54,271 INFO L225 Difference]: With dead ends: 112 [2019-08-05 10:38:54,271 INFO L226 Difference]: Without dead ends: 112 [2019-08-05 10:38:54,271 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:38:54,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-08-05 10:38:54,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2019-08-05 10:38:54,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-08-05 10:38:54,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 113 transitions. [2019-08-05 10:38:54,273 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 113 transitions. Word has length 110 [2019-08-05 10:38:54,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:54,273 INFO L475 AbstractCegarLoop]: Abstraction has 112 states and 113 transitions. [2019-08-05 10:38:54,274 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-08-05 10:38:54,274 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 113 transitions. [2019-08-05 10:38:54,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-08-05 10:38:54,274 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:54,274 INFO L399 BasicCegarLoop]: trace histogram [53, 53, 1, 1, 1, 1, 1] [2019-08-05 10:38:54,275 INFO L418 AbstractCegarLoop]: === Iteration 160 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:38:54,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:54,275 INFO L82 PathProgramCache]: Analyzing trace with hash 1297445473, now seen corresponding path program 157 times [2019-08-05 10:38:54,276 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:54,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:54,326 INFO L256 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 215 conjunts are in the unsatisfiable core [2019-08-05 10:38:54,327 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:55,457 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:38:55,457 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:55,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-08-05 10:38:55,458 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-08-05 10:38:55,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-08-05 10:38:55,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:38:55,458 INFO L87 Difference]: Start difference. First operand 112 states and 113 transitions. Second operand 56 states. Received shutdown request... [2019-08-05 10:38:59,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-08-05 10:38:59,067 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-05 10:38:59,074 WARN L223 ceAbstractionStarter]: Timeout [2019-08-05 10:38:59,074 INFO L202 PluginConnector]: Adding new model doubleLoopUniformIterations.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:38:59 BoogieIcfgContainer [2019-08-05 10:38:59,074 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:38:59,076 INFO L168 Benchmark]: Toolchain (without parser) took 244711.45 ms. Allocated memory was 134.2 MB in the beginning and 240.1 MB in the end (delta: 105.9 MB). Free memory was 111.8 MB in the beginning and 102.8 MB in the end (delta: 9.0 MB). Peak memory consumption was 114.9 MB. Max. memory is 7.1 GB. [2019-08-05 10:38:59,076 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 134.2 MB. Free memory was 113.0 MB in the beginning and 112.8 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-08-05 10:38:59,077 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.59 ms. Allocated memory is still 134.2 MB. Free memory was 111.8 MB in the beginning and 109.9 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-08-05 10:38:59,077 INFO L168 Benchmark]: Boogie Preprocessor took 27.23 ms. Allocated memory is still 134.2 MB. Free memory was 109.9 MB in the beginning and 108.8 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-08-05 10:38:59,078 INFO L168 Benchmark]: RCFGBuilder took 334.20 ms. Allocated memory is still 134.2 MB. Free memory was 108.6 MB in the beginning and 99.5 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 7.1 GB. [2019-08-05 10:38:59,079 INFO L168 Benchmark]: TraceAbstraction took 244305.57 ms. Allocated memory was 134.2 MB in the beginning and 240.1 MB in the end (delta: 105.9 MB). Free memory was 99.3 MB in the beginning and 102.8 MB in the end (delta: -3.5 MB). Peak memory consumption was 102.4 MB. Max. memory is 7.1 GB. [2019-08-05 10:38:59,081 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 134.2 MB. Free memory was 113.0 MB in the beginning and 112.8 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 39.59 ms. Allocated memory is still 134.2 MB. Free memory was 111.8 MB in the beginning and 109.9 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 27.23 ms. Allocated memory is still 134.2 MB. Free memory was 109.9 MB in the beginning and 108.8 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 334.20 ms. Allocated memory is still 134.2 MB. Free memory was 108.6 MB in the beginning and 99.5 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 244305.57 ms. Allocated memory was 134.2 MB in the beginning and 240.1 MB in the end (delta: 105.9 MB). Free memory was 99.3 MB in the beginning and 102.8 MB in the end (delta: -3.5 MB). Peak memory consumption was 102.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 24]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 24). Cancelled while BasicCegarLoop was constructing difference of abstraction (112states) and FLOYD_HOARE automaton (currently 56 states, 56 states before enhancement),while ReachableStatesComputation was computing reachable states (147 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 23]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 23). Cancelled while BasicCegarLoop was constructing difference of abstraction (112states) and FLOYD_HOARE automaton (currently 56 states, 56 states before enhancement),while ReachableStatesComputation was computing reachable states (147 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 8 locations, 2 error locations. TIMEOUT Result, 244.2s OverallTime, 160 OverallIterations, 53 TraceHistogramMax, 155.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 640 SDtfs, 724 SDslu, 7258 SDs, 0 SdLazy, 221073 SolverSat, 1591 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 127.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 9118 GetRequests, 4718 SyntacticMatches, 0 SemanticMatches, 4400 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 82.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=112occurred in iteration=157, 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.3s AutomataMinimizationTime, 159 MinimizatonAttempts, 1378 StatesRemovedByMinimization, 52 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 2.8s SatisfiabilityAnalysisTime, 84.6s InterpolantComputationTime, 9278 NumberOfCodeBlocks, 9278 NumberOfCodeBlocksAsserted, 160 NumberOfCheckSat, 9118 ConstructedInterpolants, 0 QuantifiedInterpolants, 1984350 SizeOfPredicates, 53 NumberOfNonLiveVariables, 40073 ConjunctsInSsa, 14472 ConjunctsInUnsatCore, 160 InterpolantComputations, 3 PerfectInterpolantSequences, 27665/154547 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown