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/INT_times_vs_add.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:30:49,205 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:30:49,208 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:30:49,224 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:30:49,225 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:30:49,227 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:30:49,230 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:30:49,235 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:30:49,238 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:30:49,245 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:30:49,246 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:30:49,250 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:30:49,250 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:30:49,251 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:30:49,252 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:30:49,257 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:30:49,258 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:30:49,261 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:30:49,264 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:30:49,268 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:30:49,270 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:30:49,271 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:30:49,274 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:30:49,275 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:30:49,278 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:30:49,278 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:30:49,278 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:30:49,279 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:30:49,280 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:30:49,281 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:30:49,281 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:30:49,282 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:30:49,286 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:30:49,287 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:30:49,289 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:30:49,289 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:30:49,290 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:30:49,290 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:30:49,291 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:30:49,292 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:30:49,292 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:30:49,322 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:30:49,334 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:30:49,338 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:30:49,339 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:30:49,340 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:30:49,341 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/INT_times_vs_add.bpl [2019-08-05 10:30:49,341 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/INT_times_vs_add.bpl' [2019-08-05 10:30:49,374 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:30:49,375 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:30:49,376 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:30:49,376 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:30:49,376 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:30:49,392 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "INT_times_vs_add.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:30:49" (1/1) ... [2019-08-05 10:30:49,401 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "INT_times_vs_add.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:30:49" (1/1) ... [2019-08-05 10:30:49,407 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 10:30:49,407 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 10:30:49,407 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 10:30:49,409 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:30:49,410 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:30:49,410 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:30:49,410 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:30:49,421 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "INT_times_vs_add.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:30:49" (1/1) ... [2019-08-05 10:30:49,421 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "INT_times_vs_add.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:30:49" (1/1) ... [2019-08-05 10:30:49,422 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "INT_times_vs_add.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:30:49" (1/1) ... [2019-08-05 10:30:49,422 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "INT_times_vs_add.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:30:49" (1/1) ... [2019-08-05 10:30:49,425 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "INT_times_vs_add.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:30:49" (1/1) ... [2019-08-05 10:30:49,430 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "INT_times_vs_add.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:30:49" (1/1) ... [2019-08-05 10:30:49,431 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "INT_times_vs_add.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:30:49" (1/1) ... [2019-08-05 10:30:49,432 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:30:49,433 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:30:49,433 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:30:49,434 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:30:49,434 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "INT_times_vs_add.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:30:49" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-08-05 10:30:49,505 INFO L124 BoogieDeclarations]: Specification and implementation of procedure TimesVsAdd given in one single declaration [2019-08-05 10:30:49,505 INFO L130 BoogieDeclarations]: Found specification of procedure TimesVsAdd [2019-08-05 10:30:49,505 INFO L138 BoogieDeclarations]: Found implementation of procedure TimesVsAdd [2019-08-05 10:30:49,711 INFO L275 CfgBuilder]: Using library mode [2019-08-05 10:30:49,711 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 10:30:49,713 INFO L202 PluginConnector]: Adding new model INT_times_vs_add.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:30:49 BoogieIcfgContainer [2019-08-05 10:30:49,713 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:30:49,714 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:30:49,714 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:30:49,717 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:30:49,718 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "INT_times_vs_add.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:30:49" (1/2) ... [2019-08-05 10:30:49,719 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e3fa21b and model type INT_times_vs_add.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:30:49, skipping insertion in model container [2019-08-05 10:30:49,719 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "INT_times_vs_add.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:30:49" (2/2) ... [2019-08-05 10:30:49,721 INFO L109 eAbstractionObserver]: Analyzing ICFG INT_times_vs_add.bpl [2019-08-05 10:30:49,730 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:30:49,738 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 10:30:49,754 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 10:30:49,780 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:30:49,781 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:30:49,781 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:30:49,782 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:30:49,782 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:30:49,782 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:30:49,782 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:30:49,782 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:30:49,783 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:30:49,796 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2019-08-05 10:30:49,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 10:30:49,805 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:30:49,805 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 10:30:49,808 INFO L418 AbstractCegarLoop]: === Iteration 1 === [TimesVsAddErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:30:49,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:30:49,814 INFO L82 PathProgramCache]: Analyzing trace with hash 935630, now seen corresponding path program 1 times [2019-08-05 10:30:49,865 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:30:49,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:30:49,899 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 10:30:49,903 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:30:50,068 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:30:50,071 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:30:50,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:30:50,074 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:30:50,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:30:50,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:30:50,088 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 4 states. [2019-08-05 10:30:50,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:30:50,206 INFO L93 Difference]: Finished difference Result 15 states and 20 transitions. [2019-08-05 10:30:50,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:30:50,209 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-08-05 10:30:50,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:30:50,220 INFO L225 Difference]: With dead ends: 15 [2019-08-05 10:30:50,220 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 10:30:50,223 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:30:50,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 10:30:50,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 9. [2019-08-05 10:30:50,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 10:30:50,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 13 transitions. [2019-08-05 10:30:50,256 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 13 transitions. Word has length 4 [2019-08-05 10:30:50,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:30:50,256 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 13 transitions. [2019-08-05 10:30:50,256 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:30:50,257 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 13 transitions. [2019-08-05 10:30:50,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 10:30:50,257 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:30:50,257 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-08-05 10:30:50,258 INFO L418 AbstractCegarLoop]: === Iteration 2 === [TimesVsAddErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:30:50,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:30:50,258 INFO L82 PathProgramCache]: Analyzing trace with hash 29002596, now seen corresponding path program 1 times [2019-08-05 10:30:50,260 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:30:50,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:30:50,276 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 10:30:50,277 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:30:50,459 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:30:50,460 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:30:50,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 10:30:50,461 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:30:50,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:30:50,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:30:50,462 INFO L87 Difference]: Start difference. First operand 9 states and 13 transitions. Second operand 5 states. [2019-08-05 10:30:50,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:30:50,656 INFO L93 Difference]: Finished difference Result 14 states and 20 transitions. [2019-08-05 10:30:50,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:30:50,657 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-08-05 10:30:50,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:30:50,659 INFO L225 Difference]: With dead ends: 14 [2019-08-05 10:30:50,659 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 10:30:50,660 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:30:50,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 10:30:50,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2019-08-05 10:30:50,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 10:30:50,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 14 transitions. [2019-08-05 10:30:50,663 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 14 transitions. Word has length 5 [2019-08-05 10:30:50,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:30:50,664 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 14 transitions. [2019-08-05 10:30:50,664 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:30:50,664 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 14 transitions. [2019-08-05 10:30:50,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 10:30:50,665 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:30:50,665 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:30:50,665 INFO L418 AbstractCegarLoop]: === Iteration 3 === [TimesVsAddErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:30:50,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:30:50,666 INFO L82 PathProgramCache]: Analyzing trace with hash 1865025126, now seen corresponding path program 1 times [2019-08-05 10:30:50,667 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:30:50,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:30:50,681 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 10:30:50,682 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:30:50,830 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:30:50,830 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:30:50,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:30:50,831 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:30:50,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:30:50,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:30:50,832 INFO L87 Difference]: Start difference. First operand 10 states and 14 transitions. Second operand 5 states. [2019-08-05 10:30:51,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:30:51,048 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2019-08-05 10:30:51,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:30:51,049 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-08-05 10:30:51,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:30:51,050 INFO L225 Difference]: With dead ends: 12 [2019-08-05 10:30:51,051 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 10:30:51,052 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:30:51,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 10:30:51,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2019-08-05 10:30:51,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 10:30:51,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 15 transitions. [2019-08-05 10:30:51,055 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 15 transitions. Word has length 7 [2019-08-05 10:30:51,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:30:51,055 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 15 transitions. [2019-08-05 10:30:51,055 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:30:51,055 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 15 transitions. [2019-08-05 10:30:51,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 10:30:51,056 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:30:51,056 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:30:51,056 INFO L418 AbstractCegarLoop]: === Iteration 4 === [TimesVsAddErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:30:51,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:30:51,057 INFO L82 PathProgramCache]: Analyzing trace with hash 1866935594, now seen corresponding path program 1 times [2019-08-05 10:30:51,058 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:30:51,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:30:51,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 10:30:51,070 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:30:51,125 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:30:51,126 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:30:51,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-08-05 10:30:51,127 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:30:51,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:30:51,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:30:51,128 INFO L87 Difference]: Start difference. First operand 11 states and 15 transitions. Second operand 5 states. [2019-08-05 10:30:51,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:30:51,322 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2019-08-05 10:30:51,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:30:51,323 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-08-05 10:30:51,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:30:51,324 INFO L225 Difference]: With dead ends: 13 [2019-08-05 10:30:51,324 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 10:30:51,325 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:30:51,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 10:30:51,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2019-08-05 10:30:51,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 10:30:51,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2019-08-05 10:30:51,328 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 11 transitions. Word has length 7 [2019-08-05 10:30:51,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:30:51,328 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 11 transitions. [2019-08-05 10:30:51,328 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:30:51,329 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 11 transitions. [2019-08-05 10:30:51,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:30:51,329 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:30:51,329 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:30:51,331 INFO L418 AbstractCegarLoop]: === Iteration 5 === [TimesVsAddErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:30:51,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:30:51,332 INFO L82 PathProgramCache]: Analyzing trace with hash 1981202124, now seen corresponding path program 1 times [2019-08-05 10:30:51,333 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:30:51,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:30:51,348 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 10:30:51,349 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:30:51,528 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:30:51,528 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:30:51,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:30:51,529 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:30:51,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:30:51,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:30:51,530 INFO L87 Difference]: Start difference. First operand 9 states and 11 transitions. Second operand 8 states. [2019-08-05 10:30:51,772 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-08-05 10:30:51,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:30:51,978 INFO L93 Difference]: Finished difference Result 19 states and 23 transitions. [2019-08-05 10:30:51,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:30:51,979 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-08-05 10:30:51,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:30:51,980 INFO L225 Difference]: With dead ends: 19 [2019-08-05 10:30:51,980 INFO L226 Difference]: Without dead ends: 18 [2019-08-05 10:30:51,981 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:30:51,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-05 10:30:51,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 13. [2019-08-05 10:30:51,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 10:30:51,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2019-08-05 10:30:51,985 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 17 transitions. Word has length 8 [2019-08-05 10:30:51,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:30:51,985 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 17 transitions. [2019-08-05 10:30:51,985 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:30:51,985 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 17 transitions. [2019-08-05 10:30:51,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 10:30:51,986 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:30:51,986 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:30:51,986 INFO L418 AbstractCegarLoop]: === Iteration 6 === [TimesVsAddErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:30:51,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:30:51,987 INFO L82 PathProgramCache]: Analyzing trace with hash 1228497258, now seen corresponding path program 2 times [2019-08-05 10:30:51,988 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:30:52,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:30:52,017 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:30:52,018 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:30:52,091 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:30:52,092 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:30:52,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:30:52,093 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:30:52,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:30:52,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:30:52,094 INFO L87 Difference]: Start difference. First operand 13 states and 17 transitions. Second operand 7 states. [2019-08-05 10:30:52,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:30:52,249 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2019-08-05 10:30:52,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:30:52,249 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2019-08-05 10:30:52,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:30:52,251 INFO L225 Difference]: With dead ends: 23 [2019-08-05 10:30:52,251 INFO L226 Difference]: Without dead ends: 23 [2019-08-05 10:30:52,251 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:30:52,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-08-05 10:30:52,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 17. [2019-08-05 10:30:52,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 10:30:52,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2019-08-05 10:30:52,255 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 23 transitions. Word has length 9 [2019-08-05 10:30:52,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:30:52,255 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 23 transitions. [2019-08-05 10:30:52,256 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:30:52,256 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 23 transitions. [2019-08-05 10:30:52,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 10:30:52,256 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:30:52,256 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:30:52,257 INFO L418 AbstractCegarLoop]: === Iteration 7 === [TimesVsAddErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:30:52,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:30:52,257 INFO L82 PathProgramCache]: Analyzing trace with hash 1287721766, now seen corresponding path program 3 times [2019-08-05 10:30:52,258 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:30:52,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:30:52,271 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:30:52,272 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:30:52,337 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:30:52,338 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:30:52,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:30:52,339 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:30:52,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:30:52,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:30:52,340 INFO L87 Difference]: Start difference. First operand 17 states and 23 transitions. Second operand 7 states. [2019-08-05 10:30:52,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:30:52,461 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2019-08-05 10:30:52,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:30:52,462 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2019-08-05 10:30:52,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:30:52,462 INFO L225 Difference]: With dead ends: 23 [2019-08-05 10:30:52,462 INFO L226 Difference]: Without dead ends: 21 [2019-08-05 10:30:52,463 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:30:52,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-05 10:30:52,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2019-08-05 10:30:52,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 10:30:52,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2019-08-05 10:30:52,468 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 9 [2019-08-05 10:30:52,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:30:52,468 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2019-08-05 10:30:52,468 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:30:52,468 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2019-08-05 10:30:52,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 10:30:52,469 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:30:52,469 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2019-08-05 10:30:52,469 INFO L418 AbstractCegarLoop]: === Iteration 8 === [TimesVsAddErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:30:52,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:30:52,470 INFO L82 PathProgramCache]: Analyzing trace with hash -571292600, now seen corresponding path program 4 times [2019-08-05 10:30:52,471 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:30:52,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:30:52,487 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 10:30:52,488 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:30:52,987 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:30:52,987 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:30:52,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:30:52,988 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:30:52,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:30:52,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:30:52,989 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand 10 states. [2019-08-05 10:30:53,376 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-08-05 10:30:53,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:30:53,467 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2019-08-05 10:30:53,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:30:53,467 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2019-08-05 10:30:53,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:30:53,468 INFO L225 Difference]: With dead ends: 29 [2019-08-05 10:30:53,469 INFO L226 Difference]: Without dead ends: 28 [2019-08-05 10:30:53,470 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:30:53,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-08-05 10:30:53,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 22. [2019-08-05 10:30:53,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-05 10:30:53,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2019-08-05 10:30:53,473 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 10 [2019-08-05 10:30:53,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:30:53,474 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 28 transitions. [2019-08-05 10:30:53,474 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:30:53,474 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2019-08-05 10:30:53,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 10:30:53,475 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:30:53,475 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2019-08-05 10:30:53,475 INFO L418 AbstractCegarLoop]: === Iteration 9 === [TimesVsAddErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:30:53,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:30:53,475 INFO L82 PathProgramCache]: Analyzing trace with hash 1928804198, now seen corresponding path program 5 times [2019-08-05 10:30:53,476 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:30:53,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:30:53,492 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:30:53,493 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:30:53,587 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:30:53,587 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:30:53,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:30:53,588 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:30:53,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:30:53,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:30:53,589 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. Second operand 9 states. [2019-08-05 10:30:53,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:30:53,802 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2019-08-05 10:30:53,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:30:53,802 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 11 [2019-08-05 10:30:53,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:30:53,803 INFO L225 Difference]: With dead ends: 37 [2019-08-05 10:30:53,803 INFO L226 Difference]: Without dead ends: 37 [2019-08-05 10:30:53,803 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:30:53,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-08-05 10:30:53,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 27. [2019-08-05 10:30:53,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-05 10:30:53,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2019-08-05 10:30:53,808 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 11 [2019-08-05 10:30:53,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:30:53,808 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2019-08-05 10:30:53,808 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:30:53,808 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2019-08-05 10:30:53,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 10:30:53,809 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:30:53,809 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2019-08-05 10:30:53,809 INFO L418 AbstractCegarLoop]: === Iteration 10 === [TimesVsAddErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:30:53,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:30:53,810 INFO L82 PathProgramCache]: Analyzing trace with hash -530203350, now seen corresponding path program 6 times [2019-08-05 10:30:53,811 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:30:53,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:30:53,824 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:30:53,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:30:53,918 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:30:53,918 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:30:53,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:30:53,919 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:30:53,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:30:53,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:30:53,920 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand 9 states. [2019-08-05 10:30:54,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:30:54,152 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2019-08-05 10:30:54,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:30:54,153 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 11 [2019-08-05 10:30:54,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:30:54,153 INFO L225 Difference]: With dead ends: 37 [2019-08-05 10:30:54,153 INFO L226 Difference]: Without dead ends: 34 [2019-08-05 10:30:54,154 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:30:54,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-08-05 10:30:54,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 28. [2019-08-05 10:30:54,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-05 10:30:54,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2019-08-05 10:30:54,159 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 11 [2019-08-05 10:30:54,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:30:54,160 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2019-08-05 10:30:54,160 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:30:54,160 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2019-08-05 10:30:54,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 10:30:54,160 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:30:54,161 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2019-08-05 10:30:54,161 INFO L418 AbstractCegarLoop]: === Iteration 11 === [TimesVsAddErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:30:54,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:30:54,161 INFO L82 PathProgramCache]: Analyzing trace with hash 1805185636, now seen corresponding path program 7 times [2019-08-05 10:30:54,162 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:30:54,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:30:54,185 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 10:30:54,189 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:30:54,496 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:30:54,496 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:30:54,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:30:54,497 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:30:54,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:30:54,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:30:54,497 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand 10 states. [2019-08-05 10:30:54,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:30:54,910 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2019-08-05 10:30:54,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:30:54,911 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 11 [2019-08-05 10:30:54,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:30:54,912 INFO L225 Difference]: With dead ends: 35 [2019-08-05 10:30:54,912 INFO L226 Difference]: Without dead ends: 32 [2019-08-05 10:30:54,913 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:30:54,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-08-05 10:30:54,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2019-08-05 10:30:54,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-08-05 10:30:54,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2019-08-05 10:30:54,917 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 11 [2019-08-05 10:30:54,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:30:54,917 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2019-08-05 10:30:54,917 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:30:54,918 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2019-08-05 10:30:54,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:30:54,918 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:30:54,918 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1] [2019-08-05 10:30:54,918 INFO L418 AbstractCegarLoop]: === Iteration 12 === [TimesVsAddErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:30:54,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:30:54,919 INFO L82 PathProgramCache]: Analyzing trace with hash -336613940, now seen corresponding path program 8 times [2019-08-05 10:30:54,919 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:30:54,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:30:54,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 24 conjunts are in the unsatisfiable core [2019-08-05 10:30:54,935 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:30:55,244 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:30:55,245 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:30:55,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:30:55,245 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:30:55,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:30:55,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:30:55,246 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand 12 states. [2019-08-05 10:30:55,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:30:55,613 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2019-08-05 10:30:55,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:30:55,614 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2019-08-05 10:30:55,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:30:55,614 INFO L225 Difference]: With dead ends: 42 [2019-08-05 10:30:55,615 INFO L226 Difference]: Without dead ends: 41 [2019-08-05 10:30:55,615 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:30:55,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-08-05 10:30:55,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 34. [2019-08-05 10:30:55,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-05 10:30:55,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2019-08-05 10:30:55,620 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 42 transitions. Word has length 12 [2019-08-05 10:30:55,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:30:55,620 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 42 transitions. [2019-08-05 10:30:55,620 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:30:55,620 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2019-08-05 10:30:55,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 10:30:55,621 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:30:55,622 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1] [2019-08-05 10:30:55,622 INFO L418 AbstractCegarLoop]: === Iteration 13 === [TimesVsAddErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:30:55,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:30:55,622 INFO L82 PathProgramCache]: Analyzing trace with hash 1369690474, now seen corresponding path program 9 times [2019-08-05 10:30:55,623 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:30:55,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:30:55,637 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 10:30:55,638 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:30:55,827 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:30:55,827 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:30:55,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:30:55,828 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:30:55,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:30:55,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:30:55,829 INFO L87 Difference]: Start difference. First operand 34 states and 42 transitions. Second operand 11 states. [2019-08-05 10:30:56,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:30:56,064 INFO L93 Difference]: Finished difference Result 56 states and 64 transitions. [2019-08-05 10:30:56,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:30:56,066 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 13 [2019-08-05 10:30:56,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:30:56,067 INFO L225 Difference]: With dead ends: 56 [2019-08-05 10:30:56,067 INFO L226 Difference]: Without dead ends: 56 [2019-08-05 10:30:56,067 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:30:56,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-08-05 10:30:56,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 40. [2019-08-05 10:30:56,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-05 10:30:56,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 50 transitions. [2019-08-05 10:30:56,072 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 50 transitions. Word has length 13 [2019-08-05 10:30:56,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:30:56,072 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 50 transitions. [2019-08-05 10:30:56,072 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:30:56,073 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 50 transitions. [2019-08-05 10:30:56,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 10:30:56,073 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:30:56,073 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1] [2019-08-05 10:30:56,074 INFO L418 AbstractCegarLoop]: === Iteration 14 === [TimesVsAddErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:30:56,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:30:56,074 INFO L82 PathProgramCache]: Analyzing trace with hash -1845099482, now seen corresponding path program 10 times [2019-08-05 10:30:56,075 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:30:56,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:30:56,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 10:30:56,090 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:30:56,199 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:30:56,199 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:30:56,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:30:56,200 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:30:56,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:30:56,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:30:56,200 INFO L87 Difference]: Start difference. First operand 40 states and 50 transitions. Second operand 11 states. [2019-08-05 10:30:56,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:30:56,547 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2019-08-05 10:30:56,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:30:56,548 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 13 [2019-08-05 10:30:56,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:30:56,549 INFO L225 Difference]: With dead ends: 56 [2019-08-05 10:30:56,549 INFO L226 Difference]: Without dead ends: 52 [2019-08-05 10:30:56,550 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=126, Invalid=254, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:30:56,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-08-05 10:30:56,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 41. [2019-08-05 10:30:56,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-05 10:30:56,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2019-08-05 10:30:56,554 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 13 [2019-08-05 10:30:56,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:30:56,555 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2019-08-05 10:30:56,555 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:30:56,555 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2019-08-05 10:30:56,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 10:30:56,556 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:30:56,556 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1] [2019-08-05 10:30:56,556 INFO L418 AbstractCegarLoop]: === Iteration 15 === [TimesVsAddErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:30:56,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:30:56,556 INFO L82 PathProgramCache]: Analyzing trace with hash -489270200, now seen corresponding path program 11 times [2019-08-05 10:30:56,557 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:30:56,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:30:56,571 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 28 conjunts are in the unsatisfiable core [2019-08-05 10:30:56,572 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:30:56,851 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:30:56,852 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:30:56,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:30:56,852 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:30:56,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:30:56,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:30:56,853 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand 14 states. [2019-08-05 10:30:57,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:30:57,201 INFO L93 Difference]: Finished difference Result 53 states and 63 transitions. [2019-08-05 10:30:57,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:30:57,202 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2019-08-05 10:30:57,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:30:57,203 INFO L225 Difference]: With dead ends: 53 [2019-08-05 10:30:57,203 INFO L226 Difference]: Without dead ends: 52 [2019-08-05 10:30:57,204 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:30:57,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-08-05 10:30:57,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 44. [2019-08-05 10:30:57,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-05 10:30:57,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 54 transitions. [2019-08-05 10:30:57,209 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 54 transitions. Word has length 14 [2019-08-05 10:30:57,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:30:57,209 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 54 transitions. [2019-08-05 10:30:57,209 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:30:57,209 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 54 transitions. [2019-08-05 10:30:57,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 10:30:57,210 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:30:57,210 INFO L399 BasicCegarLoop]: trace histogram [4, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 10:30:57,210 INFO L418 AbstractCegarLoop]: === Iteration 16 === [TimesVsAddErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:30:57,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:30:57,211 INFO L82 PathProgramCache]: Analyzing trace with hash -863583742, now seen corresponding path program 12 times [2019-08-05 10:30:57,212 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:30:57,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:30:57,223 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 26 conjunts are in the unsatisfiable core [2019-08-05 10:30:57,224 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:30:57,388 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:30:57,389 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:30:57,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:30:57,389 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:30:57,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:30:57,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:30:57,390 INFO L87 Difference]: Start difference. First operand 44 states and 54 transitions. Second operand 13 states. [2019-08-05 10:30:57,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:30:57,622 INFO L93 Difference]: Finished difference Result 53 states and 63 transitions. [2019-08-05 10:30:57,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:30:57,622 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 14 [2019-08-05 10:30:57,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:30:57,623 INFO L225 Difference]: With dead ends: 53 [2019-08-05 10:30:57,623 INFO L226 Difference]: Without dead ends: 49 [2019-08-05 10:30:57,624 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:30:57,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-08-05 10:30:57,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2019-08-05 10:30:57,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-05 10:30:57,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 58 transitions. [2019-08-05 10:30:57,628 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 58 transitions. Word has length 14 [2019-08-05 10:30:57,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:30:57,629 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 58 transitions. [2019-08-05 10:30:57,629 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:30:57,630 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2019-08-05 10:30:57,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 10:30:57,631 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:30:57,631 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1] [2019-08-05 10:30:57,632 INFO L418 AbstractCegarLoop]: === Iteration 17 === [TimesVsAddErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:30:57,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:30:57,632 INFO L82 PathProgramCache]: Analyzing trace with hash -2041907252, now seen corresponding path program 13 times [2019-08-05 10:30:57,633 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:30:57,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:30:57,643 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 24 conjunts are in the unsatisfiable core [2019-08-05 10:30:57,644 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:30:57,853 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:30:57,853 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:30:57,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:30:57,854 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:30:57,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:30:57,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:30:57,854 INFO L87 Difference]: Start difference. First operand 48 states and 58 transitions. Second operand 12 states. [2019-08-05 10:30:58,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:30:58,029 INFO L93 Difference]: Finished difference Result 55 states and 65 transitions. [2019-08-05 10:30:58,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:30:58,030 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 14 [2019-08-05 10:30:58,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:30:58,031 INFO L225 Difference]: With dead ends: 55 [2019-08-05 10:30:58,031 INFO L226 Difference]: Without dead ends: 52 [2019-08-05 10:30:58,032 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:30:58,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-08-05 10:30:58,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2019-08-05 10:30:58,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-08-05 10:30:58,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 61 transitions. [2019-08-05 10:30:58,036 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 61 transitions. Word has length 14 [2019-08-05 10:30:58,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:30:58,036 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 61 transitions. [2019-08-05 10:30:58,036 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:30:58,036 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 61 transitions. [2019-08-05 10:30:58,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:30:58,037 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:30:58,037 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1] [2019-08-05 10:30:58,037 INFO L418 AbstractCegarLoop]: === Iteration 18 === [TimesVsAddErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:30:58,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:30:58,038 INFO L82 PathProgramCache]: Analyzing trace with hash -1408235418, now seen corresponding path program 14 times [2019-08-05 10:30:58,038 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:30:58,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:30:58,053 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 10:30:58,054 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:30:58,175 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 11 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:30:58,175 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:30:58,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:30:58,176 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:30:58,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:30:58,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:30:58,177 INFO L87 Difference]: Start difference. First operand 51 states and 61 transitions. Second operand 13 states. [2019-08-05 10:30:58,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:30:58,394 INFO L93 Difference]: Finished difference Result 81 states and 90 transitions. [2019-08-05 10:30:58,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:30:58,394 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 15 [2019-08-05 10:30:58,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:30:58,395 INFO L225 Difference]: With dead ends: 81 [2019-08-05 10:30:58,395 INFO L226 Difference]: Without dead ends: 81 [2019-08-05 10:30:58,395 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=97, Invalid=245, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:30:58,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-08-05 10:30:58,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 58. [2019-08-05 10:30:58,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-08-05 10:30:58,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 70 transitions. [2019-08-05 10:30:58,401 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 70 transitions. Word has length 15 [2019-08-05 10:30:58,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:30:58,401 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 70 transitions. [2019-08-05 10:30:58,401 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:30:58,401 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 70 transitions. [2019-08-05 10:30:58,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:30:58,402 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:30:58,402 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1] [2019-08-05 10:30:58,402 INFO L418 AbstractCegarLoop]: === Iteration 19 === [TimesVsAddErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:30:58,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:30:58,403 INFO L82 PathProgramCache]: Analyzing trace with hash 2012491050, now seen corresponding path program 15 times [2019-08-05 10:30:58,403 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:30:58,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:30:58,414 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 10:30:58,415 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:30:58,502 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 16 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:30:58,502 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:30:58,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:30:58,502 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:30:58,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:30:58,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:30:58,503 INFO L87 Difference]: Start difference. First operand 58 states and 70 transitions. Second operand 13 states. [2019-08-05 10:30:58,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:30:58,894 INFO L93 Difference]: Finished difference Result 81 states and 87 transitions. [2019-08-05 10:30:58,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:30:58,895 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 15 [2019-08-05 10:30:58,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:30:58,895 INFO L225 Difference]: With dead ends: 81 [2019-08-05 10:30:58,895 INFO L226 Difference]: Without dead ends: 76 [2019-08-05 10:30:58,896 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=226, Invalid=476, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:30:58,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-08-05 10:30:58,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 59. [2019-08-05 10:30:58,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-08-05 10:30:58,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 69 transitions. [2019-08-05 10:30:58,901 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 69 transitions. Word has length 15 [2019-08-05 10:30:58,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:30:58,901 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 69 transitions. [2019-08-05 10:30:58,901 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:30:58,901 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 69 transitions. [2019-08-05 10:30:58,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:30:58,902 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:30:58,902 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1] [2019-08-05 10:30:58,902 INFO L418 AbstractCegarLoop]: === Iteration 20 === [TimesVsAddErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:30:58,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:30:58,903 INFO L82 PathProgramCache]: Analyzing trace with hash -705626932, now seen corresponding path program 16 times [2019-08-05 10:30:58,904 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:30:58,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:30:58,915 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 32 conjunts are in the unsatisfiable core [2019-08-05 10:30:58,917 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:30:59,227 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:30:59,228 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:30:59,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:30:59,228 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:30:59,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:30:59,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:30:59,229 INFO L87 Difference]: Start difference. First operand 59 states and 69 transitions. Second operand 16 states. [2019-08-05 10:30:59,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:30:59,606 INFO L93 Difference]: Finished difference Result 72 states and 84 transitions. [2019-08-05 10:30:59,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:30:59,606 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2019-08-05 10:30:59,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:30:59,608 INFO L225 Difference]: With dead ends: 72 [2019-08-05 10:30:59,608 INFO L226 Difference]: Without dead ends: 71 [2019-08-05 10:30:59,609 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:30:59,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-08-05 10:30:59,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 62. [2019-08-05 10:30:59,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-08-05 10:30:59,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 74 transitions. [2019-08-05 10:30:59,613 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 74 transitions. Word has length 16 [2019-08-05 10:30:59,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:30:59,613 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 74 transitions. [2019-08-05 10:30:59,613 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:30:59,614 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 74 transitions. [2019-08-05 10:30:59,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 10:30:59,614 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:30:59,614 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1] [2019-08-05 10:30:59,615 INFO L418 AbstractCegarLoop]: === Iteration 21 === [TimesVsAddErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:30:59,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:30:59,615 INFO L82 PathProgramCache]: Analyzing trace with hash 932061546, now seen corresponding path program 17 times [2019-08-05 10:30:59,616 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:30:59,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:30:59,627 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 10:30:59,628 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:30:59,759 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 16 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:30:59,759 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:30:59,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 10:30:59,760 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 10:30:59,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 10:30:59,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:30:59,761 INFO L87 Difference]: Start difference. First operand 62 states and 74 transitions. Second operand 15 states. [2019-08-05 10:31:00,501 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 8 [2019-08-05 10:31:00,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:00,640 INFO L93 Difference]: Finished difference Result 101 states and 111 transitions. [2019-08-05 10:31:00,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:31:00,641 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 17 [2019-08-05 10:31:00,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:00,641 INFO L225 Difference]: With dead ends: 101 [2019-08-05 10:31:00,641 INFO L226 Difference]: Without dead ends: 101 [2019-08-05 10:31:00,642 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=127, Invalid=335, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:31:00,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-08-05 10:31:00,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 70. [2019-08-05 10:31:00,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-08-05 10:31:00,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 84 transitions. [2019-08-05 10:31:00,645 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 84 transitions. Word has length 17 [2019-08-05 10:31:00,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:00,646 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 84 transitions. [2019-08-05 10:31:00,646 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 10:31:00,646 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 84 transitions. [2019-08-05 10:31:00,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 10:31:00,647 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:00,647 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1] [2019-08-05 10:31:00,647 INFO L418 AbstractCegarLoop]: === Iteration 22 === [TimesVsAddErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:00,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:00,647 INFO L82 PathProgramCache]: Analyzing trace with hash -399600346, now seen corresponding path program 18 times [2019-08-05 10:31:00,648 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:00,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:00,658 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 10:31:00,659 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:00,832 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 22 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:00,832 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:00,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 10:31:00,833 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 10:31:00,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 10:31:00,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:31:00,833 INFO L87 Difference]: Start difference. First operand 70 states and 84 transitions. Second operand 15 states. [2019-08-05 10:31:01,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:01,277 INFO L93 Difference]: Finished difference Result 101 states and 108 transitions. [2019-08-05 10:31:01,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 10:31:01,280 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 17 [2019-08-05 10:31:01,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:01,281 INFO L225 Difference]: With dead ends: 101 [2019-08-05 10:31:01,281 INFO L226 Difference]: Without dead ends: 95 [2019-08-05 10:31:01,282 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=372, Invalid=818, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:31:01,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-08-05 10:31:01,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 71. [2019-08-05 10:31:01,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-08-05 10:31:01,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 83 transitions. [2019-08-05 10:31:01,285 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 83 transitions. Word has length 17 [2019-08-05 10:31:01,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:01,285 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 83 transitions. [2019-08-05 10:31:01,285 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 10:31:01,285 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 83 transitions. [2019-08-05 10:31:01,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 10:31:01,286 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:01,286 INFO L399 BasicCegarLoop]: trace histogram [6, 3, 2, 2, 1, 1, 1, 1] [2019-08-05 10:31:01,286 INFO L418 AbstractCegarLoop]: === Iteration 23 === [TimesVsAddErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:01,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:01,287 INFO L82 PathProgramCache]: Analyzing trace with hash -417838684, now seen corresponding path program 19 times [2019-08-05 10:31:01,287 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:01,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:01,297 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 32 conjunts are in the unsatisfiable core [2019-08-05 10:31:01,298 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:01,515 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:01,516 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:01,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:31:01,516 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:31:01,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:31:01,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:31:01,517 INFO L87 Difference]: Start difference. First operand 71 states and 83 transitions. Second operand 16 states. [2019-08-05 10:31:01,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:01,830 INFO L93 Difference]: Finished difference Result 82 states and 94 transitions. [2019-08-05 10:31:01,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:31:01,830 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 17 [2019-08-05 10:31:01,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:01,832 INFO L225 Difference]: With dead ends: 82 [2019-08-05 10:31:01,832 INFO L226 Difference]: Without dead ends: 77 [2019-08-05 10:31:01,832 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:31:01,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-08-05 10:31:01,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2019-08-05 10:31:01,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-08-05 10:31:01,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 88 transitions. [2019-08-05 10:31:01,835 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 88 transitions. Word has length 17 [2019-08-05 10:31:01,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:01,836 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 88 transitions. [2019-08-05 10:31:01,836 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:31:01,836 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 88 transitions. [2019-08-05 10:31:01,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 10:31:01,836 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:01,837 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1] [2019-08-05 10:31:01,837 INFO L418 AbstractCegarLoop]: === Iteration 24 === [TimesVsAddErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:01,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:01,837 INFO L82 PathProgramCache]: Analyzing trace with hash 416160100, now seen corresponding path program 20 times [2019-08-05 10:31:01,838 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:01,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:01,845 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 28 conjunts are in the unsatisfiable core [2019-08-05 10:31:01,846 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:02,290 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:02,290 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:02,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:31:02,291 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:31:02,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:31:02,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:31:02,292 INFO L87 Difference]: Start difference. First operand 76 states and 88 transitions. Second operand 14 states. [2019-08-05 10:31:02,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:02,496 INFO L93 Difference]: Finished difference Result 83 states and 95 transitions. [2019-08-05 10:31:02,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:31:02,496 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 17 [2019-08-05 10:31:02,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:02,498 INFO L225 Difference]: With dead ends: 83 [2019-08-05 10:31:02,498 INFO L226 Difference]: Without dead ends: 80 [2019-08-05 10:31:02,498 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:31:02,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-08-05 10:31:02,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2019-08-05 10:31:02,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-08-05 10:31:02,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 91 transitions. [2019-08-05 10:31:02,502 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 91 transitions. Word has length 17 [2019-08-05 10:31:02,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:02,502 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 91 transitions. [2019-08-05 10:31:02,502 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:31:02,502 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 91 transitions. [2019-08-05 10:31:02,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:31:02,503 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:02,503 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1] [2019-08-05 10:31:02,503 INFO L418 AbstractCegarLoop]: === Iteration 25 === [TimesVsAddErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:02,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:02,503 INFO L82 PathProgramCache]: Analyzing trace with hash -1170865080, now seen corresponding path program 21 times [2019-08-05 10:31:02,504 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:02,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:02,514 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 36 conjunts are in the unsatisfiable core [2019-08-05 10:31:02,516 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:02,788 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:02,788 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:02,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:31:02,788 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:31:02,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:31:02,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:31:02,789 INFO L87 Difference]: Start difference. First operand 79 states and 91 transitions. Second operand 18 states. [2019-08-05 10:31:03,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:03,215 INFO L93 Difference]: Finished difference Result 93 states and 107 transitions. [2019-08-05 10:31:03,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 10:31:03,216 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2019-08-05 10:31:03,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:03,217 INFO L225 Difference]: With dead ends: 93 [2019-08-05 10:31:03,217 INFO L226 Difference]: Without dead ends: 92 [2019-08-05 10:31:03,218 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=530, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:31:03,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-08-05 10:31:03,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 82. [2019-08-05 10:31:03,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-08-05 10:31:03,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 96 transitions. [2019-08-05 10:31:03,220 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 96 transitions. Word has length 18 [2019-08-05 10:31:03,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:03,220 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 96 transitions. [2019-08-05 10:31:03,221 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:31:03,221 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 96 transitions. [2019-08-05 10:31:03,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:31:03,221 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:03,221 INFO L399 BasicCegarLoop]: trace histogram [6, 3, 3, 2, 1, 1, 1, 1] [2019-08-05 10:31:03,222 INFO L418 AbstractCegarLoop]: === Iteration 26 === [TimesVsAddErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:03,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:03,222 INFO L82 PathProgramCache]: Analyzing trace with hash 823218876, now seen corresponding path program 22 times [2019-08-05 10:31:03,223 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:03,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:03,231 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 32 conjunts are in the unsatisfiable core [2019-08-05 10:31:03,232 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:03,457 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:03,458 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:03,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:31:03,458 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:31:03,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:31:03,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:31:03,459 INFO L87 Difference]: Start difference. First operand 82 states and 96 transitions. Second operand 16 states. [2019-08-05 10:31:03,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:03,765 INFO L93 Difference]: Finished difference Result 91 states and 105 transitions. [2019-08-05 10:31:03,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:31:03,766 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 18 [2019-08-05 10:31:03,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:03,767 INFO L225 Difference]: With dead ends: 91 [2019-08-05 10:31:03,767 INFO L226 Difference]: Without dead ends: 87 [2019-08-05 10:31:03,768 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:31:03,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-08-05 10:31:03,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2019-08-05 10:31:03,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-08-05 10:31:03,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 100 transitions. [2019-08-05 10:31:03,771 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 100 transitions. Word has length 18 [2019-08-05 10:31:03,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:03,771 INFO L475 AbstractCegarLoop]: Abstraction has 86 states and 100 transitions. [2019-08-05 10:31:03,771 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:31:03,771 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 100 transitions. [2019-08-05 10:31:03,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:31:03,772 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:03,772 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1] [2019-08-05 10:31:03,772 INFO L418 AbstractCegarLoop]: === Iteration 27 === [TimesVsAddErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:03,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:03,773 INFO L82 PathProgramCache]: Analyzing trace with hash 689731942, now seen corresponding path program 23 times [2019-08-05 10:31:03,773 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:03,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:03,783 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 10:31:03,784 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:04,209 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 22 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:04,210 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:04,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:31:04,211 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 10:31:04,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 10:31:04,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:31:04,212 INFO L87 Difference]: Start difference. First operand 86 states and 100 transitions. Second operand 17 states. [2019-08-05 10:31:04,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:04,644 INFO L93 Difference]: Finished difference Result 135 states and 146 transitions. [2019-08-05 10:31:04,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:31:04,644 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 19 [2019-08-05 10:31:04,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:04,645 INFO L225 Difference]: With dead ends: 135 [2019-08-05 10:31:04,645 INFO L226 Difference]: Without dead ends: 135 [2019-08-05 10:31:04,646 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=161, Invalid=439, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:31:04,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-08-05 10:31:04,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 95. [2019-08-05 10:31:04,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-08-05 10:31:04,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 111 transitions. [2019-08-05 10:31:04,651 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 111 transitions. Word has length 19 [2019-08-05 10:31:04,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:04,651 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 111 transitions. [2019-08-05 10:31:04,651 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 10:31:04,651 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 111 transitions. [2019-08-05 10:31:04,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:31:04,652 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:04,652 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1] [2019-08-05 10:31:04,652 INFO L418 AbstractCegarLoop]: === Iteration 28 === [TimesVsAddErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:04,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:04,652 INFO L82 PathProgramCache]: Analyzing trace with hash -1937081046, now seen corresponding path program 24 times [2019-08-05 10:31:04,653 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:04,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:04,661 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 10:31:04,662 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:04,792 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 29 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:04,792 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:04,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:31:04,792 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 10:31:04,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 10:31:04,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:31:04,793 INFO L87 Difference]: Start difference. First operand 95 states and 111 transitions. Second operand 17 states. [2019-08-05 10:31:05,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:05,435 INFO L93 Difference]: Finished difference Result 135 states and 143 transitions. [2019-08-05 10:31:05,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-05 10:31:05,436 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 19 [2019-08-05 10:31:05,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:05,437 INFO L225 Difference]: With dead ends: 135 [2019-08-05 10:31:05,437 INFO L226 Difference]: Without dead ends: 128 [2019-08-05 10:31:05,439 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 434 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=575, Invalid=1317, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:31:05,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-08-05 10:31:05,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 96. [2019-08-05 10:31:05,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-08-05 10:31:05,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 110 transitions. [2019-08-05 10:31:05,441 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 110 transitions. Word has length 19 [2019-08-05 10:31:05,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:05,442 INFO L475 AbstractCegarLoop]: Abstraction has 96 states and 110 transitions. [2019-08-05 10:31:05,442 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 10:31:05,442 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 110 transitions. [2019-08-05 10:31:05,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:31:05,442 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:05,443 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1] [2019-08-05 10:31:05,443 INFO L418 AbstractCegarLoop]: === Iteration 29 === [TimesVsAddErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:05,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:05,443 INFO L82 PathProgramCache]: Analyzing trace with hash -93148212, now seen corresponding path program 25 times [2019-08-05 10:31:05,444 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:05,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:05,454 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 40 conjunts are in the unsatisfiable core [2019-08-05 10:31:05,455 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:06,008 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:06,008 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:06,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:31:06,008 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:31:06,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:31:06,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=341, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:31:06,009 INFO L87 Difference]: Start difference. First operand 96 states and 110 transitions. Second operand 20 states. [2019-08-05 10:31:06,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:06,792 INFO L93 Difference]: Finished difference Result 111 states and 127 transitions. [2019-08-05 10:31:06,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 10:31:06,792 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2019-08-05 10:31:06,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:06,793 INFO L225 Difference]: With dead ends: 111 [2019-08-05 10:31:06,793 INFO L226 Difference]: Without dead ends: 110 [2019-08-05 10:31:06,794 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=79, Invalid=677, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:31:06,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-08-05 10:31:06,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 99. [2019-08-05 10:31:06,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-08-05 10:31:06,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 115 transitions. [2019-08-05 10:31:06,796 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 115 transitions. Word has length 20 [2019-08-05 10:31:06,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:06,797 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 115 transitions. [2019-08-05 10:31:06,797 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:31:06,797 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 115 transitions. [2019-08-05 10:31:06,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:31:06,798 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:06,798 INFO L399 BasicCegarLoop]: trace histogram [8, 4, 2, 2, 1, 1, 1, 1] [2019-08-05 10:31:06,798 INFO L418 AbstractCegarLoop]: === Iteration 30 === [TimesVsAddErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:06,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:06,799 INFO L82 PathProgramCache]: Analyzing trace with hash 607094978, now seen corresponding path program 26 times [2019-08-05 10:31:06,799 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:06,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:06,808 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 38 conjunts are in the unsatisfiable core [2019-08-05 10:31:06,810 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:07,386 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:07,387 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:07,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:31:07,387 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:31:07,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:31:07,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=305, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:31:07,388 INFO L87 Difference]: Start difference. First operand 99 states and 115 transitions. Second operand 19 states. [2019-08-05 10:31:07,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:07,820 INFO L93 Difference]: Finished difference Result 112 states and 128 transitions. [2019-08-05 10:31:07,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:31:07,821 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 20 [2019-08-05 10:31:07,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:07,822 INFO L225 Difference]: With dead ends: 112 [2019-08-05 10:31:07,822 INFO L226 Difference]: Without dead ends: 106 [2019-08-05 10:31:07,823 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=57, Invalid=495, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:31:07,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-08-05 10:31:07,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2019-08-05 10:31:07,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-08-05 10:31:07,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 121 transitions. [2019-08-05 10:31:07,826 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 121 transitions. Word has length 20 [2019-08-05 10:31:07,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:07,827 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 121 transitions. [2019-08-05 10:31:07,827 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:31:07,827 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 121 transitions. [2019-08-05 10:31:07,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:31:07,827 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:07,828 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1] [2019-08-05 10:31:07,828 INFO L418 AbstractCegarLoop]: === Iteration 31 === [TimesVsAddErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:07,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:07,828 INFO L82 PathProgramCache]: Analyzing trace with hash -491753268, now seen corresponding path program 27 times [2019-08-05 10:31:07,829 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:07,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:07,835 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 32 conjunts are in the unsatisfiable core [2019-08-05 10:31:07,836 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:08,015 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:08,015 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:08,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:31:08,015 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:31:08,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:31:08,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:31:08,016 INFO L87 Difference]: Start difference. First operand 105 states and 121 transitions. Second operand 16 states. [2019-08-05 10:31:08,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:08,314 INFO L93 Difference]: Finished difference Result 112 states and 128 transitions. [2019-08-05 10:31:08,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:31:08,314 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 20 [2019-08-05 10:31:08,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:08,315 INFO L225 Difference]: With dead ends: 112 [2019-08-05 10:31:08,315 INFO L226 Difference]: Without dead ends: 109 [2019-08-05 10:31:08,316 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:31:08,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-08-05 10:31:08,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 108. [2019-08-05 10:31:08,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-08-05 10:31:08,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 124 transitions. [2019-08-05 10:31:08,322 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 124 transitions. Word has length 20 [2019-08-05 10:31:08,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:08,322 INFO L475 AbstractCegarLoop]: Abstraction has 108 states and 124 transitions. [2019-08-05 10:31:08,322 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:31:08,322 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 124 transitions. [2019-08-05 10:31:08,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:31:08,323 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:08,323 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1] [2019-08-05 10:31:08,323 INFO L418 AbstractCegarLoop]: === Iteration 32 === [TimesVsAddErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:08,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:08,324 INFO L82 PathProgramCache]: Analyzing trace with hash 1234194794, now seen corresponding path program 28 times [2019-08-05 10:31:08,324 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:08,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:08,337 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 10:31:08,339 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:08,526 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 29 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:08,526 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:08,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:31:08,526 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:31:08,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:31:08,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:31:08,527 INFO L87 Difference]: Start difference. First operand 108 states and 124 transitions. Second operand 19 states. [2019-08-05 10:31:08,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:08,987 INFO L93 Difference]: Finished difference Result 168 states and 180 transitions. [2019-08-05 10:31:08,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:31:08,988 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 21 [2019-08-05 10:31:08,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:08,989 INFO L225 Difference]: With dead ends: 168 [2019-08-05 10:31:08,989 INFO L226 Difference]: Without dead ends: 168 [2019-08-05 10:31:08,990 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=199, Invalid=557, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:31:08,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-08-05 10:31:08,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 118. [2019-08-05 10:31:08,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-08-05 10:31:08,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 136 transitions. [2019-08-05 10:31:08,993 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 136 transitions. Word has length 21 [2019-08-05 10:31:08,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:08,993 INFO L475 AbstractCegarLoop]: Abstraction has 118 states and 136 transitions. [2019-08-05 10:31:08,993 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:31:08,994 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 136 transitions. [2019-08-05 10:31:08,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:31:08,994 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:08,994 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1] [2019-08-05 10:31:08,994 INFO L418 AbstractCegarLoop]: === Iteration 33 === [TimesVsAddErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:08,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:08,995 INFO L82 PathProgramCache]: Analyzing trace with hash 1407370790, now seen corresponding path program 29 times [2019-08-05 10:31:08,996 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:09,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:09,004 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 10:31:09,005 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:09,179 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 37 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:09,180 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:09,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:31:09,180 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:31:09,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:31:09,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:31:09,181 INFO L87 Difference]: Start difference. First operand 118 states and 136 transitions. Second operand 19 states. [2019-08-05 10:31:10,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:10,048 INFO L93 Difference]: Finished difference Result 168 states and 177 transitions. [2019-08-05 10:31:10,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-05 10:31:10,048 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 21 [2019-08-05 10:31:10,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:10,049 INFO L225 Difference]: With dead ends: 168 [2019-08-05 10:31:10,050 INFO L226 Difference]: Without dead ends: 160 [2019-08-05 10:31:10,052 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 714 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=847, Invalid=2015, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:31:10,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-08-05 10:31:10,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 119. [2019-08-05 10:31:10,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-08-05 10:31:10,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 135 transitions. [2019-08-05 10:31:10,054 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 135 transitions. Word has length 21 [2019-08-05 10:31:10,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:10,054 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 135 transitions. [2019-08-05 10:31:10,054 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:31:10,055 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 135 transitions. [2019-08-05 10:31:10,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:31:10,055 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:10,055 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1] [2019-08-05 10:31:10,055 INFO L418 AbstractCegarLoop]: === Iteration 34 === [TimesVsAddErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:10,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:10,056 INFO L82 PathProgramCache]: Analyzing trace with hash -394668984, now seen corresponding path program 30 times [2019-08-05 10:31:10,056 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:10,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:10,066 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 44 conjunts are in the unsatisfiable core [2019-08-05 10:31:10,067 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:10,435 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 73 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:10,436 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:10,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:31:10,436 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:31:10,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:31:10,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=419, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:31:10,436 INFO L87 Difference]: Start difference. First operand 119 states and 135 transitions. Second operand 22 states. [2019-08-05 10:31:11,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:11,301 INFO L93 Difference]: Finished difference Result 135 states and 153 transitions. [2019-08-05 10:31:11,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:31:11,302 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2019-08-05 10:31:11,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:11,303 INFO L225 Difference]: With dead ends: 135 [2019-08-05 10:31:11,303 INFO L226 Difference]: Without dead ends: 134 [2019-08-05 10:31:11,304 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=88, Invalid=842, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:31:11,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-08-05 10:31:11,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 122. [2019-08-05 10:31:11,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-08-05 10:31:11,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 140 transitions. [2019-08-05 10:31:11,307 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 140 transitions. Word has length 22 [2019-08-05 10:31:11,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:11,307 INFO L475 AbstractCegarLoop]: Abstraction has 122 states and 140 transitions. [2019-08-05 10:31:11,307 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:31:11,307 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 140 transitions. [2019-08-05 10:31:11,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:31:11,308 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:11,308 INFO L399 BasicCegarLoop]: trace histogram [9, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 10:31:11,308 INFO L418 AbstractCegarLoop]: === Iteration 35 === [TimesVsAddErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:11,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:11,308 INFO L82 PathProgramCache]: Analyzing trace with hash -1800448820, now seen corresponding path program 31 times [2019-08-05 10:31:11,309 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:11,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:11,317 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 40 conjunts are in the unsatisfiable core [2019-08-05 10:31:11,318 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:12,208 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:12,208 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:12,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:31:12,208 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:31:12,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:31:12,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=341, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:31:12,209 INFO L87 Difference]: Start difference. First operand 122 states and 140 transitions. Second operand 20 states. [2019-08-05 10:31:12,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:12,659 INFO L93 Difference]: Finished difference Result 133 states and 151 transitions. [2019-08-05 10:31:12,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 10:31:12,660 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 22 [2019-08-05 10:31:12,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:12,661 INFO L225 Difference]: With dead ends: 133 [2019-08-05 10:31:12,661 INFO L226 Difference]: Without dead ends: 128 [2019-08-05 10:31:12,662 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=55, Invalid=497, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:31:12,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-08-05 10:31:12,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 127. [2019-08-05 10:31:12,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-08-05 10:31:12,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 145 transitions. [2019-08-05 10:31:12,666 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 145 transitions. Word has length 22 [2019-08-05 10:31:12,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:12,666 INFO L475 AbstractCegarLoop]: Abstraction has 127 states and 145 transitions. [2019-08-05 10:31:12,666 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:31:12,666 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 145 transitions. [2019-08-05 10:31:12,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:31:12,667 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:12,667 INFO L399 BasicCegarLoop]: trace histogram [8, 4, 4, 2, 1, 1, 1, 1] [2019-08-05 10:31:12,667 INFO L418 AbstractCegarLoop]: === Iteration 36 === [TimesVsAddErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:12,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:12,668 INFO L82 PathProgramCache]: Analyzing trace with hash 940635766, now seen corresponding path program 32 times [2019-08-05 10:31:12,668 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:12,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:12,676 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 38 conjunts are in the unsatisfiable core [2019-08-05 10:31:12,677 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:12,911 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 79 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:12,911 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:12,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:31:12,911 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:31:12,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:31:12,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=305, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:31:12,912 INFO L87 Difference]: Start difference. First operand 127 states and 145 transitions. Second operand 19 states. [2019-08-05 10:31:13,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:13,348 INFO L93 Difference]: Finished difference Result 136 states and 154 transitions. [2019-08-05 10:31:13,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:31:13,349 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 22 [2019-08-05 10:31:13,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:13,350 INFO L225 Difference]: With dead ends: 136 [2019-08-05 10:31:13,350 INFO L226 Difference]: Without dead ends: 132 [2019-08-05 10:31:13,350 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=413, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:31:13,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-08-05 10:31:13,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 131. [2019-08-05 10:31:13,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-08-05 10:31:13,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 149 transitions. [2019-08-05 10:31:13,354 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 149 transitions. Word has length 22 [2019-08-05 10:31:13,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:13,354 INFO L475 AbstractCegarLoop]: Abstraction has 131 states and 149 transitions. [2019-08-05 10:31:13,354 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:31:13,354 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 149 transitions. [2019-08-05 10:31:13,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:31:13,355 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:13,355 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1, 1, 1, 1] [2019-08-05 10:31:13,355 INFO L418 AbstractCegarLoop]: === Iteration 37 === [TimesVsAddErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:13,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:13,356 INFO L82 PathProgramCache]: Analyzing trace with hash -423327130, now seen corresponding path program 33 times [2019-08-05 10:31:13,356 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:13,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:13,365 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 10:31:13,366 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:13,523 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 37 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:13,523 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:13,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:31:13,523 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:31:13,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:31:13,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:31:13,524 INFO L87 Difference]: Start difference. First operand 131 states and 149 transitions. Second operand 21 states. [2019-08-05 10:31:13,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:13,895 INFO L93 Difference]: Finished difference Result 203 states and 216 transitions. [2019-08-05 10:31:13,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:31:13,895 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 23 [2019-08-05 10:31:13,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:13,897 INFO L225 Difference]: With dead ends: 203 [2019-08-05 10:31:13,897 INFO L226 Difference]: Without dead ends: 203 [2019-08-05 10:31:13,898 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=241, Invalid=689, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:31:13,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-08-05 10:31:13,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 142. [2019-08-05 10:31:13,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-08-05 10:31:13,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 162 transitions. [2019-08-05 10:31:13,902 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 162 transitions. Word has length 23 [2019-08-05 10:31:13,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:13,902 INFO L475 AbstractCegarLoop]: Abstraction has 142 states and 162 transitions. [2019-08-05 10:31:13,902 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:31:13,903 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 162 transitions. [2019-08-05 10:31:13,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:31:13,903 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:13,903 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1, 1, 1, 1] [2019-08-05 10:31:13,904 INFO L418 AbstractCegarLoop]: === Iteration 38 === [TimesVsAddErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:13,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:13,904 INFO L82 PathProgramCache]: Analyzing trace with hash 650161450, now seen corresponding path program 34 times [2019-08-05 10:31:13,905 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:13,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:13,913 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 10:31:13,914 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:14,094 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 46 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:14,094 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:14,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:31:14,094 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:31:14,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:31:14,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:31:14,095 INFO L87 Difference]: Start difference. First operand 142 states and 162 transitions. Second operand 21 states. [2019-08-05 10:31:14,838 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 7 [2019-08-05 10:31:15,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:15,416 INFO L93 Difference]: Finished difference Result 203 states and 213 transitions. [2019-08-05 10:31:15,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-08-05 10:31:15,417 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 23 [2019-08-05 10:31:15,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:15,418 INFO L225 Difference]: With dead ends: 203 [2019-08-05 10:31:15,418 INFO L226 Difference]: Without dead ends: 194 [2019-08-05 10:31:15,421 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1110 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1201, Invalid=2959, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 10:31:15,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-08-05 10:31:15,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 143. [2019-08-05 10:31:15,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-08-05 10:31:15,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 161 transitions. [2019-08-05 10:31:15,424 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 161 transitions. Word has length 23 [2019-08-05 10:31:15,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:15,424 INFO L475 AbstractCegarLoop]: Abstraction has 143 states and 161 transitions. [2019-08-05 10:31:15,425 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:31:15,425 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 161 transitions. [2019-08-05 10:31:15,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:31:15,425 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:15,425 INFO L399 BasicCegarLoop]: trace histogram [10, 5, 2, 2, 1, 1, 1, 1] [2019-08-05 10:31:15,426 INFO L418 AbstractCegarLoop]: === Iteration 39 === [TimesVsAddErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:15,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:15,426 INFO L82 PathProgramCache]: Analyzing trace with hash 605663460, now seen corresponding path program 35 times [2019-08-05 10:31:15,426 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:15,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:15,435 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 44 conjunts are in the unsatisfiable core [2019-08-05 10:31:15,436 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:15,822 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:15,822 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:15,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:31:15,822 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:31:15,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:31:15,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=419, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:31:15,823 INFO L87 Difference]: Start difference. First operand 143 states and 161 transitions. Second operand 22 states. [2019-08-05 10:31:16,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:16,857 INFO L93 Difference]: Finished difference Result 158 states and 176 transitions. [2019-08-05 10:31:16,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:31:16,857 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 23 [2019-08-05 10:31:16,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:16,858 INFO L225 Difference]: With dead ends: 158 [2019-08-05 10:31:16,858 INFO L226 Difference]: Without dead ends: 151 [2019-08-05 10:31:16,859 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=67, Invalid=689, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:31:16,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-08-05 10:31:16,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 150. [2019-08-05 10:31:16,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-08-05 10:31:16,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 168 transitions. [2019-08-05 10:31:16,863 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 168 transitions. Word has length 23 [2019-08-05 10:31:16,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:16,863 INFO L475 AbstractCegarLoop]: Abstraction has 150 states and 168 transitions. [2019-08-05 10:31:16,863 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:31:16,863 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 168 transitions. [2019-08-05 10:31:16,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:31:16,864 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:16,864 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1] [2019-08-05 10:31:16,864 INFO L418 AbstractCegarLoop]: === Iteration 40 === [TimesVsAddErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:16,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:16,865 INFO L82 PathProgramCache]: Analyzing trace with hash 1565130852, now seen corresponding path program 36 times [2019-08-05 10:31:16,865 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:16,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:16,871 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 36 conjunts are in the unsatisfiable core [2019-08-05 10:31:16,872 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:17,294 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 88 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:17,294 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:17,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:31:17,295 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:31:17,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:31:17,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:31:17,296 INFO L87 Difference]: Start difference. First operand 150 states and 168 transitions. Second operand 18 states. [2019-08-05 10:31:17,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:17,613 INFO L93 Difference]: Finished difference Result 157 states and 175 transitions. [2019-08-05 10:31:17,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 10:31:17,613 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 23 [2019-08-05 10:31:17,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:17,614 INFO L225 Difference]: With dead ends: 157 [2019-08-05 10:31:17,614 INFO L226 Difference]: Without dead ends: 154 [2019-08-05 10:31:17,615 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=43, Invalid=337, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:31:17,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-08-05 10:31:17,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 153. [2019-08-05 10:31:17,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-08-05 10:31:17,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 171 transitions. [2019-08-05 10:31:17,619 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 171 transitions. Word has length 23 [2019-08-05 10:31:17,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:17,619 INFO L475 AbstractCegarLoop]: Abstraction has 153 states and 171 transitions. [2019-08-05 10:31:17,619 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:31:17,619 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 171 transitions. [2019-08-05 10:31:17,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:31:17,620 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:17,620 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1] [2019-08-05 10:31:17,620 INFO L418 AbstractCegarLoop]: === Iteration 41 === [TimesVsAddErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:17,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:17,621 INFO L82 PathProgramCache]: Analyzing trace with hash -238241076, now seen corresponding path program 37 times [2019-08-05 10:31:17,621 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:17,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:17,632 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 48 conjunts are in the unsatisfiable core [2019-08-05 10:31:17,633 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:18,642 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:18,642 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:18,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:31:18,643 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:31:18,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:31:18,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=505, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:31:18,643 INFO L87 Difference]: Start difference. First operand 153 states and 171 transitions. Second operand 24 states. [2019-08-05 10:31:20,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:20,654 INFO L93 Difference]: Finished difference Result 170 states and 190 transitions. [2019-08-05 10:31:20,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 10:31:20,655 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2019-08-05 10:31:20,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:20,656 INFO L225 Difference]: With dead ends: 170 [2019-08-05 10:31:20,656 INFO L226 Difference]: Without dead ends: 169 [2019-08-05 10:31:20,657 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=97, Invalid=1025, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:31:20,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-08-05 10:31:20,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 156. [2019-08-05 10:31:20,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-08-05 10:31:20,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 176 transitions. [2019-08-05 10:31:20,661 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 176 transitions. Word has length 24 [2019-08-05 10:31:20,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:20,661 INFO L475 AbstractCegarLoop]: Abstraction has 156 states and 176 transitions. [2019-08-05 10:31:20,661 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:31:20,661 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 176 transitions. [2019-08-05 10:31:20,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:31:20,662 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:20,662 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1, 1, 1, 1] [2019-08-05 10:31:20,662 INFO L418 AbstractCegarLoop]: === Iteration 42 === [TimesVsAddErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:20,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:20,663 INFO L82 PathProgramCache]: Analyzing trace with hash -2008915606, now seen corresponding path program 38 times [2019-08-05 10:31:20,663 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:20,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:20,673 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 10:31:20,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:21,339 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 46 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:21,339 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:21,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 10:31:21,340 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:31:21,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:31:21,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=373, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:31:21,340 INFO L87 Difference]: Start difference. First operand 156 states and 176 transitions. Second operand 23 states. [2019-08-05 10:31:21,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:21,974 INFO L93 Difference]: Finished difference Result 241 states and 255 transitions. [2019-08-05 10:31:21,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 10:31:21,974 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 25 [2019-08-05 10:31:21,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:21,975 INFO L225 Difference]: With dead ends: 241 [2019-08-05 10:31:21,975 INFO L226 Difference]: Without dead ends: 241 [2019-08-05 10:31:21,976 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=287, Invalid=835, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:31:21,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2019-08-05 10:31:21,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 168. [2019-08-05 10:31:21,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-08-05 10:31:21,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 190 transitions. [2019-08-05 10:31:21,979 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 190 transitions. Word has length 25 [2019-08-05 10:31:21,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:21,980 INFO L475 AbstractCegarLoop]: Abstraction has 168 states and 190 transitions. [2019-08-05 10:31:21,980 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:31:21,980 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 190 transitions. [2019-08-05 10:31:21,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:31:21,980 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:21,980 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1, 1, 1, 1] [2019-08-05 10:31:21,981 INFO L418 AbstractCegarLoop]: === Iteration 43 === [TimesVsAddErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:21,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:21,981 INFO L82 PathProgramCache]: Analyzing trace with hash 1204459302, now seen corresponding path program 39 times [2019-08-05 10:31:21,982 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:21,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:21,991 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 10:31:21,992 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:22,227 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 56 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:22,227 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:22,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 10:31:22,228 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:31:22,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:31:22,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=373, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:31:22,228 INFO L87 Difference]: Start difference. First operand 168 states and 190 transitions. Second operand 23 states. [2019-08-05 10:31:22,734 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 8 [2019-08-05 10:31:23,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:23,978 INFO L93 Difference]: Finished difference Result 241 states and 252 transitions. [2019-08-05 10:31:23,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-08-05 10:31:23,979 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 25 [2019-08-05 10:31:23,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:23,980 INFO L225 Difference]: With dead ends: 241 [2019-08-05 10:31:23,980 INFO L226 Difference]: Without dead ends: 231 [2019-08-05 10:31:23,983 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1650 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1651, Invalid=4201, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 10:31:23,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2019-08-05 10:31:23,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 169. [2019-08-05 10:31:23,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-08-05 10:31:23,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 189 transitions. [2019-08-05 10:31:23,986 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 189 transitions. Word has length 25 [2019-08-05 10:31:23,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:23,986 INFO L475 AbstractCegarLoop]: Abstraction has 169 states and 189 transitions. [2019-08-05 10:31:23,986 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:31:23,986 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 189 transitions. [2019-08-05 10:31:23,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 10:31:23,987 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:23,987 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1] [2019-08-05 10:31:23,987 INFO L418 AbstractCegarLoop]: === Iteration 44 === [TimesVsAddErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:23,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:23,988 INFO L82 PathProgramCache]: Analyzing trace with hash -2146843576, now seen corresponding path program 40 times [2019-08-05 10:31:23,988 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:23,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:23,999 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 52 conjunts are in the unsatisfiable core [2019-08-05 10:31:24,000 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:24,525 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 111 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:24,526 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:24,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 10:31:24,526 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 10:31:24,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 10:31:24,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=599, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:31:24,527 INFO L87 Difference]: Start difference. First operand 169 states and 189 transitions. Second operand 26 states. [2019-08-05 10:31:25,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:25,423 INFO L93 Difference]: Finished difference Result 187 states and 209 transitions. [2019-08-05 10:31:25,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:31:25,424 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2019-08-05 10:31:25,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:25,425 INFO L225 Difference]: With dead ends: 187 [2019-08-05 10:31:25,425 INFO L226 Difference]: Without dead ends: 186 [2019-08-05 10:31:25,426 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=106, Invalid=1226, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:31:25,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-08-05 10:31:25,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 172. [2019-08-05 10:31:25,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-08-05 10:31:25,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 194 transitions. [2019-08-05 10:31:25,429 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 194 transitions. Word has length 26 [2019-08-05 10:31:25,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:25,429 INFO L475 AbstractCegarLoop]: Abstraction has 172 states and 194 transitions. [2019-08-05 10:31:25,430 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 10:31:25,430 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 194 transitions. [2019-08-05 10:31:25,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 10:31:25,430 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:25,430 INFO L399 BasicCegarLoop]: trace histogram [12, 6, 2, 2, 1, 1, 1, 1] [2019-08-05 10:31:25,431 INFO L418 AbstractCegarLoop]: === Iteration 45 === [TimesVsAddErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:25,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:25,431 INFO L82 PathProgramCache]: Analyzing trace with hash 1497448322, now seen corresponding path program 41 times [2019-08-05 10:31:25,431 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:25,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:25,440 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 50 conjunts are in the unsatisfiable core [2019-08-05 10:31:25,441 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:25,850 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 115 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:25,850 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:25,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 10:31:25,851 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 10:31:25,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 10:31:25,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=551, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:31:25,852 INFO L87 Difference]: Start difference. First operand 172 states and 194 transitions. Second operand 25 states. [2019-08-05 10:31:26,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:26,796 INFO L93 Difference]: Finished difference Result 189 states and 211 transitions. [2019-08-05 10:31:26,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:31:26,796 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 26 [2019-08-05 10:31:26,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:26,797 INFO L225 Difference]: With dead ends: 189 [2019-08-05 10:31:26,797 INFO L226 Difference]: Without dead ends: 181 [2019-08-05 10:31:26,798 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=77, Invalid=915, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:31:26,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-08-05 10:31:26,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 180. [2019-08-05 10:31:26,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-08-05 10:31:26,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 202 transitions. [2019-08-05 10:31:26,802 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 202 transitions. Word has length 26 [2019-08-05 10:31:26,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:26,802 INFO L475 AbstractCegarLoop]: Abstraction has 180 states and 202 transitions. [2019-08-05 10:31:26,802 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 10:31:26,803 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 202 transitions. [2019-08-05 10:31:26,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 10:31:26,803 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:26,803 INFO L399 BasicCegarLoop]: trace histogram [12, 4, 3, 3, 1, 1, 1, 1] [2019-08-05 10:31:26,803 INFO L418 AbstractCegarLoop]: === Iteration 46 === [TimesVsAddErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:26,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:26,804 INFO L82 PathProgramCache]: Analyzing trace with hash 948566460, now seen corresponding path program 42 times [2019-08-05 10:31:26,804 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:26,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:26,813 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 48 conjunts are in the unsatisfiable core [2019-08-05 10:31:26,813 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:27,177 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:27,177 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:27,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:31:27,177 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:31:27,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:31:27,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=505, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:31:27,178 INFO L87 Difference]: Start difference. First operand 180 states and 202 transitions. Second operand 24 states. [2019-08-05 10:31:27,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:27,819 INFO L93 Difference]: Finished difference Result 193 states and 215 transitions. [2019-08-05 10:31:27,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 10:31:27,820 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 26 [2019-08-05 10:31:27,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:27,821 INFO L225 Difference]: With dead ends: 193 [2019-08-05 10:31:27,821 INFO L226 Difference]: Without dead ends: 187 [2019-08-05 10:31:27,821 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=67, Invalid=745, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:31:27,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-08-05 10:31:27,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 186. [2019-08-05 10:31:27,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-08-05 10:31:27,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 208 transitions. [2019-08-05 10:31:27,824 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 208 transitions. Word has length 26 [2019-08-05 10:31:27,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:27,825 INFO L475 AbstractCegarLoop]: Abstraction has 186 states and 208 transitions. [2019-08-05 10:31:27,825 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:31:27,825 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 208 transitions. [2019-08-05 10:31:27,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 10:31:27,826 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:27,826 INFO L399 BasicCegarLoop]: trace histogram [10, 5, 5, 2, 1, 1, 1, 1] [2019-08-05 10:31:27,826 INFO L418 AbstractCegarLoop]: === Iteration 47 === [TimesVsAddErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:27,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:27,826 INFO L82 PathProgramCache]: Analyzing trace with hash -1429983952, now seen corresponding path program 43 times [2019-08-05 10:31:27,827 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:27,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:27,834 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 44 conjunts are in the unsatisfiable core [2019-08-05 10:31:27,835 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:28,313 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 123 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:28,314 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:28,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:31:28,314 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:31:28,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:31:28,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=419, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:31:28,315 INFO L87 Difference]: Start difference. First operand 186 states and 208 transitions. Second operand 22 states. [2019-08-05 10:31:28,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:28,890 INFO L93 Difference]: Finished difference Result 195 states and 217 transitions. [2019-08-05 10:31:28,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:31:28,890 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 26 [2019-08-05 10:31:28,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:28,892 INFO L225 Difference]: With dead ends: 195 [2019-08-05 10:31:28,892 INFO L226 Difference]: Without dead ends: 191 [2019-08-05 10:31:28,893 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=55, Invalid=545, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:31:28,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-08-05 10:31:28,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 190. [2019-08-05 10:31:28,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-08-05 10:31:28,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 212 transitions. [2019-08-05 10:31:28,895 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 212 transitions. Word has length 26 [2019-08-05 10:31:28,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:28,896 INFO L475 AbstractCegarLoop]: Abstraction has 190 states and 212 transitions. [2019-08-05 10:31:28,896 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:31:28,896 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 212 transitions. [2019-08-05 10:31:28,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 10:31:28,896 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:28,896 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1] [2019-08-05 10:31:28,897 INFO L418 AbstractCegarLoop]: === Iteration 48 === [TimesVsAddErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:28,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:28,897 INFO L82 PathProgramCache]: Analyzing trace with hash 1901537740, now seen corresponding path program 44 times [2019-08-05 10:31:28,897 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:28,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:28,904 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 40 conjunts are in the unsatisfiable core [2019-08-05 10:31:28,905 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:29,198 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:29,199 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:29,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:31:29,199 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:31:29,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:31:29,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=341, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:31:29,200 INFO L87 Difference]: Start difference. First operand 190 states and 212 transitions. Second operand 20 states. [2019-08-05 10:31:29,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:29,610 INFO L93 Difference]: Finished difference Result 197 states and 219 transitions. [2019-08-05 10:31:29,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 10:31:29,610 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 26 [2019-08-05 10:31:29,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:29,612 INFO L225 Difference]: With dead ends: 197 [2019-08-05 10:31:29,612 INFO L226 Difference]: Without dead ends: 194 [2019-08-05 10:31:29,613 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=415, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:31:29,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-08-05 10:31:29,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 193. [2019-08-05 10:31:29,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-08-05 10:31:29,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 215 transitions. [2019-08-05 10:31:29,616 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 215 transitions. Word has length 26 [2019-08-05 10:31:29,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:29,617 INFO L475 AbstractCegarLoop]: Abstraction has 193 states and 215 transitions. [2019-08-05 10:31:29,617 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:31:29,617 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 215 transitions. [2019-08-05 10:31:29,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:31:29,618 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:29,618 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1] [2019-08-05 10:31:29,618 INFO L418 AbstractCegarLoop]: === Iteration 49 === [TimesVsAddErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:29,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:29,618 INFO L82 PathProgramCache]: Analyzing trace with hash 1336949606, now seen corresponding path program 45 times [2019-08-05 10:31:29,619 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:29,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:29,628 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 24 conjunts are in the unsatisfiable core [2019-08-05 10:31:29,629 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:30,124 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 56 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:30,125 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:30,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 10:31:30,125 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 10:31:30,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 10:31:30,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=443, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:31:30,126 INFO L87 Difference]: Start difference. First operand 193 states and 215 transitions. Second operand 25 states. [2019-08-05 10:31:30,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:30,713 INFO L93 Difference]: Finished difference Result 292 states and 307 transitions. [2019-08-05 10:31:30,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:31:30,713 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 27 [2019-08-05 10:31:30,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:30,715 INFO L225 Difference]: With dead ends: 292 [2019-08-05 10:31:30,715 INFO L226 Difference]: Without dead ends: 292 [2019-08-05 10:31:30,716 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=337, Invalid=995, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:31:30,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2019-08-05 10:31:30,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 206. [2019-08-05 10:31:30,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-08-05 10:31:30,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 230 transitions. [2019-08-05 10:31:30,720 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 230 transitions. Word has length 27 [2019-08-05 10:31:30,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:30,720 INFO L475 AbstractCegarLoop]: Abstraction has 206 states and 230 transitions. [2019-08-05 10:31:30,720 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 10:31:30,720 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 230 transitions. [2019-08-05 10:31:30,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:31:30,721 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:30,721 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1] [2019-08-05 10:31:30,721 INFO L418 AbstractCegarLoop]: === Iteration 50 === [TimesVsAddErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:30,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:30,722 INFO L82 PathProgramCache]: Analyzing trace with hash -2127643350, now seen corresponding path program 46 times [2019-08-05 10:31:30,722 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:30,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:30,731 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 24 conjunts are in the unsatisfiable core [2019-08-05 10:31:30,732 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:30,959 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 67 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:30,960 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:30,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 10:31:30,960 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 10:31:30,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 10:31:30,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=443, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:31:30,961 INFO L87 Difference]: Start difference. First operand 206 states and 230 transitions. Second operand 25 states. [2019-08-05 10:31:32,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:32,920 INFO L93 Difference]: Finished difference Result 292 states and 304 transitions. [2019-08-05 10:31:32,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-08-05 10:31:32,921 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 27 [2019-08-05 10:31:32,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:32,923 INFO L225 Difference]: With dead ends: 292 [2019-08-05 10:31:32,923 INFO L226 Difference]: Without dead ends: 281 [2019-08-05 10:31:32,925 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2365 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2212, Invalid=5798, Unknown=0, NotChecked=0, Total=8010 [2019-08-05 10:31:32,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-08-05 10:31:32,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 207. [2019-08-05 10:31:32,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2019-08-05 10:31:32,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 229 transitions. [2019-08-05 10:31:32,929 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 229 transitions. Word has length 27 [2019-08-05 10:31:32,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:32,929 INFO L475 AbstractCegarLoop]: Abstraction has 207 states and 229 transitions. [2019-08-05 10:31:32,929 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 10:31:32,929 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 229 transitions. [2019-08-05 10:31:32,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:31:32,930 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:32,930 INFO L399 BasicCegarLoop]: trace histogram [12, 4, 4, 3, 1, 1, 1, 1] [2019-08-05 10:31:32,930 INFO L418 AbstractCegarLoop]: === Iteration 51 === [TimesVsAddErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:32,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:32,931 INFO L82 PathProgramCache]: Analyzing trace with hash -687275356, now seen corresponding path program 47 times [2019-08-05 10:31:32,931 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:32,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:32,939 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 48 conjunts are in the unsatisfiable core [2019-08-05 10:31:32,940 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:33,324 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:33,324 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:33,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:31:33,325 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:31:33,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:31:33,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=505, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:31:33,325 INFO L87 Difference]: Start difference. First operand 207 states and 229 transitions. Second operand 24 states. [2019-08-05 10:31:33,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:33,946 INFO L93 Difference]: Finished difference Result 218 states and 240 transitions. [2019-08-05 10:31:33,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 10:31:33,946 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 27 [2019-08-05 10:31:33,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:33,948 INFO L225 Difference]: With dead ends: 218 [2019-08-05 10:31:33,948 INFO L226 Difference]: Without dead ends: 213 [2019-08-05 10:31:33,949 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=63, Invalid=693, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:31:33,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-08-05 10:31:33,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 212. [2019-08-05 10:31:33,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-08-05 10:31:33,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 234 transitions. [2019-08-05 10:31:33,952 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 234 transitions. Word has length 27 [2019-08-05 10:31:33,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:33,952 INFO L475 AbstractCegarLoop]: Abstraction has 212 states and 234 transitions. [2019-08-05 10:31:33,953 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:31:33,953 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 234 transitions. [2019-08-05 10:31:33,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 10:31:33,953 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:33,954 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1] [2019-08-05 10:31:33,954 INFO L418 AbstractCegarLoop]: === Iteration 52 === [TimesVsAddErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:33,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:33,954 INFO L82 PathProgramCache]: Analyzing trace with hash -1504237108, now seen corresponding path program 48 times [2019-08-05 10:31:33,955 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:33,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:33,966 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 56 conjunts are in the unsatisfiable core [2019-08-05 10:31:33,967 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:34,690 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:34,691 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:34,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 10:31:34,691 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 10:31:34,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 10:31:34,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=701, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:31:34,692 INFO L87 Difference]: Start difference. First operand 212 states and 234 transitions. Second operand 28 states. [2019-08-05 10:31:35,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:35,747 INFO L93 Difference]: Finished difference Result 231 states and 255 transitions. [2019-08-05 10:31:35,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 10:31:35,748 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 28 [2019-08-05 10:31:35,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:35,749 INFO L225 Difference]: With dead ends: 231 [2019-08-05 10:31:35,749 INFO L226 Difference]: Without dead ends: 230 [2019-08-05 10:31:35,750 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=115, Invalid=1445, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:31:35,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-08-05 10:31:35,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 215. [2019-08-05 10:31:35,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2019-08-05 10:31:35,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 239 transitions. [2019-08-05 10:31:35,754 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 239 transitions. Word has length 28 [2019-08-05 10:31:35,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:35,754 INFO L475 AbstractCegarLoop]: Abstraction has 215 states and 239 transitions. [2019-08-05 10:31:35,754 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 10:31:35,754 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 239 transitions. [2019-08-05 10:31:35,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 10:31:35,755 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:35,755 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 1, 1, 1, 1, 1, 1] [2019-08-05 10:31:35,755 INFO L418 AbstractCegarLoop]: === Iteration 53 === [TimesVsAddErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:35,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:35,755 INFO L82 PathProgramCache]: Analyzing trace with hash 641487210, now seen corresponding path program 49 times [2019-08-05 10:31:35,756 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:35,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:35,766 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 26 conjunts are in the unsatisfiable core [2019-08-05 10:31:35,767 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:36,037 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 67 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:36,038 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:36,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 10:31:36,038 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 10:31:36,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 10:31:36,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=519, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:31:36,039 INFO L87 Difference]: Start difference. First operand 215 states and 239 transitions. Second operand 27 states. [2019-08-05 10:31:36,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:36,984 INFO L93 Difference]: Finished difference Result 329 states and 345 transitions. [2019-08-05 10:31:36,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 10:31:36,985 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 29 [2019-08-05 10:31:36,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:36,987 INFO L225 Difference]: With dead ends: 329 [2019-08-05 10:31:36,987 INFO L226 Difference]: Without dead ends: 329 [2019-08-05 10:31:36,987 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=391, Invalid=1169, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:31:36,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2019-08-05 10:31:36,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 229. [2019-08-05 10:31:36,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2019-08-05 10:31:36,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 255 transitions. [2019-08-05 10:31:36,991 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 255 transitions. Word has length 29 [2019-08-05 10:31:36,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:36,992 INFO L475 AbstractCegarLoop]: Abstraction has 229 states and 255 transitions. [2019-08-05 10:31:36,992 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 10:31:36,992 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 255 transitions. [2019-08-05 10:31:36,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 10:31:36,993 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:36,993 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 1, 1, 1, 1, 1, 1] [2019-08-05 10:31:36,993 INFO L418 AbstractCegarLoop]: === Iteration 54 === [TimesVsAddErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:36,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:36,993 INFO L82 PathProgramCache]: Analyzing trace with hash 613287974, now seen corresponding path program 50 times [2019-08-05 10:31:36,994 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:37,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:37,003 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 26 conjunts are in the unsatisfiable core [2019-08-05 10:31:37,004 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:37,250 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 79 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:37,251 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:37,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 10:31:37,251 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 10:31:37,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 10:31:37,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=519, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:31:37,252 INFO L87 Difference]: Start difference. First operand 229 states and 255 transitions. Second operand 27 states. [2019-08-05 10:31:39,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:39,222 INFO L93 Difference]: Finished difference Result 329 states and 342 transitions. [2019-08-05 10:31:39,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-08-05 10:31:39,223 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 29 [2019-08-05 10:31:39,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:39,225 INFO L225 Difference]: With dead ends: 329 [2019-08-05 10:31:39,225 INFO L226 Difference]: Without dead ends: 317 [2019-08-05 10:31:39,226 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3289 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2900, Invalid=7812, Unknown=0, NotChecked=0, Total=10712 [2019-08-05 10:31:39,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2019-08-05 10:31:39,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 230. [2019-08-05 10:31:39,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-08-05 10:31:39,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 254 transitions. [2019-08-05 10:31:39,229 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 254 transitions. Word has length 29 [2019-08-05 10:31:39,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:39,230 INFO L475 AbstractCegarLoop]: Abstraction has 230 states and 254 transitions. [2019-08-05 10:31:39,230 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 10:31:39,230 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 254 transitions. [2019-08-05 10:31:39,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 10:31:39,230 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:39,231 INFO L399 BasicCegarLoop]: trace histogram [14, 7, 2, 2, 1, 1, 1, 1] [2019-08-05 10:31:39,231 INFO L418 AbstractCegarLoop]: === Iteration 55 === [TimesVsAddErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:39,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:39,231 INFO L82 PathProgramCache]: Analyzing trace with hash -2088687580, now seen corresponding path program 51 times [2019-08-05 10:31:39,232 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:39,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:39,241 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 56 conjunts are in the unsatisfiable core [2019-08-05 10:31:39,242 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:39,703 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 0 proven. 151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:39,703 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:39,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 10:31:39,704 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 10:31:39,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 10:31:39,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=701, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:31:39,704 INFO L87 Difference]: Start difference. First operand 230 states and 254 transitions. Second operand 28 states. [2019-08-05 10:31:40,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:40,651 INFO L93 Difference]: Finished difference Result 249 states and 273 transitions. [2019-08-05 10:31:40,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 10:31:40,652 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 29 [2019-08-05 10:31:40,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:40,653 INFO L225 Difference]: With dead ends: 249 [2019-08-05 10:31:40,653 INFO L226 Difference]: Without dead ends: 240 [2019-08-05 10:31:40,654 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=87, Invalid=1173, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:31:40,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2019-08-05 10:31:40,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 239. [2019-08-05 10:31:40,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2019-08-05 10:31:40,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 263 transitions. [2019-08-05 10:31:40,657 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 263 transitions. Word has length 29 [2019-08-05 10:31:40,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:40,658 INFO L475 AbstractCegarLoop]: Abstraction has 239 states and 263 transitions. [2019-08-05 10:31:40,658 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 10:31:40,658 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 263 transitions. [2019-08-05 10:31:40,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 10:31:40,659 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:40,659 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1] [2019-08-05 10:31:40,659 INFO L418 AbstractCegarLoop]: === Iteration 56 === [TimesVsAddErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:40,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:40,659 INFO L82 PathProgramCache]: Analyzing trace with hash -654530716, now seen corresponding path program 52 times [2019-08-05 10:31:40,660 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:40,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:40,667 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 44 conjunts are in the unsatisfiable core [2019-08-05 10:31:40,668 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:40,969 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 0 proven. 157 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:40,969 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:40,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:31:40,970 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:31:40,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:31:40,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=419, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:31:40,970 INFO L87 Difference]: Start difference. First operand 239 states and 263 transitions. Second operand 22 states. [2019-08-05 10:31:41,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:41,533 INFO L93 Difference]: Finished difference Result 246 states and 270 transitions. [2019-08-05 10:31:41,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:31:41,534 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 29 [2019-08-05 10:31:41,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:41,535 INFO L225 Difference]: With dead ends: 246 [2019-08-05 10:31:41,535 INFO L226 Difference]: Without dead ends: 243 [2019-08-05 10:31:41,535 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=501, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:31:41,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-08-05 10:31:41,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 242. [2019-08-05 10:31:41,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-08-05 10:31:41,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 266 transitions. [2019-08-05 10:31:41,538 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 266 transitions. Word has length 29 [2019-08-05 10:31:41,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:41,538 INFO L475 AbstractCegarLoop]: Abstraction has 242 states and 266 transitions. [2019-08-05 10:31:41,538 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:31:41,538 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 266 transitions. [2019-08-05 10:31:41,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 10:31:41,539 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:41,539 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1, 1, 1] [2019-08-05 10:31:41,539 INFO L418 AbstractCegarLoop]: === Iteration 57 === [TimesVsAddErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:41,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:41,540 INFO L82 PathProgramCache]: Analyzing trace with hash -1588734904, now seen corresponding path program 53 times [2019-08-05 10:31:41,540 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:41,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:41,551 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 60 conjunts are in the unsatisfiable core [2019-08-05 10:31:41,552 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:42,143 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 0 proven. 157 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:42,143 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:42,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 10:31:42,144 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 10:31:42,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 10:31:42,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=811, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:31:42,144 INFO L87 Difference]: Start difference. First operand 242 states and 266 transitions. Second operand 30 states. [2019-08-05 10:31:43,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:43,351 INFO L93 Difference]: Finished difference Result 262 states and 288 transitions. [2019-08-05 10:31:43,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 10:31:43,352 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 30 [2019-08-05 10:31:43,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:43,353 INFO L225 Difference]: With dead ends: 262 [2019-08-05 10:31:43,354 INFO L226 Difference]: Without dead ends: 261 [2019-08-05 10:31:43,354 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=124, Invalid=1682, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:31:43,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2019-08-05 10:31:43,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 245. [2019-08-05 10:31:43,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2019-08-05 10:31:43,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 271 transitions. [2019-08-05 10:31:43,357 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 271 transitions. Word has length 30 [2019-08-05 10:31:43,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:43,357 INFO L475 AbstractCegarLoop]: Abstraction has 245 states and 271 transitions. [2019-08-05 10:31:43,357 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 10:31:43,357 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 271 transitions. [2019-08-05 10:31:43,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 10:31:43,358 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:43,358 INFO L399 BasicCegarLoop]: trace histogram [15, 5, 3, 3, 1, 1, 1, 1] [2019-08-05 10:31:43,358 INFO L418 AbstractCegarLoop]: === Iteration 58 === [TimesVsAddErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:43,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:43,358 INFO L82 PathProgramCache]: Analyzing trace with hash 698003916, now seen corresponding path program 54 times [2019-08-05 10:31:43,359 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:43,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:43,367 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 56 conjunts are in the unsatisfiable core [2019-08-05 10:31:43,368 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:44,224 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 174 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:44,224 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:44,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 10:31:44,224 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 10:31:44,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 10:31:44,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=701, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:31:44,225 INFO L87 Difference]: Start difference. First operand 245 states and 271 transitions. Second operand 28 states. [2019-08-05 10:31:45,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:45,091 INFO L93 Difference]: Finished difference Result 260 states and 286 transitions. [2019-08-05 10:31:45,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 10:31:45,092 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 30 [2019-08-05 10:31:45,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:45,093 INFO L225 Difference]: With dead ends: 260 [2019-08-05 10:31:45,093 INFO L226 Difference]: Without dead ends: 253 [2019-08-05 10:31:45,094 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=79, Invalid=1043, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:31:45,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2019-08-05 10:31:45,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 252. [2019-08-05 10:31:45,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-08-05 10:31:45,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 278 transitions. [2019-08-05 10:31:45,097 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 278 transitions. Word has length 30 [2019-08-05 10:31:45,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:45,097 INFO L475 AbstractCegarLoop]: Abstraction has 252 states and 278 transitions. [2019-08-05 10:31:45,097 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 10:31:45,097 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 278 transitions. [2019-08-05 10:31:45,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 10:31:45,098 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:45,098 INFO L399 BasicCegarLoop]: trace histogram [12, 6, 6, 2, 1, 1, 1, 1] [2019-08-05 10:31:45,098 INFO L418 AbstractCegarLoop]: === Iteration 59 === [TimesVsAddErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:45,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:45,099 INFO L82 PathProgramCache]: Analyzing trace with hash -1893107990, now seen corresponding path program 55 times [2019-08-05 10:31:45,099 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:45,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:45,107 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 50 conjunts are in the unsatisfiable core [2019-08-05 10:31:45,108 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:45,471 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 0 proven. 177 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:45,472 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:45,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 10:31:45,472 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 10:31:45,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 10:31:45,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=551, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:31:45,473 INFO L87 Difference]: Start difference. First operand 252 states and 278 transitions. Second operand 25 states. [2019-08-05 10:31:46,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:46,157 INFO L93 Difference]: Finished difference Result 261 states and 287 transitions. [2019-08-05 10:31:46,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:31:46,157 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 30 [2019-08-05 10:31:46,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:46,159 INFO L225 Difference]: With dead ends: 261 [2019-08-05 10:31:46,159 INFO L226 Difference]: Without dead ends: 257 [2019-08-05 10:31:46,160 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=61, Invalid=695, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:31:46,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2019-08-05 10:31:46,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 256. [2019-08-05 10:31:46,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-08-05 10:31:46,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 282 transitions. [2019-08-05 10:31:46,162 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 282 transitions. Word has length 30 [2019-08-05 10:31:46,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:46,162 INFO L475 AbstractCegarLoop]: Abstraction has 256 states and 282 transitions. [2019-08-05 10:31:46,163 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 10:31:46,163 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 282 transitions. [2019-08-05 10:31:46,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-05 10:31:46,163 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:46,164 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 1, 1, 1, 1, 1, 1] [2019-08-05 10:31:46,164 INFO L418 AbstractCegarLoop]: === Iteration 60 === [TimesVsAddErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:46,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:46,164 INFO L82 PathProgramCache]: Analyzing trace with hash -1131967386, now seen corresponding path program 56 times [2019-08-05 10:31:46,165 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:46,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:46,176 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 28 conjunts are in the unsatisfiable core [2019-08-05 10:31:46,177 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:46,447 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 79 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:46,447 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:46,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 10:31:46,448 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 10:31:46,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 10:31:46,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=601, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:31:46,448 INFO L87 Difference]: Start difference. First operand 256 states and 282 transitions. Second operand 29 states. [2019-08-05 10:31:47,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:47,369 INFO L93 Difference]: Finished difference Result 386 states and 403 transitions. [2019-08-05 10:31:47,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 10:31:47,370 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 31 [2019-08-05 10:31:47,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:47,372 INFO L225 Difference]: With dead ends: 386 [2019-08-05 10:31:47,372 INFO L226 Difference]: Without dead ends: 386 [2019-08-05 10:31:47,373 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=449, Invalid=1357, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:31:47,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2019-08-05 10:31:47,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 271. [2019-08-05 10:31:47,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2019-08-05 10:31:47,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 299 transitions. [2019-08-05 10:31:47,376 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 299 transitions. Word has length 31 [2019-08-05 10:31:47,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:47,376 INFO L475 AbstractCegarLoop]: Abstraction has 271 states and 299 transitions. [2019-08-05 10:31:47,376 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 10:31:47,376 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 299 transitions. [2019-08-05 10:31:47,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-05 10:31:47,377 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:47,377 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 1, 1, 1, 1, 1, 1] [2019-08-05 10:31:47,377 INFO L418 AbstractCegarLoop]: === Iteration 61 === [TimesVsAddErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:47,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:47,378 INFO L82 PathProgramCache]: Analyzing trace with hash -2006143702, now seen corresponding path program 57 times [2019-08-05 10:31:47,378 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:47,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:47,388 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 28 conjunts are in the unsatisfiable core [2019-08-05 10:31:47,389 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:47,879 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 92 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:47,879 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:47,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 10:31:47,879 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 10:31:47,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 10:31:47,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=601, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:31:47,880 INFO L87 Difference]: Start difference. First operand 271 states and 299 transitions. Second operand 29 states. [2019-08-05 10:31:50,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:50,531 INFO L93 Difference]: Finished difference Result 386 states and 400 transitions. [2019-08-05 10:31:50,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2019-08-05 10:31:50,531 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 31 [2019-08-05 10:31:50,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:50,533 INFO L225 Difference]: With dead ends: 386 [2019-08-05 10:31:50,533 INFO L226 Difference]: Without dead ends: 373 [2019-08-05 10:31:50,535 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4459 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3732, Invalid=10310, Unknown=0, NotChecked=0, Total=14042 [2019-08-05 10:31:50,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2019-08-05 10:31:50,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 272. [2019-08-05 10:31:50,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2019-08-05 10:31:50,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 298 transitions. [2019-08-05 10:31:50,539 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 298 transitions. Word has length 31 [2019-08-05 10:31:50,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:50,539 INFO L475 AbstractCegarLoop]: Abstraction has 272 states and 298 transitions. [2019-08-05 10:31:50,539 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 10:31:50,539 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 298 transitions. [2019-08-05 10:31:50,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 10:31:50,540 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:50,540 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 1, 1, 1, 1, 1, 1] [2019-08-05 10:31:50,540 INFO L418 AbstractCegarLoop]: === Iteration 62 === [TimesVsAddErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:50,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:50,540 INFO L82 PathProgramCache]: Analyzing trace with hash -731252532, now seen corresponding path program 58 times [2019-08-05 10:31:50,541 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:50,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:50,554 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 64 conjunts are in the unsatisfiable core [2019-08-05 10:31:50,555 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:51,212 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 0 proven. 183 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:51,213 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:51,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-05 10:31:51,213 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 10:31:51,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 10:31:51,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=929, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:31:51,213 INFO L87 Difference]: Start difference. First operand 272 states and 298 transitions. Second operand 32 states. [2019-08-05 10:31:52,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:52,717 INFO L93 Difference]: Finished difference Result 293 states and 321 transitions. [2019-08-05 10:31:52,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-05 10:31:52,718 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 32 [2019-08-05 10:31:52,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:52,719 INFO L225 Difference]: With dead ends: 293 [2019-08-05 10:31:52,720 INFO L226 Difference]: Without dead ends: 292 [2019-08-05 10:31:52,720 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=133, Invalid=1937, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:31:52,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2019-08-05 10:31:52,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 275. [2019-08-05 10:31:52,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2019-08-05 10:31:52,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 303 transitions. [2019-08-05 10:31:52,724 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 303 transitions. Word has length 32 [2019-08-05 10:31:52,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:52,724 INFO L475 AbstractCegarLoop]: Abstraction has 275 states and 303 transitions. [2019-08-05 10:31:52,724 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 10:31:52,724 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 303 transitions. [2019-08-05 10:31:52,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 10:31:52,725 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:52,725 INFO L399 BasicCegarLoop]: trace histogram [16, 8, 2, 2, 1, 1, 1, 1] [2019-08-05 10:31:52,726 INFO L418 AbstractCegarLoop]: === Iteration 63 === [TimesVsAddErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:52,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:52,726 INFO L82 PathProgramCache]: Analyzing trace with hash -1277696446, now seen corresponding path program 59 times [2019-08-05 10:31:52,727 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:52,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:52,739 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 62 conjunts are in the unsatisfiable core [2019-08-05 10:31:52,740 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:53,302 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 0 proven. 192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:53,302 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:53,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 10:31:53,302 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-05 10:31:53,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-05 10:31:53,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=869, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:31:53,303 INFO L87 Difference]: Start difference. First operand 275 states and 303 transitions. Second operand 31 states. [2019-08-05 10:31:54,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:54,454 INFO L93 Difference]: Finished difference Result 296 states and 324 transitions. [2019-08-05 10:31:54,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 10:31:54,455 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 32 [2019-08-05 10:31:54,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:54,456 INFO L225 Difference]: With dead ends: 296 [2019-08-05 10:31:54,456 INFO L226 Difference]: Without dead ends: 286 [2019-08-05 10:31:54,457 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=97, Invalid=1463, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:31:54,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2019-08-05 10:31:54,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 285. [2019-08-05 10:31:54,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2019-08-05 10:31:54,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 313 transitions. [2019-08-05 10:31:54,460 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 313 transitions. Word has length 32 [2019-08-05 10:31:54,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:54,461 INFO L475 AbstractCegarLoop]: Abstraction has 285 states and 313 transitions. [2019-08-05 10:31:54,461 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-05 10:31:54,461 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 313 transitions. [2019-08-05 10:31:54,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 10:31:54,462 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:54,462 INFO L399 BasicCegarLoop]: trace histogram [16, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 10:31:54,462 INFO L418 AbstractCegarLoop]: === Iteration 64 === [TimesVsAddErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:54,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:54,462 INFO L82 PathProgramCache]: Analyzing trace with hash -2077866186, now seen corresponding path program 60 times [2019-08-05 10:31:54,463 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:54,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:54,473 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 58 conjunts are in the unsatisfiable core [2019-08-05 10:31:54,474 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:55,044 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:55,044 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:55,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 10:31:55,045 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 10:31:55,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 10:31:55,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=755, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:31:55,045 INFO L87 Difference]: Start difference. First operand 285 states and 313 transitions. Second operand 29 states. [2019-08-05 10:31:55,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:55,921 INFO L93 Difference]: Finished difference Result 298 states and 326 transitions. [2019-08-05 10:31:55,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 10:31:55,921 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 32 [2019-08-05 10:31:55,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:55,923 INFO L225 Difference]: With dead ends: 298 [2019-08-05 10:31:55,923 INFO L226 Difference]: Without dead ends: 292 [2019-08-05 10:31:55,924 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=77, Invalid=1045, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:31:55,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2019-08-05 10:31:55,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 291. [2019-08-05 10:31:55,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2019-08-05 10:31:55,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 319 transitions. [2019-08-05 10:31:55,928 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 319 transitions. Word has length 32 [2019-08-05 10:31:55,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:55,928 INFO L475 AbstractCegarLoop]: Abstraction has 291 states and 319 transitions. [2019-08-05 10:31:55,928 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 10:31:55,928 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 319 transitions. [2019-08-05 10:31:55,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 10:31:55,929 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:55,930 INFO L399 BasicCegarLoop]: trace histogram [15, 5, 5, 3, 1, 1, 1, 1] [2019-08-05 10:31:55,930 INFO L418 AbstractCegarLoop]: === Iteration 65 === [TimesVsAddErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:55,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:55,930 INFO L82 PathProgramCache]: Analyzing trace with hash -884327476, now seen corresponding path program 61 times [2019-08-05 10:31:55,931 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:55,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:55,939 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 56 conjunts are in the unsatisfiable core [2019-08-05 10:31:55,940 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:56,474 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 0 proven. 211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:56,474 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:56,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 10:31:56,474 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 10:31:56,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 10:31:56,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=701, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:31:56,475 INFO L87 Difference]: Start difference. First operand 291 states and 319 transitions. Second operand 28 states. [2019-08-05 10:31:57,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:57,376 INFO L93 Difference]: Finished difference Result 302 states and 330 transitions. [2019-08-05 10:31:57,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 10:31:57,384 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 32 [2019-08-05 10:31:57,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:57,385 INFO L225 Difference]: With dead ends: 302 [2019-08-05 10:31:57,385 INFO L226 Difference]: Without dead ends: 297 [2019-08-05 10:31:57,386 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=71, Invalid=921, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:31:57,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2019-08-05 10:31:57,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 296. [2019-08-05 10:31:57,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2019-08-05 10:31:57,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 324 transitions. [2019-08-05 10:31:57,389 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 324 transitions. Word has length 32 [2019-08-05 10:31:57,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:57,389 INFO L475 AbstractCegarLoop]: Abstraction has 296 states and 324 transitions. [2019-08-05 10:31:57,389 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 10:31:57,390 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 324 transitions. [2019-08-05 10:31:57,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 10:31:57,391 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:57,391 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1] [2019-08-05 10:31:57,391 INFO L418 AbstractCegarLoop]: === Iteration 66 === [TimesVsAddErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:57,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:57,391 INFO L82 PathProgramCache]: Analyzing trace with hash 1280254668, now seen corresponding path program 62 times [2019-08-05 10:31:57,392 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:57,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:57,400 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 48 conjunts are in the unsatisfiable core [2019-08-05 10:31:57,401 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:57,854 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 0 proven. 199 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:57,855 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:57,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:31:57,855 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:31:57,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:31:57,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=505, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:31:57,855 INFO L87 Difference]: Start difference. First operand 296 states and 324 transitions. Second operand 24 states. [2019-08-05 10:31:58,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:58,439 INFO L93 Difference]: Finished difference Result 303 states and 331 transitions. [2019-08-05 10:31:58,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 10:31:58,440 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 32 [2019-08-05 10:31:58,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:58,441 INFO L225 Difference]: With dead ends: 303 [2019-08-05 10:31:58,442 INFO L226 Difference]: Without dead ends: 300 [2019-08-05 10:31:58,442 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=595, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:31:58,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-08-05 10:31:58,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 299. [2019-08-05 10:31:58,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2019-08-05 10:31:58,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 327 transitions. [2019-08-05 10:31:58,446 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 327 transitions. Word has length 32 [2019-08-05 10:31:58,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:58,446 INFO L475 AbstractCegarLoop]: Abstraction has 299 states and 327 transitions. [2019-08-05 10:31:58,446 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:31:58,446 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 327 transitions. [2019-08-05 10:31:58,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-05 10:31:58,447 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:58,447 INFO L399 BasicCegarLoop]: trace histogram [14, 13, 1, 1, 1, 1, 1, 1] [2019-08-05 10:31:58,447 INFO L418 AbstractCegarLoop]: === Iteration 67 === [TimesVsAddErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:58,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:58,448 INFO L82 PathProgramCache]: Analyzing trace with hash 135668074, now seen corresponding path program 63 times [2019-08-05 10:31:58,448 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:58,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:58,459 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 30 conjunts are in the unsatisfiable core [2019-08-05 10:31:58,460 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:58,763 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 92 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:58,764 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:58,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-05 10:31:58,764 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-05 10:31:58,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-05 10:31:58,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=689, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:31:58,765 INFO L87 Difference]: Start difference. First operand 299 states and 327 transitions. Second operand 31 states. [2019-08-05 10:31:59,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:59,665 INFO L93 Difference]: Finished difference Result 446 states and 464 transitions. [2019-08-05 10:31:59,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 10:31:59,666 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 33 [2019-08-05 10:31:59,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:59,668 INFO L225 Difference]: With dead ends: 446 [2019-08-05 10:31:59,668 INFO L226 Difference]: Without dead ends: 446 [2019-08-05 10:31:59,669 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 377 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=511, Invalid=1559, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:31:59,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2019-08-05 10:31:59,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 315. [2019-08-05 10:31:59,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2019-08-05 10:31:59,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 345 transitions. [2019-08-05 10:31:59,673 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 345 transitions. Word has length 33 [2019-08-05 10:31:59,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:59,674 INFO L475 AbstractCegarLoop]: Abstraction has 315 states and 345 transitions. [2019-08-05 10:31:59,674 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-05 10:31:59,674 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 345 transitions. [2019-08-05 10:31:59,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-05 10:31:59,674 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:59,675 INFO L399 BasicCegarLoop]: trace histogram [14, 13, 1, 1, 1, 1, 1, 1] [2019-08-05 10:31:59,675 INFO L418 AbstractCegarLoop]: === Iteration 68 === [TimesVsAddErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:59,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:59,675 INFO L82 PathProgramCache]: Analyzing trace with hash -1193993946, now seen corresponding path program 64 times [2019-08-05 10:31:59,676 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:59,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:59,686 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 30 conjunts are in the unsatisfiable core [2019-08-05 10:31:59,687 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:00,029 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 106 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:00,029 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:00,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-05 10:32:00,029 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-05 10:32:00,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-05 10:32:00,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=689, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:32:00,030 INFO L87 Difference]: Start difference. First operand 315 states and 345 transitions. Second operand 31 states. [2019-08-05 10:32:03,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:03,524 INFO L93 Difference]: Finished difference Result 446 states and 461 transitions. [2019-08-05 10:32:03,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2019-08-05 10:32:03,524 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 33 [2019-08-05 10:32:03,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:03,526 INFO L225 Difference]: With dead ends: 446 [2019-08-05 10:32:03,526 INFO L226 Difference]: Without dead ends: 432 [2019-08-05 10:32:03,527 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5915 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=4726, Invalid=13364, Unknown=0, NotChecked=0, Total=18090 [2019-08-05 10:32:03,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2019-08-05 10:32:03,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 316. [2019-08-05 10:32:03,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2019-08-05 10:32:03,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 344 transitions. [2019-08-05 10:32:03,530 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 344 transitions. Word has length 33 [2019-08-05 10:32:03,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:03,530 INFO L475 AbstractCegarLoop]: Abstraction has 316 states and 344 transitions. [2019-08-05 10:32:03,530 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-05 10:32:03,530 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 344 transitions. [2019-08-05 10:32:03,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-05 10:32:03,531 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:03,531 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 1, 1, 1, 1, 1, 1] [2019-08-05 10:32:03,531 INFO L418 AbstractCegarLoop]: === Iteration 69 === [TimesVsAddErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:03,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:03,531 INFO L82 PathProgramCache]: Analyzing trace with hash -89258936, now seen corresponding path program 65 times [2019-08-05 10:32:03,532 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:03,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:03,551 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 68 conjunts are in the unsatisfiable core [2019-08-05 10:32:03,552 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:04,322 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 0 proven. 211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:04,322 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:04,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-05 10:32:04,322 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 10:32:04,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 10:32:04,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1055, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:32:04,323 INFO L87 Difference]: Start difference. First operand 316 states and 344 transitions. Second operand 34 states. [2019-08-05 10:32:05,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:05,841 INFO L93 Difference]: Finished difference Result 338 states and 368 transitions. [2019-08-05 10:32:05,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-05 10:32:05,842 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 34 [2019-08-05 10:32:05,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:05,843 INFO L225 Difference]: With dead ends: 338 [2019-08-05 10:32:05,844 INFO L226 Difference]: Without dead ends: 337 [2019-08-05 10:32:05,844 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=142, Invalid=2210, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:32:05,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2019-08-05 10:32:05,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 319. [2019-08-05 10:32:05,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2019-08-05 10:32:05,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 349 transitions. [2019-08-05 10:32:05,848 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 349 transitions. Word has length 34 [2019-08-05 10:32:05,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:05,848 INFO L475 AbstractCegarLoop]: Abstraction has 319 states and 349 transitions. [2019-08-05 10:32:05,848 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 10:32:05,848 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 349 transitions. [2019-08-05 10:32:05,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-05 10:32:05,849 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:05,849 INFO L399 BasicCegarLoop]: trace histogram [18, 6, 3, 3, 1, 1, 1, 1] [2019-08-05 10:32:05,849 INFO L418 AbstractCegarLoop]: === Iteration 70 === [TimesVsAddErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:05,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:05,850 INFO L82 PathProgramCache]: Analyzing trace with hash 442671292, now seen corresponding path program 66 times [2019-08-05 10:32:05,850 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:05,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:05,861 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 64 conjunts are in the unsatisfiable core [2019-08-05 10:32:05,862 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:06,543 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 0 proven. 237 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:06,544 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:06,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-05 10:32:06,544 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 10:32:06,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 10:32:06,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=929, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:32:06,545 INFO L87 Difference]: Start difference. First operand 319 states and 349 transitions. Second operand 32 states. [2019-08-05 10:32:07,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:07,917 INFO L93 Difference]: Finished difference Result 336 states and 366 transitions. [2019-08-05 10:32:07,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-05 10:32:07,917 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 34 [2019-08-05 10:32:07,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:07,919 INFO L225 Difference]: With dead ends: 336 [2019-08-05 10:32:07,919 INFO L226 Difference]: Without dead ends: 328 [2019-08-05 10:32:07,920 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=91, Invalid=1391, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:32:07,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2019-08-05 10:32:07,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 327. [2019-08-05 10:32:07,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2019-08-05 10:32:07,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 357 transitions. [2019-08-05 10:32:07,922 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 357 transitions. Word has length 34 [2019-08-05 10:32:07,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:07,922 INFO L475 AbstractCegarLoop]: Abstraction has 327 states and 357 transitions. [2019-08-05 10:32:07,922 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 10:32:07,922 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 357 transitions. [2019-08-05 10:32:07,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-05 10:32:07,923 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:07,923 INFO L399 BasicCegarLoop]: trace histogram [14, 7, 7, 2, 1, 1, 1, 1] [2019-08-05 10:32:07,923 INFO L418 AbstractCegarLoop]: === Iteration 71 === [TimesVsAddErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:07,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:07,924 INFO L82 PathProgramCache]: Analyzing trace with hash -939568220, now seen corresponding path program 67 times [2019-08-05 10:32:07,924 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:07,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:07,933 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 56 conjunts are in the unsatisfiable core [2019-08-05 10:32:07,934 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:08,425 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 0 proven. 241 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:08,425 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:08,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 10:32:08,426 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 10:32:08,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 10:32:08,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=701, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:32:08,426 INFO L87 Difference]: Start difference. First operand 327 states and 357 transitions. Second operand 28 states. [2019-08-05 10:32:09,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:09,224 INFO L93 Difference]: Finished difference Result 336 states and 366 transitions. [2019-08-05 10:32:09,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 10:32:09,224 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 34 [2019-08-05 10:32:09,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:09,226 INFO L225 Difference]: With dead ends: 336 [2019-08-05 10:32:09,226 INFO L226 Difference]: Without dead ends: 332 [2019-08-05 10:32:09,227 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=67, Invalid=863, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:32:09,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2019-08-05 10:32:09,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 331. [2019-08-05 10:32:09,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2019-08-05 10:32:09,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 361 transitions. [2019-08-05 10:32:09,231 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 361 transitions. Word has length 34 [2019-08-05 10:32:09,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:09,231 INFO L475 AbstractCegarLoop]: Abstraction has 331 states and 361 transitions. [2019-08-05 10:32:09,231 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 10:32:09,232 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 361 transitions. [2019-08-05 10:32:09,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-05 10:32:09,232 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:09,232 INFO L399 BasicCegarLoop]: trace histogram [15, 14, 1, 1, 1, 1, 1, 1] [2019-08-05 10:32:09,233 INFO L418 AbstractCegarLoop]: === Iteration 72 === [TimesVsAddErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:09,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:09,233 INFO L82 PathProgramCache]: Analyzing trace with hash -202211994, now seen corresponding path program 68 times [2019-08-05 10:32:09,234 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:09,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:09,245 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 32 conjunts are in the unsatisfiable core [2019-08-05 10:32:09,246 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:09,592 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 106 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:09,592 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:09,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 10:32:09,593 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-05 10:32:09,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-05 10:32:09,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=273, Invalid=783, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:32:09,593 INFO L87 Difference]: Start difference. First operand 331 states and 361 transitions. Second operand 33 states. [2019-08-05 10:32:10,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:10,400 INFO L93 Difference]: Finished difference Result 496 states and 515 transitions. [2019-08-05 10:32:10,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-05 10:32:10,401 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 35 [2019-08-05 10:32:10,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:10,403 INFO L225 Difference]: With dead ends: 496 [2019-08-05 10:32:10,403 INFO L226 Difference]: Without dead ends: 496 [2019-08-05 10:32:10,404 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 434 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=577, Invalid=1775, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:32:10,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2019-08-05 10:32:10,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 348. [2019-08-05 10:32:10,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2019-08-05 10:32:10,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 380 transitions. [2019-08-05 10:32:10,407 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 380 transitions. Word has length 35 [2019-08-05 10:32:10,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:10,407 INFO L475 AbstractCegarLoop]: Abstraction has 348 states and 380 transitions. [2019-08-05 10:32:10,407 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-05 10:32:10,408 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 380 transitions. [2019-08-05 10:32:10,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-05 10:32:10,408 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:10,408 INFO L399 BasicCegarLoop]: trace histogram [15, 14, 1, 1, 1, 1, 1, 1] [2019-08-05 10:32:10,408 INFO L418 AbstractCegarLoop]: === Iteration 73 === [TimesVsAddErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:10,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:10,409 INFO L82 PathProgramCache]: Analyzing trace with hash 1527938346, now seen corresponding path program 69 times [2019-08-05 10:32:10,409 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:10,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:10,419 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 32 conjunts are in the unsatisfiable core [2019-08-05 10:32:10,420 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:10,824 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 121 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:10,825 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:10,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 10:32:10,825 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-05 10:32:10,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-05 10:32:10,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=273, Invalid=783, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:32:10,826 INFO L87 Difference]: Start difference. First operand 348 states and 380 transitions. Second operand 33 states. [2019-08-05 10:32:14,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:14,859 INFO L93 Difference]: Finished difference Result 496 states and 512 transitions. [2019-08-05 10:32:14,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 137 states. [2019-08-05 10:32:14,859 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 35 [2019-08-05 10:32:14,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:14,862 INFO L225 Difference]: With dead ends: 496 [2019-08-05 10:32:14,862 INFO L226 Difference]: Without dead ends: 481 [2019-08-05 10:32:14,863 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7700 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=5901, Invalid=17051, Unknown=0, NotChecked=0, Total=22952 [2019-08-05 10:32:14,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2019-08-05 10:32:14,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 349. [2019-08-05 10:32:14,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2019-08-05 10:32:14,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 379 transitions. [2019-08-05 10:32:14,867 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 379 transitions. Word has length 35 [2019-08-05 10:32:14,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:14,867 INFO L475 AbstractCegarLoop]: Abstraction has 349 states and 379 transitions. [2019-08-05 10:32:14,867 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-05 10:32:14,867 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 379 transitions. [2019-08-05 10:32:14,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-05 10:32:14,867 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:14,867 INFO L399 BasicCegarLoop]: trace histogram [18, 9, 2, 2, 1, 1, 1, 1] [2019-08-05 10:32:14,868 INFO L418 AbstractCegarLoop]: === Iteration 74 === [TimesVsAddErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:14,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:14,868 INFO L82 PathProgramCache]: Analyzing trace with hash 1462939492, now seen corresponding path program 70 times [2019-08-05 10:32:14,868 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:14,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:14,879 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 68 conjunts are in the unsatisfiable core [2019-08-05 10:32:14,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:15,561 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 0 proven. 238 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:15,561 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:15,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-05 10:32:15,562 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 10:32:15,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 10:32:15,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1055, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:32:15,563 INFO L87 Difference]: Start difference. First operand 349 states and 379 transitions. Second operand 34 states. [2019-08-05 10:32:16,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:16,970 INFO L93 Difference]: Finished difference Result 372 states and 402 transitions. [2019-08-05 10:32:16,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-05 10:32:16,970 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 35 [2019-08-05 10:32:16,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:16,972 INFO L225 Difference]: With dead ends: 372 [2019-08-05 10:32:16,972 INFO L226 Difference]: Without dead ends: 361 [2019-08-05 10:32:16,973 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=107, Invalid=1785, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:32:16,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2019-08-05 10:32:16,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 360. [2019-08-05 10:32:16,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2019-08-05 10:32:16,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 390 transitions. [2019-08-05 10:32:16,976 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 390 transitions. Word has length 35 [2019-08-05 10:32:16,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:16,976 INFO L475 AbstractCegarLoop]: Abstraction has 360 states and 390 transitions. [2019-08-05 10:32:16,976 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 10:32:16,977 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 390 transitions. [2019-08-05 10:32:16,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-05 10:32:16,977 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:16,977 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1] [2019-08-05 10:32:16,977 INFO L418 AbstractCegarLoop]: === Iteration 75 === [TimesVsAddErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:16,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:16,978 INFO L82 PathProgramCache]: Analyzing trace with hash 2010517092, now seen corresponding path program 71 times [2019-08-05 10:32:16,978 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:16,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:16,985 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 52 conjunts are in the unsatisfiable core [2019-08-05 10:32:16,986 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:17,506 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 0 proven. 246 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:17,506 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:17,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 10:32:17,507 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 10:32:17,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 10:32:17,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=599, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:32:17,507 INFO L87 Difference]: Start difference. First operand 360 states and 390 transitions. Second operand 26 states. [2019-08-05 10:32:18,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:18,194 INFO L93 Difference]: Finished difference Result 367 states and 397 transitions. [2019-08-05 10:32:18,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:32:18,194 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 35 [2019-08-05 10:32:18,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:18,196 INFO L225 Difference]: With dead ends: 367 [2019-08-05 10:32:18,197 INFO L226 Difference]: Without dead ends: 364 [2019-08-05 10:32:18,197 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=59, Invalid=697, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:32:18,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2019-08-05 10:32:18,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 363. [2019-08-05 10:32:18,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2019-08-05 10:32:18,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 393 transitions. [2019-08-05 10:32:18,200 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 393 transitions. Word has length 35 [2019-08-05 10:32:18,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:18,200 INFO L475 AbstractCegarLoop]: Abstraction has 363 states and 393 transitions. [2019-08-05 10:32:18,200 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 10:32:18,200 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 393 transitions. [2019-08-05 10:32:18,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-05 10:32:18,201 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:18,201 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1, 1, 1] [2019-08-05 10:32:18,201 INFO L418 AbstractCegarLoop]: === Iteration 76 === [TimesVsAddErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:18,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:18,201 INFO L82 PathProgramCache]: Analyzing trace with hash -1973606452, now seen corresponding path program 72 times [2019-08-05 10:32:18,202 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:18,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:18,216 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 72 conjunts are in the unsatisfiable core [2019-08-05 10:32:18,217 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:19,311 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 0 proven. 241 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:19,311 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:19,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-05 10:32:19,312 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-05 10:32:19,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-05 10:32:19,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=1189, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:32:19,312 INFO L87 Difference]: Start difference. First operand 363 states and 393 transitions. Second operand 36 states. [2019-08-05 10:32:21,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:21,021 INFO L93 Difference]: Finished difference Result 386 states and 418 transitions. [2019-08-05 10:32:21,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-05 10:32:21,022 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 36 [2019-08-05 10:32:21,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:21,024 INFO L225 Difference]: With dead ends: 386 [2019-08-05 10:32:21,024 INFO L226 Difference]: Without dead ends: 385 [2019-08-05 10:32:21,024 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=151, Invalid=2501, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:32:21,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2019-08-05 10:32:21,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 366. [2019-08-05 10:32:21,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2019-08-05 10:32:21,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 398 transitions. [2019-08-05 10:32:21,027 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 398 transitions. Word has length 36 [2019-08-05 10:32:21,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:21,027 INFO L475 AbstractCegarLoop]: Abstraction has 366 states and 398 transitions. [2019-08-05 10:32:21,027 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-05 10:32:21,028 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 398 transitions. [2019-08-05 10:32:21,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-08-05 10:32:21,028 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:21,028 INFO L399 BasicCegarLoop]: trace histogram [16, 15, 1, 1, 1, 1, 1, 1] [2019-08-05 10:32:21,029 INFO L418 AbstractCegarLoop]: === Iteration 77 === [TimesVsAddErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:21,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:21,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1147654506, now seen corresponding path program 73 times [2019-08-05 10:32:21,029 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:21,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:21,043 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 34 conjunts are in the unsatisfiable core [2019-08-05 10:32:21,044 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:21,525 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 121 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:21,526 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:21,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-05 10:32:21,526 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 10:32:21,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 10:32:21,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=307, Invalid=883, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:32:21,527 INFO L87 Difference]: Start difference. First operand 366 states and 398 transitions. Second operand 35 states. [2019-08-05 10:32:22,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:22,912 INFO L93 Difference]: Finished difference Result 550 states and 570 transitions. [2019-08-05 10:32:22,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 10:32:22,913 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 37 [2019-08-05 10:32:22,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:22,916 INFO L225 Difference]: With dead ends: 550 [2019-08-05 10:32:22,916 INFO L226 Difference]: Without dead ends: 550 [2019-08-05 10:32:22,916 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 495 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=647, Invalid=2005, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:32:22,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2019-08-05 10:32:22,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 384. [2019-08-05 10:32:22,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2019-08-05 10:32:22,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 418 transitions. [2019-08-05 10:32:22,920 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 418 transitions. Word has length 37 [2019-08-05 10:32:22,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:22,921 INFO L475 AbstractCegarLoop]: Abstraction has 384 states and 418 transitions. [2019-08-05 10:32:22,921 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 10:32:22,921 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 418 transitions. [2019-08-05 10:32:22,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-08-05 10:32:22,921 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:22,921 INFO L399 BasicCegarLoop]: trace histogram [16, 15, 1, 1, 1, 1, 1, 1] [2019-08-05 10:32:22,922 INFO L418 AbstractCegarLoop]: === Iteration 78 === [TimesVsAddErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:22,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:22,922 INFO L82 PathProgramCache]: Analyzing trace with hash -1052259802, now seen corresponding path program 74 times [2019-08-05 10:32:22,922 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:22,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:22,933 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 34 conjunts are in the unsatisfiable core [2019-08-05 10:32:22,934 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:23,291 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 137 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:23,292 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:23,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-05 10:32:23,292 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 10:32:23,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 10:32:23,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=307, Invalid=883, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:32:23,293 INFO L87 Difference]: Start difference. First operand 384 states and 418 transitions. Second operand 35 states. [2019-08-05 10:32:27,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:27,591 INFO L93 Difference]: Finished difference Result 550 states and 567 transitions. [2019-08-05 10:32:27,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 154 states. [2019-08-05 10:32:27,592 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 37 [2019-08-05 10:32:27,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:27,593 INFO L225 Difference]: With dead ends: 550 [2019-08-05 10:32:27,593 INFO L226 Difference]: Without dead ends: 534 [2019-08-05 10:32:27,594 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9860 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=7277, Invalid=21453, Unknown=0, NotChecked=0, Total=28730 [2019-08-05 10:32:27,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2019-08-05 10:32:27,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 385. [2019-08-05 10:32:27,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2019-08-05 10:32:27,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 417 transitions. [2019-08-05 10:32:27,598 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 417 transitions. Word has length 37 [2019-08-05 10:32:27,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:27,598 INFO L475 AbstractCegarLoop]: Abstraction has 385 states and 417 transitions. [2019-08-05 10:32:27,598 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 10:32:27,598 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 417 transitions. [2019-08-05 10:32:27,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-08-05 10:32:27,599 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:27,599 INFO L399 BasicCegarLoop]: trace histogram [20, 5, 4, 4, 1, 1, 1, 1] [2019-08-05 10:32:27,599 INFO L418 AbstractCegarLoop]: === Iteration 79 === [TimesVsAddErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:27,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:27,600 INFO L82 PathProgramCache]: Analyzing trace with hash 1158306788, now seen corresponding path program 75 times [2019-08-05 10:32:27,600 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:27,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:27,610 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 68 conjunts are in the unsatisfiable core [2019-08-05 10:32:27,611 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:28,420 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:28,420 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:28,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-05 10:32:28,420 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 10:32:28,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 10:32:28,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1055, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:32:28,421 INFO L87 Difference]: Start difference. First operand 385 states and 417 transitions. Second operand 34 states. [2019-08-05 10:32:29,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:29,617 INFO L93 Difference]: Finished difference Result 400 states and 432 transitions. [2019-08-05 10:32:29,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-05 10:32:29,617 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 37 [2019-08-05 10:32:29,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:29,619 INFO L225 Difference]: With dead ends: 400 [2019-08-05 10:32:29,619 INFO L226 Difference]: Without dead ends: 393 [2019-08-05 10:32:29,620 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=91, Invalid=1469, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:32:29,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2019-08-05 10:32:29,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 392. [2019-08-05 10:32:29,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2019-08-05 10:32:29,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 424 transitions. [2019-08-05 10:32:29,623 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 424 transitions. Word has length 37 [2019-08-05 10:32:29,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:29,623 INFO L475 AbstractCegarLoop]: Abstraction has 392 states and 424 transitions. [2019-08-05 10:32:29,623 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 10:32:29,623 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 424 transitions. [2019-08-05 10:32:29,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-08-05 10:32:29,624 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:29,624 INFO L399 BasicCegarLoop]: trace histogram [18, 6, 6, 3, 1, 1, 1, 1] [2019-08-05 10:32:29,624 INFO L418 AbstractCegarLoop]: === Iteration 80 === [TimesVsAddErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:29,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:29,624 INFO L82 PathProgramCache]: Analyzing trace with hash -534348892, now seen corresponding path program 76 times [2019-08-05 10:32:29,625 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:29,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:29,634 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 64 conjunts are in the unsatisfiable core [2019-08-05 10:32:29,635 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:30,421 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 0 proven. 303 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:30,421 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:30,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-05 10:32:30,422 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 10:32:30,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 10:32:30,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=929, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:32:30,422 INFO L87 Difference]: Start difference. First operand 392 states and 424 transitions. Second operand 32 states. [2019-08-05 10:32:31,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:31,442 INFO L93 Difference]: Finished difference Result 403 states and 435 transitions. [2019-08-05 10:32:31,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-05 10:32:31,442 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 37 [2019-08-05 10:32:31,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:31,444 INFO L225 Difference]: With dead ends: 403 [2019-08-05 10:32:31,445 INFO L226 Difference]: Without dead ends: 398 [2019-08-05 10:32:31,445 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=79, Invalid=1181, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:32:31,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2019-08-05 10:32:31,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 397. [2019-08-05 10:32:31,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-08-05 10:32:31,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 429 transitions. [2019-08-05 10:32:31,449 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 429 transitions. Word has length 37 [2019-08-05 10:32:31,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:31,449 INFO L475 AbstractCegarLoop]: Abstraction has 397 states and 429 transitions. [2019-08-05 10:32:31,449 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 10:32:31,449 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 429 transitions. [2019-08-05 10:32:31,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-05 10:32:31,450 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:31,450 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 1, 1, 1, 1, 1, 1] [2019-08-05 10:32:31,450 INFO L418 AbstractCegarLoop]: === Iteration 81 === [TimesVsAddErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:31,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:31,451 INFO L82 PathProgramCache]: Analyzing trace with hash 1217549384, now seen corresponding path program 77 times [2019-08-05 10:32:31,451 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:31,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:31,464 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 76 conjunts are in the unsatisfiable core [2019-08-05 10:32:31,465 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:32,324 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 0 proven. 273 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:32,324 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:32,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-05 10:32:32,324 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-05 10:32:32,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-05 10:32:32,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=1331, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:32:32,325 INFO L87 Difference]: Start difference. First operand 397 states and 429 transitions. Second operand 38 states. [2019-08-05 10:32:34,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:34,337 INFO L93 Difference]: Finished difference Result 421 states and 455 transitions. [2019-08-05 10:32:34,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-05 10:32:34,338 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 38 [2019-08-05 10:32:34,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:34,340 INFO L225 Difference]: With dead ends: 421 [2019-08-05 10:32:34,340 INFO L226 Difference]: Without dead ends: 420 [2019-08-05 10:32:34,341 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=160, Invalid=2810, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:32:34,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2019-08-05 10:32:34,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 400. [2019-08-05 10:32:34,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2019-08-05 10:32:34,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 434 transitions. [2019-08-05 10:32:34,344 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 434 transitions. Word has length 38 [2019-08-05 10:32:34,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:34,344 INFO L475 AbstractCegarLoop]: Abstraction has 400 states and 434 transitions. [2019-08-05 10:32:34,344 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-05 10:32:34,344 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 434 transitions. [2019-08-05 10:32:34,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-05 10:32:34,345 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:34,345 INFO L399 BasicCegarLoop]: trace histogram [20, 10, 2, 2, 1, 1, 1, 1] [2019-08-05 10:32:34,345 INFO L418 AbstractCegarLoop]: === Iteration 82 === [TimesVsAddErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:34,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:34,345 INFO L82 PathProgramCache]: Analyzing trace with hash -1425048318, now seen corresponding path program 78 times [2019-08-05 10:32:34,346 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:34,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:34,359 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 74 conjunts are in the unsatisfiable core [2019-08-05 10:32:34,360 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:35,163 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:35,164 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:35,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-05 10:32:35,164 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-05 10:32:35,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-05 10:32:35,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1259, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:32:35,164 INFO L87 Difference]: Start difference. First operand 400 states and 434 transitions. Second operand 37 states. [2019-08-05 10:32:36,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:36,799 INFO L93 Difference]: Finished difference Result 425 states and 459 transitions. [2019-08-05 10:32:36,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-05 10:32:36,800 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 38 [2019-08-05 10:32:36,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:36,802 INFO L225 Difference]: With dead ends: 425 [2019-08-05 10:32:36,802 INFO L226 Difference]: Without dead ends: 413 [2019-08-05 10:32:36,802 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=117, Invalid=2139, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:32:36,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2019-08-05 10:32:36,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 412. [2019-08-05 10:32:36,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412 states. [2019-08-05 10:32:36,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 446 transitions. [2019-08-05 10:32:36,806 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 446 transitions. Word has length 38 [2019-08-05 10:32:36,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:36,806 INFO L475 AbstractCegarLoop]: Abstraction has 412 states and 446 transitions. [2019-08-05 10:32:36,806 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-05 10:32:36,806 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 446 transitions. [2019-08-05 10:32:36,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-05 10:32:36,807 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:36,807 INFO L399 BasicCegarLoop]: trace histogram [21, 7, 3, 3, 1, 1, 1, 1] [2019-08-05 10:32:36,807 INFO L418 AbstractCegarLoop]: === Iteration 83 === [TimesVsAddErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:36,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:36,807 INFO L82 PathProgramCache]: Analyzing trace with hash -700641588, now seen corresponding path program 79 times [2019-08-05 10:32:36,808 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:36,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:36,818 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 72 conjunts are in the unsatisfiable core [2019-08-05 10:32:36,819 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:37,584 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 310 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:37,585 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:37,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-05 10:32:37,585 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-05 10:32:37,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-05 10:32:37,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=1189, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:32:37,586 INFO L87 Difference]: Start difference. First operand 412 states and 446 transitions. Second operand 36 states. [2019-08-05 10:32:39,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:39,132 INFO L93 Difference]: Finished difference Result 431 states and 465 transitions. [2019-08-05 10:32:39,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-05 10:32:39,133 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 38 [2019-08-05 10:32:39,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:39,135 INFO L225 Difference]: With dead ends: 431 [2019-08-05 10:32:39,135 INFO L226 Difference]: Without dead ends: 422 [2019-08-05 10:32:39,136 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=103, Invalid=1789, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:32:39,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2019-08-05 10:32:39,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 421. [2019-08-05 10:32:39,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-08-05 10:32:39,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 455 transitions. [2019-08-05 10:32:39,140 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 455 transitions. Word has length 38 [2019-08-05 10:32:39,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:39,140 INFO L475 AbstractCegarLoop]: Abstraction has 421 states and 455 transitions. [2019-08-05 10:32:39,140 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-05 10:32:39,140 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 455 transitions. [2019-08-05 10:32:39,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-05 10:32:39,140 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:39,141 INFO L399 BasicCegarLoop]: trace histogram [20, 5, 5, 4, 1, 1, 1, 1] [2019-08-05 10:32:39,141 INFO L418 AbstractCegarLoop]: === Iteration 84 === [TimesVsAddErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:39,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:39,141 INFO L82 PathProgramCache]: Analyzing trace with hash 541921584, now seen corresponding path program 80 times [2019-08-05 10:32:39,141 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:39,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:39,150 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 68 conjunts are in the unsatisfiable core [2019-08-05 10:32:39,151 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:39,772 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:39,772 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:39,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-05 10:32:39,773 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 10:32:39,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 10:32:39,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1055, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:32:39,773 INFO L87 Difference]: Start difference. First operand 421 states and 455 transitions. Second operand 34 states. [2019-08-05 10:32:40,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:40,932 INFO L93 Difference]: Finished difference Result 434 states and 468 transitions. [2019-08-05 10:32:40,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-05 10:32:40,932 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 38 [2019-08-05 10:32:40,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:40,934 INFO L225 Difference]: With dead ends: 434 [2019-08-05 10:32:40,935 INFO L226 Difference]: Without dead ends: 428 [2019-08-05 10:32:40,935 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=87, Invalid=1395, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:32:40,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2019-08-05 10:32:40,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 427. [2019-08-05 10:32:40,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2019-08-05 10:32:40,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 461 transitions. [2019-08-05 10:32:40,938 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 461 transitions. Word has length 38 [2019-08-05 10:32:40,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:40,939 INFO L475 AbstractCegarLoop]: Abstraction has 427 states and 461 transitions. [2019-08-05 10:32:40,939 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 10:32:40,939 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 461 transitions. [2019-08-05 10:32:40,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-05 10:32:40,939 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:40,939 INFO L399 BasicCegarLoop]: trace histogram [16, 8, 8, 2, 1, 1, 1, 1] [2019-08-05 10:32:40,940 INFO L418 AbstractCegarLoop]: === Iteration 85 === [TimesVsAddErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:40,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:40,940 INFO L82 PathProgramCache]: Analyzing trace with hash -1262206114, now seen corresponding path program 81 times [2019-08-05 10:32:40,941 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:40,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:40,948 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 62 conjunts are in the unsatisfiable core [2019-08-05 10:32:40,949 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:41,710 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 0 proven. 315 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:41,710 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:41,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 10:32:41,711 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-05 10:32:41,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-05 10:32:41,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=869, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:32:41,711 INFO L87 Difference]: Start difference. First operand 427 states and 461 transitions. Second operand 31 states. [2019-08-05 10:32:42,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:42,657 INFO L93 Difference]: Finished difference Result 436 states and 470 transitions. [2019-08-05 10:32:42,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 10:32:42,658 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 38 [2019-08-05 10:32:42,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:42,660 INFO L225 Difference]: With dead ends: 436 [2019-08-05 10:32:42,660 INFO L226 Difference]: Without dead ends: 432 [2019-08-05 10:32:42,660 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=73, Invalid=1049, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:32:42,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2019-08-05 10:32:42,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 431. [2019-08-05 10:32:42,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 431 states. [2019-08-05 10:32:42,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 465 transitions. [2019-08-05 10:32:42,664 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 465 transitions. Word has length 38 [2019-08-05 10:32:42,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:42,665 INFO L475 AbstractCegarLoop]: Abstraction has 431 states and 465 transitions. [2019-08-05 10:32:42,665 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-05 10:32:42,665 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 465 transitions. [2019-08-05 10:32:42,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-05 10:32:42,666 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:42,666 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1] [2019-08-05 10:32:42,666 INFO L418 AbstractCegarLoop]: === Iteration 86 === [TimesVsAddErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:42,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:42,666 INFO L82 PathProgramCache]: Analyzing trace with hash -1045931060, now seen corresponding path program 82 times [2019-08-05 10:32:42,667 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:42,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:42,675 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 56 conjunts are in the unsatisfiable core [2019-08-05 10:32:42,676 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:43,343 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 0 proven. 298 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:43,344 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:43,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 10:32:43,344 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 10:32:43,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 10:32:43,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=701, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:32:43,345 INFO L87 Difference]: Start difference. First operand 431 states and 465 transitions. Second operand 28 states. [2019-08-05 10:32:44,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:44,141 INFO L93 Difference]: Finished difference Result 438 states and 472 transitions. [2019-08-05 10:32:44,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 10:32:44,141 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 38 [2019-08-05 10:32:44,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:44,143 INFO L225 Difference]: With dead ends: 438 [2019-08-05 10:32:44,144 INFO L226 Difference]: Without dead ends: 435 [2019-08-05 10:32:44,144 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=63, Invalid=807, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:32:44,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2019-08-05 10:32:44,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 434. [2019-08-05 10:32:44,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2019-08-05 10:32:44,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 468 transitions. [2019-08-05 10:32:44,148 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 468 transitions. Word has length 38 [2019-08-05 10:32:44,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:44,148 INFO L475 AbstractCegarLoop]: Abstraction has 434 states and 468 transitions. [2019-08-05 10:32:44,149 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 10:32:44,149 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 468 transitions. [2019-08-05 10:32:44,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-08-05 10:32:44,149 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:44,149 INFO L399 BasicCegarLoop]: trace histogram [17, 16, 1, 1, 1, 1, 1, 1] [2019-08-05 10:32:44,150 INFO L418 AbstractCegarLoop]: === Iteration 87 === [TimesVsAddErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:44,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:44,150 INFO L82 PathProgramCache]: Analyzing trace with hash -1432809882, now seen corresponding path program 83 times [2019-08-05 10:32:44,150 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:44,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:44,163 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 36 conjunts are in the unsatisfiable core [2019-08-05 10:32:44,164 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:44,736 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 137 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:44,736 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:44,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-05 10:32:44,736 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-05 10:32:44,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-05 10:32:44,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=343, Invalid=989, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:32:44,737 INFO L87 Difference]: Start difference. First operand 434 states and 468 transitions. Second operand 37 states. [2019-08-05 10:32:46,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:46,123 INFO L93 Difference]: Finished difference Result 638 states and 659 transitions. [2019-08-05 10:32:46,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-05 10:32:46,124 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 39 [2019-08-05 10:32:46,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:46,127 INFO L225 Difference]: With dead ends: 638 [2019-08-05 10:32:46,127 INFO L226 Difference]: Without dead ends: 638 [2019-08-05 10:32:46,127 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 560 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=721, Invalid=2249, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:32:46,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2019-08-05 10:32:46,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 453. [2019-08-05 10:32:46,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 453 states. [2019-08-05 10:32:46,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 489 transitions. [2019-08-05 10:32:46,131 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 489 transitions. Word has length 39 [2019-08-05 10:32:46,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:46,131 INFO L475 AbstractCegarLoop]: Abstraction has 453 states and 489 transitions. [2019-08-05 10:32:46,132 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-05 10:32:46,132 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 489 transitions. [2019-08-05 10:32:46,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-08-05 10:32:46,132 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:46,132 INFO L399 BasicCegarLoop]: trace histogram [17, 16, 1, 1, 1, 1, 1, 1] [2019-08-05 10:32:46,132 INFO L418 AbstractCegarLoop]: === Iteration 88 === [TimesVsAddErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:46,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:46,133 INFO L82 PathProgramCache]: Analyzing trace with hash -910676694, now seen corresponding path program 84 times [2019-08-05 10:32:46,133 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:46,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:46,144 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 36 conjunts are in the unsatisfiable core [2019-08-05 10:32:46,145 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:46,945 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 154 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:46,946 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:46,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-05 10:32:46,946 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-05 10:32:46,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-05 10:32:46,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=343, Invalid=989, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:32:46,946 INFO L87 Difference]: Start difference. First operand 453 states and 489 transitions. Second operand 37 states. [2019-08-05 10:32:52,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:52,340 INFO L93 Difference]: Finished difference Result 638 states and 656 transitions. [2019-08-05 10:32:52,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 172 states. [2019-08-05 10:32:52,340 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 39 [2019-08-05 10:32:52,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:52,342 INFO L225 Difference]: With dead ends: 638 [2019-08-05 10:32:52,343 INFO L226 Difference]: Without dead ends: 621 [2019-08-05 10:32:52,343 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 187 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12444 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=8875, Invalid=26657, Unknown=0, NotChecked=0, Total=35532 [2019-08-05 10:32:52,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2019-08-05 10:32:52,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 454. [2019-08-05 10:32:52,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 454 states. [2019-08-05 10:32:52,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 488 transitions. [2019-08-05 10:32:52,349 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 488 transitions. Word has length 39 [2019-08-05 10:32:52,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:52,349 INFO L475 AbstractCegarLoop]: Abstraction has 454 states and 488 transitions. [2019-08-05 10:32:52,349 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-05 10:32:52,349 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 488 transitions. [2019-08-05 10:32:52,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 10:32:52,350 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:52,350 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 1, 1, 1, 1, 1, 1] [2019-08-05 10:32:52,350 INFO L418 AbstractCegarLoop]: === Iteration 89 === [TimesVsAddErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:52,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:52,350 INFO L82 PathProgramCache]: Analyzing trace with hash -1467435316, now seen corresponding path program 85 times [2019-08-05 10:32:52,351 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:52,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:52,363 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 80 conjunts are in the unsatisfiable core [2019-08-05 10:32:52,364 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:53,664 INFO L134 CoverageAnalysis]: Checked inductivity of 307 backedges. 0 proven. 307 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:53,664 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:53,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-05 10:32:53,664 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-05 10:32:53,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-05 10:32:53,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1481, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:32:53,665 INFO L87 Difference]: Start difference. First operand 454 states and 488 transitions. Second operand 40 states. [2019-08-05 10:32:55,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:55,810 INFO L93 Difference]: Finished difference Result 479 states and 515 transitions. [2019-08-05 10:32:55,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-05 10:32:55,810 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 40 [2019-08-05 10:32:55,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:55,813 INFO L225 Difference]: With dead ends: 479 [2019-08-05 10:32:55,813 INFO L226 Difference]: Without dead ends: 478 [2019-08-05 10:32:55,813 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=169, Invalid=3137, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 10:32:55,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2019-08-05 10:32:55,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 457. [2019-08-05 10:32:55,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 457 states. [2019-08-05 10:32:55,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 493 transitions. [2019-08-05 10:32:55,817 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 493 transitions. Word has length 40 [2019-08-05 10:32:55,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:55,818 INFO L475 AbstractCegarLoop]: Abstraction has 457 states and 493 transitions. [2019-08-05 10:32:55,818 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-05 10:32:55,818 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 493 transitions. [2019-08-05 10:32:55,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-08-05 10:32:55,818 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:55,818 INFO L399 BasicCegarLoop]: trace histogram [18, 17, 1, 1, 1, 1, 1, 1] [2019-08-05 10:32:55,819 INFO L418 AbstractCegarLoop]: === Iteration 90 === [TimesVsAddErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:55,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:55,819 INFO L82 PathProgramCache]: Analyzing trace with hash -1547083414, now seen corresponding path program 86 times [2019-08-05 10:32:55,819 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:55,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:55,833 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 38 conjunts are in the unsatisfiable core [2019-08-05 10:32:55,834 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:56,391 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 154 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:56,391 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:56,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-05 10:32:56,392 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-05 10:32:56,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-05 10:32:56,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=381, Invalid=1101, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:32:56,392 INFO L87 Difference]: Start difference. First operand 457 states and 493 transitions. Second operand 39 states. [2019-08-05 10:32:57,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:57,754 INFO L93 Difference]: Finished difference Result 682 states and 704 transitions. [2019-08-05 10:32:57,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-05 10:32:57,754 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 41 [2019-08-05 10:32:57,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:57,757 INFO L225 Difference]: With dead ends: 682 [2019-08-05 10:32:57,757 INFO L226 Difference]: Without dead ends: 682 [2019-08-05 10:32:57,757 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 629 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=799, Invalid=2507, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 10:32:57,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2019-08-05 10:32:57,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 477. [2019-08-05 10:32:57,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 477 states. [2019-08-05 10:32:57,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 515 transitions. [2019-08-05 10:32:57,762 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 515 transitions. Word has length 41 [2019-08-05 10:32:57,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:57,762 INFO L475 AbstractCegarLoop]: Abstraction has 477 states and 515 transitions. [2019-08-05 10:32:57,762 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-05 10:32:57,762 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 515 transitions. [2019-08-05 10:32:57,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-08-05 10:32:57,763 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:57,763 INFO L399 BasicCegarLoop]: trace histogram [18, 17, 1, 1, 1, 1, 1, 1] [2019-08-05 10:32:57,763 INFO L418 AbstractCegarLoop]: === Iteration 91 === [TimesVsAddErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:57,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:57,763 INFO L82 PathProgramCache]: Analyzing trace with hash 1754143526, now seen corresponding path program 87 times [2019-08-05 10:32:57,764 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:57,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:57,772 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 38 conjunts are in the unsatisfiable core [2019-08-05 10:32:57,773 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:58,638 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 172 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:58,639 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:58,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-05 10:32:58,639 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-05 10:32:58,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-05 10:32:58,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=381, Invalid=1101, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:32:58,640 INFO L87 Difference]: Start difference. First operand 477 states and 515 transitions. Second operand 39 states. [2019-08-05 10:32:59,641 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 8 [2019-08-05 10:33:05,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:05,598 INFO L93 Difference]: Finished difference Result 682 states and 701 transitions. [2019-08-05 10:33:05,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 191 states. [2019-08-05 10:33:05,598 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 41 [2019-08-05 10:33:05,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:05,602 INFO L225 Difference]: With dead ends: 682 [2019-08-05 10:33:05,602 INFO L226 Difference]: Without dead ends: 664 [2019-08-05 10:33:05,603 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 207 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15504 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=10717, Invalid=32755, Unknown=0, NotChecked=0, Total=43472 [2019-08-05 10:33:05,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2019-08-05 10:33:05,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 478. [2019-08-05 10:33:05,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 478 states. [2019-08-05 10:33:05,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 514 transitions. [2019-08-05 10:33:05,608 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 514 transitions. Word has length 41 [2019-08-05 10:33:05,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:05,608 INFO L475 AbstractCegarLoop]: Abstraction has 478 states and 514 transitions. [2019-08-05 10:33:05,608 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-05 10:33:05,608 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 514 transitions. [2019-08-05 10:33:05,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-08-05 10:33:05,609 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:05,609 INFO L399 BasicCegarLoop]: trace histogram [22, 11, 2, 2, 1, 1, 1, 1] [2019-08-05 10:33:05,609 INFO L418 AbstractCegarLoop]: === Iteration 92 === [TimesVsAddErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:33:05,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:05,609 INFO L82 PathProgramCache]: Analyzing trace with hash 571623076, now seen corresponding path program 88 times [2019-08-05 10:33:05,609 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:05,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:05,619 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 80 conjunts are in the unsatisfiable core [2019-08-05 10:33:05,620 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:06,533 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:06,533 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:06,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-05 10:33:06,533 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-05 10:33:06,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-05 10:33:06,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1481, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:33:06,534 INFO L87 Difference]: Start difference. First operand 478 states and 514 transitions. Second operand 40 states. [2019-08-05 10:33:08,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:08,553 INFO L93 Difference]: Finished difference Result 505 states and 541 transitions. [2019-08-05 10:33:08,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-05 10:33:08,553 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 41 [2019-08-05 10:33:08,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:08,555 INFO L225 Difference]: With dead ends: 505 [2019-08-05 10:33:08,555 INFO L226 Difference]: Without dead ends: 492 [2019-08-05 10:33:08,555 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=127, Invalid=2525, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:33:08,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2019-08-05 10:33:08,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 491. [2019-08-05 10:33:08,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 491 states. [2019-08-05 10:33:08,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 527 transitions. [2019-08-05 10:33:08,559 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 527 transitions. Word has length 41 [2019-08-05 10:33:08,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:08,559 INFO L475 AbstractCegarLoop]: Abstraction has 491 states and 527 transitions. [2019-08-05 10:33:08,559 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-05 10:33:08,560 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 527 transitions. [2019-08-05 10:33:08,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-08-05 10:33:08,560 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:08,560 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1] [2019-08-05 10:33:08,560 INFO L418 AbstractCegarLoop]: === Iteration 93 === [TimesVsAddErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:33:08,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:08,561 INFO L82 PathProgramCache]: Analyzing trace with hash 1908815204, now seen corresponding path program 89 times [2019-08-05 10:33:08,561 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:08,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:08,566 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 60 conjunts are in the unsatisfiable core [2019-08-05 10:33:08,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:09,221 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 0 proven. 355 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:09,221 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:09,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 10:33:09,222 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 10:33:09,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 10:33:09,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=811, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:33:09,222 INFO L87 Difference]: Start difference. First operand 491 states and 527 transitions. Second operand 30 states. [2019-08-05 10:33:10,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:10,158 INFO L93 Difference]: Finished difference Result 498 states and 534 transitions. [2019-08-05 10:33:10,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 10:33:10,158 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 41 [2019-08-05 10:33:10,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:10,161 INFO L225 Difference]: With dead ends: 498 [2019-08-05 10:33:10,161 INFO L226 Difference]: Without dead ends: 495 [2019-08-05 10:33:10,161 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=67, Invalid=925, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:33:10,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2019-08-05 10:33:10,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 494. [2019-08-05 10:33:10,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 494 states. [2019-08-05 10:33:10,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 530 transitions. [2019-08-05 10:33:10,166 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 530 transitions. Word has length 41 [2019-08-05 10:33:10,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:10,166 INFO L475 AbstractCegarLoop]: Abstraction has 494 states and 530 transitions. [2019-08-05 10:33:10,166 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 10:33:10,166 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 530 transitions. [2019-08-05 10:33:10,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-05 10:33:10,167 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:10,167 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 1, 1, 1, 1, 1, 1] [2019-08-05 10:33:10,167 INFO L418 AbstractCegarLoop]: === Iteration 94 === [TimesVsAddErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:33:10,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:10,167 INFO L82 PathProgramCache]: Analyzing trace with hash -714947512, now seen corresponding path program 90 times [2019-08-05 10:33:10,168 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:10,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:10,182 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 84 conjunts are in the unsatisfiable core [2019-08-05 10:33:10,183 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:11,242 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 0 proven. 343 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:11,242 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:11,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-05 10:33:11,243 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-05 10:33:11,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-05 10:33:11,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1639, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:33:11,243 INFO L87 Difference]: Start difference. First operand 494 states and 530 transitions. Second operand 42 states. [2019-08-05 10:33:13,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:13,677 INFO L93 Difference]: Finished difference Result 520 states and 558 transitions. [2019-08-05 10:33:13,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-05 10:33:13,677 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 42 [2019-08-05 10:33:13,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:13,679 INFO L225 Difference]: With dead ends: 520 [2019-08-05 10:33:13,679 INFO L226 Difference]: Without dead ends: 519 [2019-08-05 10:33:13,679 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=178, Invalid=3482, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 10:33:13,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2019-08-05 10:33:13,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 497. [2019-08-05 10:33:13,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 497 states. [2019-08-05 10:33:13,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 535 transitions. [2019-08-05 10:33:13,695 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 535 transitions. Word has length 42 [2019-08-05 10:33:13,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:13,695 INFO L475 AbstractCegarLoop]: Abstraction has 497 states and 535 transitions. [2019-08-05 10:33:13,695 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-05 10:33:13,695 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 535 transitions. [2019-08-05 10:33:13,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-05 10:33:13,696 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:13,696 INFO L399 BasicCegarLoop]: trace histogram [24, 8, 3, 3, 1, 1, 1, 1] [2019-08-05 10:33:13,696 INFO L418 AbstractCegarLoop]: === Iteration 95 === [TimesVsAddErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:33:13,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:13,697 INFO L82 PathProgramCache]: Analyzing trace with hash -118798404, now seen corresponding path program 91 times [2019-08-05 10:33:13,697 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:13,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:13,709 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 80 conjunts are in the unsatisfiable core [2019-08-05 10:33:13,710 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:14,762 INFO L134 CoverageAnalysis]: Checked inductivity of 393 backedges. 0 proven. 393 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:14,762 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:14,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-05 10:33:14,762 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-05 10:33:14,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-05 10:33:14,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1481, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:33:14,763 INFO L87 Difference]: Start difference. First operand 497 states and 535 transitions. Second operand 40 states. [2019-08-05 10:33:16,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:16,536 INFO L93 Difference]: Finished difference Result 518 states and 556 transitions. [2019-08-05 10:33:16,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-05 10:33:16,537 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 42 [2019-08-05 10:33:16,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:16,540 INFO L225 Difference]: With dead ends: 518 [2019-08-05 10:33:16,540 INFO L226 Difference]: Without dead ends: 508 [2019-08-05 10:33:16,540 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=115, Invalid=2237, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:33:16,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2019-08-05 10:33:16,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 507. [2019-08-05 10:33:16,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 507 states. [2019-08-05 10:33:16,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 545 transitions. [2019-08-05 10:33:16,544 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 545 transitions. Word has length 42 [2019-08-05 10:33:16,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:16,545 INFO L475 AbstractCegarLoop]: Abstraction has 507 states and 545 transitions. [2019-08-05 10:33:16,545 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-05 10:33:16,545 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 545 transitions. [2019-08-05 10:33:16,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-05 10:33:16,545 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:16,546 INFO L399 BasicCegarLoop]: trace histogram [24, 6, 4, 4, 1, 1, 1, 1] [2019-08-05 10:33:16,546 INFO L418 AbstractCegarLoop]: === Iteration 96 === [TimesVsAddErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:33:16,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:16,546 INFO L82 PathProgramCache]: Analyzing trace with hash -1340856330, now seen corresponding path program 92 times [2019-08-05 10:33:16,546 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:16,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:16,556 INFO L256 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 78 conjunts are in the unsatisfiable core [2019-08-05 10:33:16,559 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:17,510 INFO L134 CoverageAnalysis]: Checked inductivity of 409 backedges. 0 proven. 409 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:17,510 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:17,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-05 10:33:17,511 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-05 10:33:17,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-05 10:33:17,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1405, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:33:17,511 INFO L87 Difference]: Start difference. First operand 507 states and 545 transitions. Second operand 39 states. [2019-08-05 10:33:19,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:19,200 INFO L93 Difference]: Finished difference Result 524 states and 562 transitions. [2019-08-05 10:33:19,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-05 10:33:19,201 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 42 [2019-08-05 10:33:19,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:19,203 INFO L225 Difference]: With dead ends: 524 [2019-08-05 10:33:19,204 INFO L226 Difference]: Without dead ends: 516 [2019-08-05 10:33:19,204 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=105, Invalid=1965, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:33:19,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2019-08-05 10:33:19,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 515. [2019-08-05 10:33:19,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 515 states. [2019-08-05 10:33:19,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 553 transitions. [2019-08-05 10:33:19,209 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 553 transitions. Word has length 42 [2019-08-05 10:33:19,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:19,209 INFO L475 AbstractCegarLoop]: Abstraction has 515 states and 553 transitions. [2019-08-05 10:33:19,209 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-05 10:33:19,209 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 553 transitions. [2019-08-05 10:33:19,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-05 10:33:19,210 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:19,210 INFO L399 BasicCegarLoop]: trace histogram [21, 7, 7, 3, 1, 1, 1, 1] [2019-08-05 10:33:19,210 INFO L418 AbstractCegarLoop]: === Iteration 97 === [TimesVsAddErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:33:19,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:19,211 INFO L82 PathProgramCache]: Analyzing trace with hash 1722835660, now seen corresponding path program 93 times [2019-08-05 10:33:19,211 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:19,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:19,220 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 72 conjunts are in the unsatisfiable core [2019-08-05 10:33:19,221 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:20,646 INFO L134 CoverageAnalysis]: Checked inductivity of 412 backedges. 0 proven. 412 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:20,647 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:20,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-05 10:33:20,647 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-05 10:33:20,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-05 10:33:20,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=1189, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:33:20,648 INFO L87 Difference]: Start difference. First operand 515 states and 553 transitions. Second operand 36 states. [2019-08-05 10:33:21,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:21,993 INFO L93 Difference]: Finished difference Result 526 states and 564 transitions. [2019-08-05 10:33:21,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-05 10:33:21,993 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 42 [2019-08-05 10:33:21,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:21,998 INFO L225 Difference]: With dead ends: 526 [2019-08-05 10:33:21,999 INFO L226 Difference]: Without dead ends: 521 [2019-08-05 10:33:21,999 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=87, Invalid=1473, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:33:22,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2019-08-05 10:33:22,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 520. [2019-08-05 10:33:22,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2019-08-05 10:33:22,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 558 transitions. [2019-08-05 10:33:22,005 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 558 transitions. Word has length 42 [2019-08-05 10:33:22,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:22,005 INFO L475 AbstractCegarLoop]: Abstraction has 520 states and 558 transitions. [2019-08-05 10:33:22,005 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-05 10:33:22,005 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 558 transitions. [2019-08-05 10:33:22,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-05 10:33:22,006 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:22,006 INFO L399 BasicCegarLoop]: trace histogram [18, 9, 9, 2, 1, 1, 1, 1] [2019-08-05 10:33:22,007 INFO L418 AbstractCegarLoop]: === Iteration 98 === [TimesVsAddErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:33:22,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:22,007 INFO L82 PathProgramCache]: Analyzing trace with hash -776550888, now seen corresponding path program 94 times [2019-08-05 10:33:22,008 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:22,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:22,017 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 68 conjunts are in the unsatisfiable core [2019-08-05 10:33:22,019 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:24,449 INFO L134 CoverageAnalysis]: Checked inductivity of 399 backedges. 0 proven. 399 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:24,449 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:24,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-05 10:33:24,450 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 10:33:24,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 10:33:24,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1055, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:33:24,450 INFO L87 Difference]: Start difference. First operand 520 states and 558 transitions. Second operand 34 states. [2019-08-05 10:33:25,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:25,601 INFO L93 Difference]: Finished difference Result 529 states and 567 transitions. [2019-08-05 10:33:25,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-05 10:33:25,602 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 42 [2019-08-05 10:33:25,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:25,604 INFO L225 Difference]: With dead ends: 529 [2019-08-05 10:33:25,605 INFO L226 Difference]: Without dead ends: 525 [2019-08-05 10:33:25,605 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=79, Invalid=1253, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:33:25,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2019-08-05 10:33:25,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 524. [2019-08-05 10:33:25,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 524 states. [2019-08-05 10:33:25,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 562 transitions. [2019-08-05 10:33:25,609 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 562 transitions. Word has length 42 [2019-08-05 10:33:25,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:25,609 INFO L475 AbstractCegarLoop]: Abstraction has 524 states and 562 transitions. [2019-08-05 10:33:25,609 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 10:33:25,610 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 562 transitions. [2019-08-05 10:33:25,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-08-05 10:33:25,610 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:25,610 INFO L399 BasicCegarLoop]: trace histogram [19, 18, 1, 1, 1, 1, 1, 1] [2019-08-05 10:33:25,610 INFO L418 AbstractCegarLoop]: === Iteration 99 === [TimesVsAddErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:33:25,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:25,611 INFO L82 PathProgramCache]: Analyzing trace with hash 52641638, now seen corresponding path program 95 times [2019-08-05 10:33:25,611 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:25,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:25,621 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 40 conjunts are in the unsatisfiable core [2019-08-05 10:33:25,622 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:26,166 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 172 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:26,166 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:26,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-05 10:33:26,167 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-05 10:33:26,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-05 10:33:26,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=421, Invalid=1219, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:33:26,167 INFO L87 Difference]: Start difference. First operand 524 states and 562 transitions. Second operand 41 states. [2019-08-05 10:33:27,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:27,188 INFO L93 Difference]: Finished difference Result 771 states and 794 transitions. [2019-08-05 10:33:27,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-05 10:33:27,189 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 43 [2019-08-05 10:33:27,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:27,191 INFO L225 Difference]: With dead ends: 771 [2019-08-05 10:33:27,191 INFO L226 Difference]: Without dead ends: 771 [2019-08-05 10:33:27,191 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 702 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=881, Invalid=2779, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 10:33:27,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 771 states. [2019-08-05 10:33:27,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 771 to 545. [2019-08-05 10:33:27,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 545 states. [2019-08-05 10:33:27,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 585 transitions. [2019-08-05 10:33:27,196 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 585 transitions. Word has length 43 [2019-08-05 10:33:27,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:27,196 INFO L475 AbstractCegarLoop]: Abstraction has 545 states and 585 transitions. [2019-08-05 10:33:27,196 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-05 10:33:27,196 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 585 transitions. [2019-08-05 10:33:27,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-08-05 10:33:27,197 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:27,197 INFO L399 BasicCegarLoop]: trace histogram [19, 18, 1, 1, 1, 1, 1, 1] [2019-08-05 10:33:27,197 INFO L418 AbstractCegarLoop]: === Iteration 100 === [TimesVsAddErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:33:27,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:27,197 INFO L82 PathProgramCache]: Analyzing trace with hash -688538326, now seen corresponding path program 96 times [2019-08-05 10:33:27,198 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:27,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:27,205 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 40 conjunts are in the unsatisfiable core [2019-08-05 10:33:27,206 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:27,769 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 191 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:27,769 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:27,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-05 10:33:27,769 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-05 10:33:27,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-05 10:33:27,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=421, Invalid=1219, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:33:27,770 INFO L87 Difference]: Start difference. First operand 545 states and 585 transitions. Second operand 41 states. [2019-08-05 10:33:35,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:35,620 INFO L93 Difference]: Finished difference Result 771 states and 791 transitions. [2019-08-05 10:33:35,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 211 states. [2019-08-05 10:33:35,620 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 43 [2019-08-05 10:33:35,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:35,623 INFO L225 Difference]: With dead ends: 771 [2019-08-05 10:33:35,623 INFO L226 Difference]: Without dead ends: 752 [2019-08-05 10:33:35,624 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 228 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19095 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=12826, Invalid=39844, Unknown=0, NotChecked=0, Total=52670 [2019-08-05 10:33:35,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2019-08-05 10:33:35,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 546. [2019-08-05 10:33:35,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 546 states. [2019-08-05 10:33:35,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 584 transitions. [2019-08-05 10:33:35,629 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 584 transitions. Word has length 43 [2019-08-05 10:33:35,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:35,629 INFO L475 AbstractCegarLoop]: Abstraction has 546 states and 584 transitions. [2019-08-05 10:33:35,629 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-05 10:33:35,629 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 584 transitions. [2019-08-05 10:33:35,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-08-05 10:33:35,630 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:35,630 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 1, 1, 1, 1, 1, 1] [2019-08-05 10:33:35,630 INFO L418 AbstractCegarLoop]: === Iteration 101 === [TimesVsAddErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:33:35,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:35,631 INFO L82 PathProgramCache]: Analyzing trace with hash 1631888844, now seen corresponding path program 97 times [2019-08-05 10:33:35,631 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:35,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:35,645 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 88 conjunts are in the unsatisfiable core [2019-08-05 10:33:35,647 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:36,930 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 381 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:36,930 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:36,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-05 10:33:36,931 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-05 10:33:36,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-05 10:33:36,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1805, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:33:36,932 INFO L87 Difference]: Start difference. First operand 546 states and 584 transitions. Second operand 44 states. [2019-08-05 10:33:39,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:39,825 INFO L93 Difference]: Finished difference Result 573 states and 613 transitions. [2019-08-05 10:33:39,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-05 10:33:39,825 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 44 [2019-08-05 10:33:39,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:39,828 INFO L225 Difference]: With dead ends: 573 [2019-08-05 10:33:39,829 INFO L226 Difference]: Without dead ends: 572 [2019-08-05 10:33:39,829 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=187, Invalid=3845, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 10:33:39,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2019-08-05 10:33:39,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 549. [2019-08-05 10:33:39,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 549 states. [2019-08-05 10:33:39,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 589 transitions. [2019-08-05 10:33:39,835 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 589 transitions. Word has length 44 [2019-08-05 10:33:39,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:39,835 INFO L475 AbstractCegarLoop]: Abstraction has 549 states and 589 transitions. [2019-08-05 10:33:39,835 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-05 10:33:39,836 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 589 transitions. [2019-08-05 10:33:39,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-08-05 10:33:39,836 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:39,837 INFO L399 BasicCegarLoop]: trace histogram [24, 12, 2, 2, 1, 1, 1, 1] [2019-08-05 10:33:39,837 INFO L418 AbstractCegarLoop]: === Iteration 102 === [TimesVsAddErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:33:39,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:39,837 INFO L82 PathProgramCache]: Analyzing trace with hash -1526463550, now seen corresponding path program 98 times [2019-08-05 10:33:39,838 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:39,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:39,847 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 86 conjunts are in the unsatisfiable core [2019-08-05 10:33:39,848 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:40,858 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:40,858 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:40,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-05 10:33:40,858 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-05 10:33:40,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-05 10:33:40,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1721, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:33:40,859 INFO L87 Difference]: Start difference. First operand 549 states and 589 transitions. Second operand 43 states. [2019-08-05 10:33:43,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:43,082 INFO L93 Difference]: Finished difference Result 578 states and 618 transitions. [2019-08-05 10:33:43,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-05 10:33:43,082 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 44 [2019-08-05 10:33:43,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:43,085 INFO L225 Difference]: With dead ends: 578 [2019-08-05 10:33:43,085 INFO L226 Difference]: Without dead ends: 564 [2019-08-05 10:33:43,086 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=137, Invalid=2943, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:33:43,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2019-08-05 10:33:43,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 563. [2019-08-05 10:33:43,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 563 states. [2019-08-05 10:33:43,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 603 transitions. [2019-08-05 10:33:43,091 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 603 transitions. Word has length 44 [2019-08-05 10:33:43,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:43,091 INFO L475 AbstractCegarLoop]: Abstraction has 563 states and 603 transitions. [2019-08-05 10:33:43,092 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-05 10:33:43,092 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 603 transitions. [2019-08-05 10:33:43,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-08-05 10:33:43,092 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:43,093 INFO L399 BasicCegarLoop]: trace histogram [25, 5, 5, 5, 1, 1, 1, 1] [2019-08-05 10:33:43,093 INFO L418 AbstractCegarLoop]: === Iteration 103 === [TimesVsAddErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:33:43,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:43,093 INFO L82 PathProgramCache]: Analyzing trace with hash -2086426932, now seen corresponding path program 99 times [2019-08-05 10:33:43,094 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:43,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:43,105 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 80 conjunts are in the unsatisfiable core [2019-08-05 10:33:43,106 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:44,708 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:44,708 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:44,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-05 10:33:44,708 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-05 10:33:44,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-05 10:33:44,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1481, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:33:44,709 INFO L87 Difference]: Start difference. First operand 563 states and 603 transitions. Second operand 40 states. [2019-08-05 10:33:46,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:46,296 INFO L93 Difference]: Finished difference Result 578 states and 618 transitions. [2019-08-05 10:33:46,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-05 10:33:46,297 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 44 [2019-08-05 10:33:46,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:46,299 INFO L225 Difference]: With dead ends: 578 [2019-08-05 10:33:46,300 INFO L226 Difference]: Without dead ends: 571 [2019-08-05 10:33:46,300 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=103, Invalid=1967, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:33:46,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2019-08-05 10:33:46,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 570. [2019-08-05 10:33:46,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 570 states. [2019-08-05 10:33:46,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 610 transitions. [2019-08-05 10:33:46,305 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 610 transitions. Word has length 44 [2019-08-05 10:33:46,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:46,305 INFO L475 AbstractCegarLoop]: Abstraction has 570 states and 610 transitions. [2019-08-05 10:33:46,305 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-05 10:33:46,305 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 610 transitions. [2019-08-05 10:33:46,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-08-05 10:33:46,306 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:46,306 INFO L399 BasicCegarLoop]: trace histogram [24, 6, 6, 4, 1, 1, 1, 1] [2019-08-05 10:33:46,306 INFO L418 AbstractCegarLoop]: === Iteration 104 === [TimesVsAddErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:33:46,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:46,306 INFO L82 PathProgramCache]: Analyzing trace with hash -179374166, now seen corresponding path program 100 times [2019-08-05 10:33:46,307 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:46,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:46,317 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 78 conjunts are in the unsatisfiable core [2019-08-05 10:33:46,318 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:47,157 INFO L134 CoverageAnalysis]: Checked inductivity of 466 backedges. 0 proven. 466 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:47,158 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:47,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-05 10:33:47,158 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-05 10:33:47,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-05 10:33:47,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1405, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:33:47,159 INFO L87 Difference]: Start difference. First operand 570 states and 610 transitions. Second operand 39 states. [2019-08-05 10:33:48,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:48,677 INFO L93 Difference]: Finished difference Result 583 states and 623 transitions. [2019-08-05 10:33:48,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-05 10:33:48,678 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 44 [2019-08-05 10:33:48,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:48,680 INFO L225 Difference]: With dead ends: 583 [2019-08-05 10:33:48,680 INFO L226 Difference]: Without dead ends: 577 [2019-08-05 10:33:48,680 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=97, Invalid=1795, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:33:48,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2019-08-05 10:33:48,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 576. [2019-08-05 10:33:48,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 576 states. [2019-08-05 10:33:48,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 616 transitions. [2019-08-05 10:33:48,685 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 616 transitions. Word has length 44 [2019-08-05 10:33:48,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:48,686 INFO L475 AbstractCegarLoop]: Abstraction has 576 states and 616 transitions. [2019-08-05 10:33:48,686 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-05 10:33:48,686 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 616 transitions. [2019-08-05 10:33:48,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-08-05 10:33:48,687 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:48,687 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1] [2019-08-05 10:33:48,687 INFO L418 AbstractCegarLoop]: === Iteration 105 === [TimesVsAddErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:33:48,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:48,687 INFO L82 PathProgramCache]: Analyzing trace with hash 1400034508, now seen corresponding path program 101 times [2019-08-05 10:33:48,688 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:48,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:48,694 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 64 conjunts are in the unsatisfiable core [2019-08-05 10:33:48,695 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:49,269 INFO L134 CoverageAnalysis]: Checked inductivity of 417 backedges. 0 proven. 417 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:49,270 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:49,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-05 10:33:49,270 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 10:33:49,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 10:33:49,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=929, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:33:49,271 INFO L87 Difference]: Start difference. First operand 576 states and 616 transitions. Second operand 32 states. [2019-08-05 10:33:50,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:50,679 INFO L93 Difference]: Finished difference Result 583 states and 623 transitions. [2019-08-05 10:33:50,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-05 10:33:50,679 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 44 [2019-08-05 10:33:50,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:50,680 INFO L225 Difference]: With dead ends: 583 [2019-08-05 10:33:50,681 INFO L226 Difference]: Without dead ends: 580 [2019-08-05 10:33:50,681 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=71, Invalid=1051, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:33:50,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2019-08-05 10:33:50,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 579. [2019-08-05 10:33:50,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 579 states. [2019-08-05 10:33:50,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 619 transitions. [2019-08-05 10:33:50,687 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 619 transitions. Word has length 44 [2019-08-05 10:33:50,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:50,688 INFO L475 AbstractCegarLoop]: Abstraction has 579 states and 619 transitions. [2019-08-05 10:33:50,688 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 10:33:50,688 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 619 transitions. [2019-08-05 10:33:50,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-08-05 10:33:50,688 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:50,689 INFO L399 BasicCegarLoop]: trace histogram [20, 19, 1, 1, 1, 1, 1, 1] [2019-08-05 10:33:50,689 INFO L418 AbstractCegarLoop]: === Iteration 106 === [TimesVsAddErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:33:50,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:50,689 INFO L82 PathProgramCache]: Analyzing trace with hash 550687082, now seen corresponding path program 102 times [2019-08-05 10:33:50,690 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:50,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:50,700 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 42 conjunts are in the unsatisfiable core [2019-08-05 10:33:50,703 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:51,338 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 191 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:51,339 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:51,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-05 10:33:51,339 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-05 10:33:51,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-05 10:33:51,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=463, Invalid=1343, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:33:51,339 INFO L87 Difference]: Start difference. First operand 579 states and 619 transitions. Second operand 43 states. [2019-08-05 10:33:52,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:52,578 INFO L93 Difference]: Finished difference Result 849 states and 873 transitions. [2019-08-05 10:33:52,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-05 10:33:52,579 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 45 [2019-08-05 10:33:52,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:52,581 INFO L225 Difference]: With dead ends: 849 [2019-08-05 10:33:52,581 INFO L226 Difference]: Without dead ends: 849 [2019-08-05 10:33:52,581 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 779 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=967, Invalid=3065, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 10:33:52,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 849 states. [2019-08-05 10:33:52,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 849 to 601. [2019-08-05 10:33:52,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 601 states. [2019-08-05 10:33:52,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 643 transitions. [2019-08-05 10:33:52,587 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 643 transitions. Word has length 45 [2019-08-05 10:33:52,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:52,587 INFO L475 AbstractCegarLoop]: Abstraction has 601 states and 643 transitions. [2019-08-05 10:33:52,587 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-05 10:33:52,587 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 643 transitions. [2019-08-05 10:33:52,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-08-05 10:33:52,588 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:52,588 INFO L399 BasicCegarLoop]: trace histogram [20, 19, 1, 1, 1, 1, 1, 1] [2019-08-05 10:33:52,588 INFO L418 AbstractCegarLoop]: === Iteration 107 === [TimesVsAddErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:33:52,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:52,588 INFO L82 PathProgramCache]: Analyzing trace with hash -951055322, now seen corresponding path program 103 times [2019-08-05 10:33:52,589 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:52,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:52,598 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 42 conjunts are in the unsatisfiable core [2019-08-05 10:33:52,599 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:53,682 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 211 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:53,683 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:53,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-05 10:33:53,683 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-05 10:33:53,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-05 10:33:53,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=463, Invalid=1343, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:33:53,684 INFO L87 Difference]: Start difference. First operand 601 states and 643 transitions. Second operand 43 states. [2019-08-05 10:34:02,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:02,123 INFO L93 Difference]: Finished difference Result 849 states and 870 transitions. [2019-08-05 10:34:02,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 232 states. [2019-08-05 10:34:02,124 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 45 [2019-08-05 10:34:02,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:02,125 INFO L225 Difference]: With dead ends: 849 [2019-08-05 10:34:02,125 INFO L226 Difference]: Without dead ends: 829 [2019-08-05 10:34:02,127 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 250 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23275 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=15226, Invalid=48026, Unknown=0, NotChecked=0, Total=63252 [2019-08-05 10:34:02,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829 states. [2019-08-05 10:34:02,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829 to 602. [2019-08-05 10:34:02,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2019-08-05 10:34:02,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 642 transitions. [2019-08-05 10:34:02,131 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 642 transitions. Word has length 45 [2019-08-05 10:34:02,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:02,131 INFO L475 AbstractCegarLoop]: Abstraction has 602 states and 642 transitions. [2019-08-05 10:34:02,131 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-05 10:34:02,131 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 642 transitions. [2019-08-05 10:34:02,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-08-05 10:34:02,131 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:02,132 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 1, 1, 1, 1, 1, 1] [2019-08-05 10:34:02,132 INFO L418 AbstractCegarLoop]: === Iteration 108 === [TimesVsAddErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:34:02,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:02,132 INFO L82 PathProgramCache]: Analyzing trace with hash -108571576, now seen corresponding path program 104 times [2019-08-05 10:34:02,132 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:02,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:02,149 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 92 conjunts are in the unsatisfiable core [2019-08-05 10:34:02,150 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:03,484 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 0 proven. 421 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:03,485 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:03,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-05 10:34:03,485 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-05 10:34:03,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-05 10:34:03,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=1979, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:34:03,486 INFO L87 Difference]: Start difference. First operand 602 states and 642 transitions. Second operand 46 states. [2019-08-05 10:34:06,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:06,497 INFO L93 Difference]: Finished difference Result 630 states and 672 transitions. [2019-08-05 10:34:06,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-05 10:34:06,497 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 46 [2019-08-05 10:34:06,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:06,499 INFO L225 Difference]: With dead ends: 630 [2019-08-05 10:34:06,499 INFO L226 Difference]: Without dead ends: 629 [2019-08-05 10:34:06,500 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=196, Invalid=4226, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:34:06,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2019-08-05 10:34:06,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 605. [2019-08-05 10:34:06,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2019-08-05 10:34:06,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 647 transitions. [2019-08-05 10:34:06,504 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 647 transitions. Word has length 46 [2019-08-05 10:34:06,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:06,504 INFO L475 AbstractCegarLoop]: Abstraction has 605 states and 647 transitions. [2019-08-05 10:34:06,504 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-05 10:34:06,504 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 647 transitions. [2019-08-05 10:34:06,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-08-05 10:34:06,505 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:06,505 INFO L399 BasicCegarLoop]: trace histogram [27, 9, 3, 3, 1, 1, 1, 1] [2019-08-05 10:34:06,505 INFO L418 AbstractCegarLoop]: === Iteration 109 === [TimesVsAddErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:34:06,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:06,506 INFO L82 PathProgramCache]: Analyzing trace with hash -205100084, now seen corresponding path program 105 times [2019-08-05 10:34:06,506 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:06,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:06,536 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 88 conjunts are in the unsatisfiable core [2019-08-05 10:34:06,537 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:07,665 INFO L134 CoverageAnalysis]: Checked inductivity of 486 backedges. 0 proven. 486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:07,666 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:07,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-05 10:34:07,666 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-05 10:34:07,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-05 10:34:07,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1805, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:34:07,666 INFO L87 Difference]: Start difference. First operand 605 states and 647 transitions. Second operand 44 states. [2019-08-05 10:34:09,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:09,763 INFO L93 Difference]: Finished difference Result 628 states and 670 transitions. [2019-08-05 10:34:09,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-05 10:34:09,764 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 46 [2019-08-05 10:34:09,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:09,765 INFO L225 Difference]: With dead ends: 628 [2019-08-05 10:34:09,766 INFO L226 Difference]: Without dead ends: 617 [2019-08-05 10:34:09,766 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=127, Invalid=2735, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:34:09,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2019-08-05 10:34:09,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 616. [2019-08-05 10:34:09,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 616 states. [2019-08-05 10:34:09,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 658 transitions. [2019-08-05 10:34:09,770 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 658 transitions. Word has length 46 [2019-08-05 10:34:09,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:09,771 INFO L475 AbstractCegarLoop]: Abstraction has 616 states and 658 transitions. [2019-08-05 10:34:09,771 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-05 10:34:09,771 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 658 transitions. [2019-08-05 10:34:09,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-08-05 10:34:09,771 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:09,771 INFO L399 BasicCegarLoop]: trace histogram [20, 10, 10, 2, 1, 1, 1, 1] [2019-08-05 10:34:09,771 INFO L418 AbstractCegarLoop]: === Iteration 110 === [TimesVsAddErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:34:09,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:09,772 INFO L82 PathProgramCache]: Analyzing trace with hash 1473600466, now seen corresponding path program 106 times [2019-08-05 10:34:09,772 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:09,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:09,781 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 74 conjunts are in the unsatisfiable core [2019-08-05 10:34:09,782 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:10,818 INFO L134 CoverageAnalysis]: Checked inductivity of 493 backedges. 0 proven. 493 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:10,819 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:10,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-05 10:34:10,819 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-05 10:34:10,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-05 10:34:10,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1259, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:34:10,819 INFO L87 Difference]: Start difference. First operand 616 states and 658 transitions. Second operand 37 states. [2019-08-05 10:34:12,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:12,167 INFO L93 Difference]: Finished difference Result 625 states and 667 transitions. [2019-08-05 10:34:12,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-05 10:34:12,167 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 46 [2019-08-05 10:34:12,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:12,169 INFO L225 Difference]: With dead ends: 625 [2019-08-05 10:34:12,169 INFO L226 Difference]: Without dead ends: 621 [2019-08-05 10:34:12,170 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=85, Invalid=1475, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:34:12,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2019-08-05 10:34:12,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 620. [2019-08-05 10:34:12,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620 states. [2019-08-05 10:34:12,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 662 transitions. [2019-08-05 10:34:12,174 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 662 transitions. Word has length 46 [2019-08-05 10:34:12,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:12,174 INFO L475 AbstractCegarLoop]: Abstraction has 620 states and 662 transitions. [2019-08-05 10:34:12,174 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-05 10:34:12,174 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 662 transitions. [2019-08-05 10:34:12,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 10:34:12,174 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:12,175 INFO L399 BasicCegarLoop]: trace histogram [21, 20, 1, 1, 1, 1, 1, 1] [2019-08-05 10:34:12,175 INFO L418 AbstractCegarLoop]: === Iteration 111 === [TimesVsAddErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:34:12,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:12,175 INFO L82 PathProgramCache]: Analyzing trace with hash 238620774, now seen corresponding path program 107 times [2019-08-05 10:34:12,175 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:12,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:12,186 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 44 conjunts are in the unsatisfiable core [2019-08-05 10:34:12,186 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:12,771 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 211 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:12,772 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:12,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-05 10:34:12,772 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-05 10:34:12,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-05 10:34:12,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=507, Invalid=1473, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:34:12,773 INFO L87 Difference]: Start difference. First operand 620 states and 662 transitions. Second operand 45 states. [2019-08-05 10:34:13,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:13,893 INFO L93 Difference]: Finished difference Result 914 states and 939 transitions. [2019-08-05 10:34:13,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-05 10:34:13,893 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 47 [2019-08-05 10:34:13,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:13,895 INFO L225 Difference]: With dead ends: 914 [2019-08-05 10:34:13,895 INFO L226 Difference]: Without dead ends: 914 [2019-08-05 10:34:13,896 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 860 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1057, Invalid=3365, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:34:13,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 914 states. [2019-08-05 10:34:13,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 914 to 643. [2019-08-05 10:34:13,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 643 states. [2019-08-05 10:34:13,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 687 transitions. [2019-08-05 10:34:13,901 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 687 transitions. Word has length 47 [2019-08-05 10:34:13,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:13,901 INFO L475 AbstractCegarLoop]: Abstraction has 643 states and 687 transitions. [2019-08-05 10:34:13,901 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-05 10:34:13,901 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 687 transitions. [2019-08-05 10:34:13,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 10:34:13,901 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:13,902 INFO L399 BasicCegarLoop]: trace histogram [21, 20, 1, 1, 1, 1, 1, 1] [2019-08-05 10:34:13,902 INFO L418 AbstractCegarLoop]: === Iteration 112 === [TimesVsAddErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:34:13,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:13,902 INFO L82 PathProgramCache]: Analyzing trace with hash 929246506, now seen corresponding path program 108 times [2019-08-05 10:34:13,903 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:13,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:13,912 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 44 conjunts are in the unsatisfiable core [2019-08-05 10:34:13,912 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:14,497 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 232 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:14,498 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:14,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-05 10:34:14,498 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-05 10:34:14,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-05 10:34:14,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=507, Invalid=1473, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:34:14,499 INFO L87 Difference]: Start difference. First operand 643 states and 687 transitions. Second operand 45 states. [2019-08-05 10:34:24,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:24,526 INFO L93 Difference]: Finished difference Result 914 states and 936 transitions. [2019-08-05 10:34:24,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 254 states. [2019-08-05 10:34:24,526 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 47 [2019-08-05 10:34:24,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:24,528 INFO L225 Difference]: With dead ends: 914 [2019-08-05 10:34:24,528 INFO L226 Difference]: Without dead ends: 893 [2019-08-05 10:34:24,529 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 273 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28105 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=17942, Invalid=57408, Unknown=0, NotChecked=0, Total=75350 [2019-08-05 10:34:24,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893 states. [2019-08-05 10:34:24,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893 to 644. [2019-08-05 10:34:24,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 644 states. [2019-08-05 10:34:24,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 686 transitions. [2019-08-05 10:34:24,534 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 686 transitions. Word has length 47 [2019-08-05 10:34:24,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:24,534 INFO L475 AbstractCegarLoop]: Abstraction has 644 states and 686 transitions. [2019-08-05 10:34:24,534 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-05 10:34:24,534 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 686 transitions. [2019-08-05 10:34:24,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 10:34:24,534 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:24,534 INFO L399 BasicCegarLoop]: trace histogram [26, 13, 2, 2, 1, 1, 1, 1] [2019-08-05 10:34:24,535 INFO L418 AbstractCegarLoop]: === Iteration 113 === [TimesVsAddErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:34:24,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:24,535 INFO L82 PathProgramCache]: Analyzing trace with hash -670831132, now seen corresponding path program 109 times [2019-08-05 10:34:24,535 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:24,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:24,546 INFO L256 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 92 conjunts are in the unsatisfiable core [2019-08-05 10:34:24,547 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:25,960 INFO L134 CoverageAnalysis]: Checked inductivity of 472 backedges. 0 proven. 472 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:25,961 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:25,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-05 10:34:25,961 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-05 10:34:25,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-05 10:34:25,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=1979, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:34:25,961 INFO L87 Difference]: Start difference. First operand 644 states and 686 transitions. Second operand 46 states. [2019-08-05 10:34:28,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:28,470 INFO L93 Difference]: Finished difference Result 675 states and 717 transitions. [2019-08-05 10:34:28,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-05 10:34:28,471 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 47 [2019-08-05 10:34:28,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:28,473 INFO L225 Difference]: With dead ends: 675 [2019-08-05 10:34:28,473 INFO L226 Difference]: Without dead ends: 660 [2019-08-05 10:34:28,473 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=147, Invalid=3393, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:34:28,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2019-08-05 10:34:28,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 659. [2019-08-05 10:34:28,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 659 states. [2019-08-05 10:34:28,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 701 transitions. [2019-08-05 10:34:28,479 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 701 transitions. Word has length 47 [2019-08-05 10:34:28,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:28,479 INFO L475 AbstractCegarLoop]: Abstraction has 659 states and 701 transitions. [2019-08-05 10:34:28,480 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-05 10:34:28,480 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 701 transitions. [2019-08-05 10:34:28,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 10:34:28,480 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:28,481 INFO L399 BasicCegarLoop]: trace histogram [28, 7, 4, 4, 1, 1, 1, 1] [2019-08-05 10:34:28,481 INFO L418 AbstractCegarLoop]: === Iteration 114 === [TimesVsAddErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:34:28,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:28,481 INFO L82 PathProgramCache]: Analyzing trace with hash -1313463004, now seen corresponding path program 110 times [2019-08-05 10:34:28,482 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:28,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:28,495 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 88 conjunts are in the unsatisfiable core [2019-08-05 10:34:28,496 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:29,688 INFO L134 CoverageAnalysis]: Checked inductivity of 534 backedges. 0 proven. 534 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:29,689 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:29,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-05 10:34:29,689 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-05 10:34:29,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-05 10:34:29,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1805, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:34:29,690 INFO L87 Difference]: Start difference. First operand 659 states and 701 transitions. Second operand 44 states. [2019-08-05 10:34:31,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:31,852 INFO L93 Difference]: Finished difference Result 678 states and 720 transitions. [2019-08-05 10:34:31,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-05 10:34:31,853 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 47 [2019-08-05 10:34:31,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:31,854 INFO L225 Difference]: With dead ends: 678 [2019-08-05 10:34:31,854 INFO L226 Difference]: Without dead ends: 669 [2019-08-05 10:34:31,855 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=119, Invalid=2533, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:34:31,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2019-08-05 10:34:31,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 668. [2019-08-05 10:34:31,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 668 states. [2019-08-05 10:34:31,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 668 states and 710 transitions. [2019-08-05 10:34:31,860 INFO L78 Accepts]: Start accepts. Automaton has 668 states and 710 transitions. Word has length 47 [2019-08-05 10:34:31,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:31,861 INFO L475 AbstractCegarLoop]: Abstraction has 668 states and 710 transitions. [2019-08-05 10:34:31,861 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-05 10:34:31,861 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 710 transitions. [2019-08-05 10:34:31,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 10:34:31,862 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:31,862 INFO L399 BasicCegarLoop]: trace histogram [24, 8, 8, 3, 1, 1, 1, 1] [2019-08-05 10:34:31,862 INFO L418 AbstractCegarLoop]: === Iteration 115 === [TimesVsAddErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:34:31,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:31,862 INFO L82 PathProgramCache]: Analyzing trace with hash 25212068, now seen corresponding path program 111 times [2019-08-05 10:34:31,863 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:31,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:31,873 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 80 conjunts are in the unsatisfiable core [2019-08-05 10:34:31,874 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:32,799 INFO L134 CoverageAnalysis]: Checked inductivity of 538 backedges. 0 proven. 538 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:32,799 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:32,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-05 10:34:32,800 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-05 10:34:32,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-05 10:34:32,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1481, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:34:32,800 INFO L87 Difference]: Start difference. First operand 668 states and 710 transitions. Second operand 40 states. [2019-08-05 10:34:34,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:34,377 INFO L93 Difference]: Finished difference Result 679 states and 721 transitions. [2019-08-05 10:34:34,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-05 10:34:34,378 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 47 [2019-08-05 10:34:34,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:34,380 INFO L225 Difference]: With dead ends: 679 [2019-08-05 10:34:34,381 INFO L226 Difference]: Without dead ends: 674 [2019-08-05 10:34:34,381 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=95, Invalid=1797, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:34:34,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2019-08-05 10:34:34,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 673. [2019-08-05 10:34:34,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 673 states. [2019-08-05 10:34:34,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 715 transitions. [2019-08-05 10:34:34,386 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 715 transitions. Word has length 47 [2019-08-05 10:34:34,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:34,386 INFO L475 AbstractCegarLoop]: Abstraction has 673 states and 715 transitions. [2019-08-05 10:34:34,386 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-05 10:34:34,386 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 715 transitions. [2019-08-05 10:34:34,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 10:34:34,387 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:34,387 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1] [2019-08-05 10:34:34,387 INFO L418 AbstractCegarLoop]: === Iteration 116 === [TimesVsAddErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:34:34,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:34,387 INFO L82 PathProgramCache]: Analyzing trace with hash 1253907556, now seen corresponding path program 112 times [2019-08-05 10:34:34,388 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:34,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:34,394 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 68 conjunts are in the unsatisfiable core [2019-08-05 10:34:34,394 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:35,046 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:35,046 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:35,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-05 10:34:35,047 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 10:34:35,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 10:34:35,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1055, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:34:35,047 INFO L87 Difference]: Start difference. First operand 673 states and 715 transitions. Second operand 34 states. [2019-08-05 10:34:36,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:36,337 INFO L93 Difference]: Finished difference Result 680 states and 722 transitions. [2019-08-05 10:34:36,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-05 10:34:36,337 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 47 [2019-08-05 10:34:36,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:36,339 INFO L225 Difference]: With dead ends: 680 [2019-08-05 10:34:36,339 INFO L226 Difference]: Without dead ends: 677 [2019-08-05 10:34:36,339 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=75, Invalid=1185, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:34:36,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2019-08-05 10:34:36,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 676. [2019-08-05 10:34:36,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 676 states. [2019-08-05 10:34:36,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 676 states and 718 transitions. [2019-08-05 10:34:36,345 INFO L78 Accepts]: Start accepts. Automaton has 676 states and 718 transitions. Word has length 47 [2019-08-05 10:34:36,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:36,345 INFO L475 AbstractCegarLoop]: Abstraction has 676 states and 718 transitions. [2019-08-05 10:34:36,345 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 10:34:36,345 INFO L276 IsEmpty]: Start isEmpty. Operand 676 states and 718 transitions. [2019-08-05 10:34:36,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-08-05 10:34:36,346 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:36,346 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 1, 1, 1, 1, 1, 1] [2019-08-05 10:34:36,347 INFO L418 AbstractCegarLoop]: === Iteration 117 === [TimesVsAddErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:34:36,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:36,347 INFO L82 PathProgramCache]: Analyzing trace with hash -1192692532, now seen corresponding path program 113 times [2019-08-05 10:34:36,347 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:36,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:36,365 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 96 conjunts are in the unsatisfiable core [2019-08-05 10:34:36,366 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:37,898 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 0 proven. 463 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:37,899 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:37,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-05 10:34:37,899 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-05 10:34:37,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-05 10:34:37,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=2161, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:34:37,900 INFO L87 Difference]: Start difference. First operand 676 states and 718 transitions. Second operand 48 states. [2019-08-05 10:34:41,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:41,112 INFO L93 Difference]: Finished difference Result 705 states and 749 transitions. [2019-08-05 10:34:41,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-05 10:34:41,112 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 48 [2019-08-05 10:34:41,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:41,114 INFO L225 Difference]: With dead ends: 705 [2019-08-05 10:34:41,114 INFO L226 Difference]: Without dead ends: 704 [2019-08-05 10:34:41,114 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 319 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=205, Invalid=4625, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 10:34:41,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2019-08-05 10:34:41,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 679. [2019-08-05 10:34:41,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 679 states. [2019-08-05 10:34:41,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 679 states and 723 transitions. [2019-08-05 10:34:41,118 INFO L78 Accepts]: Start accepts. Automaton has 679 states and 723 transitions. Word has length 48 [2019-08-05 10:34:41,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:41,118 INFO L475 AbstractCegarLoop]: Abstraction has 679 states and 723 transitions. [2019-08-05 10:34:41,118 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-05 10:34:41,118 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 723 transitions. [2019-08-05 10:34:41,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-08-05 10:34:41,119 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:41,119 INFO L399 BasicCegarLoop]: trace histogram [22, 21, 1, 1, 1, 1, 1, 1] [2019-08-05 10:34:41,119 INFO L418 AbstractCegarLoop]: === Iteration 118 === [TimesVsAddErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:34:41,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:41,119 INFO L82 PathProgramCache]: Analyzing trace with hash 1746674026, now seen corresponding path program 114 times [2019-08-05 10:34:41,120 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:41,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:41,134 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 46 conjunts are in the unsatisfiable core [2019-08-05 10:34:41,135 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:44,411 INFO L134 CoverageAnalysis]: Checked inductivity of 485 backedges. 232 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:44,411 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:44,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-05 10:34:44,411 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-05 10:34:44,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-05 10:34:44,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=553, Invalid=1609, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:34:44,412 INFO L87 Difference]: Start difference. First operand 679 states and 723 transitions. Second operand 47 states. [2019-08-05 10:34:46,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:46,492 INFO L93 Difference]: Finished difference Result 998 states and 1024 transitions. [2019-08-05 10:34:46,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-05 10:34:46,492 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 49 [2019-08-05 10:34:46,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:46,495 INFO L225 Difference]: With dead ends: 998 [2019-08-05 10:34:46,495 INFO L226 Difference]: Without dead ends: 998 [2019-08-05 10:34:46,496 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 945 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=1151, Invalid=3679, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 10:34:46,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 998 states. [2019-08-05 10:34:46,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 998 to 703. [2019-08-05 10:34:46,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 703 states. [2019-08-05 10:34:46,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 703 states and 749 transitions. [2019-08-05 10:34:46,502 INFO L78 Accepts]: Start accepts. Automaton has 703 states and 749 transitions. Word has length 49 [2019-08-05 10:34:46,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:46,502 INFO L475 AbstractCegarLoop]: Abstraction has 703 states and 749 transitions. [2019-08-05 10:34:46,503 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-05 10:34:46,503 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 749 transitions. [2019-08-05 10:34:46,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-08-05 10:34:46,503 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:46,504 INFO L399 BasicCegarLoop]: trace histogram [22, 21, 1, 1, 1, 1, 1, 1] [2019-08-05 10:34:46,504 INFO L418 AbstractCegarLoop]: === Iteration 119 === [TimesVsAddErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:34:46,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:46,504 INFO L82 PathProgramCache]: Analyzing trace with hash 1681235238, now seen corresponding path program 115 times [2019-08-05 10:34:46,505 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:46,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:46,519 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 46 conjunts are in the unsatisfiable core [2019-08-05 10:34:46,521 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:47,274 INFO L134 CoverageAnalysis]: Checked inductivity of 485 backedges. 254 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:47,274 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:47,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-05 10:34:47,274 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-05 10:34:47,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-05 10:34:47,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=553, Invalid=1609, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:34:47,275 INFO L87 Difference]: Start difference. First operand 703 states and 749 transitions. Second operand 47 states. Received shutdown request... [2019-08-05 10:34:51,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 171 states. [2019-08-05 10:34:51,800 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-05 10:34:51,804 WARN L223 ceAbstractionStarter]: Timeout [2019-08-05 10:34:51,805 INFO L202 PluginConnector]: Adding new model INT_times_vs_add.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:34:51 BoogieIcfgContainer [2019-08-05 10:34:51,805 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:34:51,807 INFO L168 Benchmark]: Toolchain (without parser) took 242431.52 ms. Allocated memory was 140.5 MB in the beginning and 366.5 MB in the end (delta: 226.0 MB). Free memory was 110.1 MB in the beginning and 267.6 MB in the end (delta: -157.5 MB). Peak memory consumption was 68.5 MB. Max. memory is 7.1 GB. [2019-08-05 10:34:51,807 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 140.5 MB. Free memory was 111.4 MB in the beginning and 111.2 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-08-05 10:34:51,808 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.78 ms. Allocated memory is still 140.5 MB. Free memory was 110.1 MB in the beginning and 108.3 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. [2019-08-05 10:34:51,808 INFO L168 Benchmark]: Boogie Preprocessor took 22.85 ms. Allocated memory is still 140.5 MB. Free memory was 108.3 MB in the beginning and 107.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-08-05 10:34:51,809 INFO L168 Benchmark]: RCFGBuilder took 279.67 ms. Allocated memory is still 140.5 MB. Free memory was 107.0 MB in the beginning and 97.1 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. [2019-08-05 10:34:51,809 INFO L168 Benchmark]: TraceAbstraction took 242090.90 ms. Allocated memory was 140.5 MB in the beginning and 366.5 MB in the end (delta: 226.0 MB). Free memory was 96.7 MB in the beginning and 267.6 MB in the end (delta: -170.9 MB). Peak memory consumption was 55.1 MB. Max. memory is 7.1 GB. [2019-08-05 10:34:51,812 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 140.5 MB. Free memory was 111.4 MB in the beginning and 111.2 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 33.78 ms. Allocated memory is still 140.5 MB. Free memory was 110.1 MB in the beginning and 108.3 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 22.85 ms. Allocated memory is still 140.5 MB. Free memory was 108.3 MB in the beginning and 107.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 279.67 ms. Allocated memory is still 140.5 MB. Free memory was 107.0 MB in the beginning and 97.1 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 242090.90 ms. Allocated memory was 140.5 MB in the beginning and 366.5 MB in the end (delta: 226.0 MB). Free memory was 96.7 MB in the beginning and 267.6 MB in the end (delta: -170.9 MB). Peak memory consumption was 55.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 33]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 33). Cancelled while BasicCegarLoop was constructing difference of abstraction (703states) and FLOYD_HOARE automaton (currently 171 states, 47 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 193 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 1 error locations. TIMEOUT Result, 242.0s OverallTime, 119 OverallIterations, 28 TraceHistogramMax, 169.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 472 SDtfs, 3002 SDslu, 2898 SDs, 0 SdLazy, 107369 SolverSat, 22700 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 82.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6105 GetRequests, 418 SyntacticMatches, 0 SemanticMatches, 5686 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160418 ImplicationChecksByTransitivity, 135.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=703occurred in iteration=118, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 118 MinimizatonAttempts, 4799 StatesRemovedByMinimization, 118 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 70.3s InterpolantComputationTime, 3535 NumberOfCodeBlocks, 3535 NumberOfCodeBlocksAsserted, 119 NumberOfCheckSat, 3416 ConstructedInterpolants, 118 QuantifiedInterpolants, 962678 SizeOfPredicates, 236 NumberOfNonLiveVariables, 16244 ConjunctsInSsa, 5284 ConjunctsInUnsatCore, 119 InterpolantComputations, 2 PerfectInterpolantSequences, 3839/24083 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown