java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:31:47,013 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:31:47,014 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:31:47,027 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:31:47,027 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:31:47,029 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:31:47,031 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:31:47,033 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:31:47,035 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:31:47,036 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:31:47,041 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:31:47,041 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:31:47,041 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:31:47,046 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:31:47,047 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:31:47,048 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:31:47,048 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:31:47,049 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:31:47,051 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:31:47,053 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:31:47,054 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:31:47,055 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:31:47,056 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:31:47,057 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:31:47,059 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:31:47,059 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:31:47,060 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:31:47,062 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:31:47,062 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:31:47,066 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:31:47,066 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:31:47,067 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:31:47,068 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:31:47,070 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:31:47,072 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:31:47,072 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:31:47,073 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:31:47,073 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:31:47,073 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:31:47,074 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:31:47,075 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:31:47,108 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:31:47,127 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:31:47,131 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:31:47,133 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:31:47,133 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:31:47,134 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl [2019-08-05 10:31:47,135 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl' [2019-08-05 10:31:47,170 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:31:47,171 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:31:47,172 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:31:47,172 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:31:47,172 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:31:47,189 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:31:47" (1/1) ... [2019-08-05 10:31:47,199 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:31:47" (1/1) ... [2019-08-05 10:31:47,205 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 10:31:47,205 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 10:31:47,205 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 10:31:47,207 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:31:47,208 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:31:47,209 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:31:47,209 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:31:47,219 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:31:47" (1/1) ... [2019-08-05 10:31:47,220 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:31:47" (1/1) ... [2019-08-05 10:31:47,220 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:31:47" (1/1) ... [2019-08-05 10:31:47,221 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:31:47" (1/1) ... [2019-08-05 10:31:47,223 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:31:47" (1/1) ... [2019-08-05 10:31:47,228 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:31:47" (1/1) ... [2019-08-05 10:31:47,229 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:31:47" (1/1) ... [2019-08-05 10:31:47,230 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:31:47,231 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:31:47,231 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:31:47,231 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:31:47,232 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:31:47" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-08-05 10:31:47,302 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2019-08-05 10:31:47,302 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-08-05 10:31:47,302 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-08-05 10:31:47,533 INFO L275 CfgBuilder]: Using library mode [2019-08-05 10:31:47,534 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 10:31:47,535 INFO L202 PluginConnector]: Adding new model BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:31:47 BoogieIcfgContainer [2019-08-05 10:31:47,535 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:31:47,536 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:31:47,536 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:31:47,539 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:31:47,540 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:31:47" (1/2) ... [2019-08-05 10:31:47,541 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35712e13 and model type BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:31:47, skipping insertion in model container [2019-08-05 10:31:47,541 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:31:47" (2/2) ... [2019-08-05 10:31:47,543 INFO L109 eAbstractionObserver]: Analyzing ICFG BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl [2019-08-05 10:31:47,553 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:31:47,560 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-08-05 10:31:47,577 INFO L252 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-08-05 10:31:47,602 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:31:47,603 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:31:47,603 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:31:47,604 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:31:47,604 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:31:47,604 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:31:47,604 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:31:47,604 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:31:47,605 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:31:47,619 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2019-08-05 10:31:47,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 10:31:47,627 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:47,628 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 10:31:47,630 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:47,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:47,636 INFO L82 PathProgramCache]: Analyzing trace with hash 30176, now seen corresponding path program 1 times [2019-08-05 10:31:47,685 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:47,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:47,718 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:31:47,722 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:47,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:47,798 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:31:47,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:31:47,805 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:31:47,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:31:47,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:31:47,833 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2019-08-05 10:31:47,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:47,897 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-05 10:31:47,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:31:47,899 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-05 10:31:47,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:47,910 INFO L225 Difference]: With dead ends: 8 [2019-08-05 10:31:47,910 INFO L226 Difference]: Without dead ends: 7 [2019-08-05 10:31:47,912 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:31:47,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-05 10:31:47,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-05 10:31:47,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 10:31:47,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-08-05 10:31:47,947 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 3 [2019-08-05 10:31:47,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:47,948 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-08-05 10:31:47,948 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:31:47,948 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-08-05 10:31:47,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 10:31:47,949 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:47,949 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 10:31:47,950 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:47,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:47,950 INFO L82 PathProgramCache]: Analyzing trace with hash 943126, now seen corresponding path program 1 times [2019-08-05 10:31:47,951 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:47,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:47,966 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:31:47,969 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:48,022 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:48,132 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:48,133 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:48,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 10:31:48,135 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:31:48,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:31:48,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:31:48,136 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 4 states. [2019-08-05 10:31:48,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:48,170 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-05 10:31:48,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:31:48,171 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-08-05 10:31:48,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:48,171 INFO L225 Difference]: With dead ends: 8 [2019-08-05 10:31:48,172 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 10:31:48,173 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:31:48,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 10:31:48,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-05 10:31:48,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 10:31:48,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-08-05 10:31:48,175 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2019-08-05 10:31:48,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:48,176 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-08-05 10:31:48,176 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:31:48,176 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-08-05 10:31:48,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 10:31:48,177 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:48,177 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-08-05 10:31:48,177 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:48,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:48,178 INFO L82 PathProgramCache]: Analyzing trace with hash 29244576, now seen corresponding path program 2 times [2019-08-05 10:31:48,179 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:48,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:48,191 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 10:31:48,192 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:48,211 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:48,269 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:48,324 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:48,325 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:48,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:31:48,325 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:31:48,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:31:48,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:31:48,327 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 5 states. [2019-08-05 10:31:48,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:48,350 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-08-05 10:31:48,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:31:48,354 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-08-05 10:31:48,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:48,355 INFO L225 Difference]: With dead ends: 9 [2019-08-05 10:31:48,355 INFO L226 Difference]: Without dead ends: 9 [2019-08-05 10:31:48,356 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:31:48,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-05 10:31:48,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-08-05 10:31:48,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 10:31:48,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-08-05 10:31:48,358 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2019-08-05 10:31:48,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:48,359 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-08-05 10:31:48,359 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:31:48,359 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-08-05 10:31:48,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:31:48,360 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:48,360 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-08-05 10:31:48,360 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:48,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:48,361 INFO L82 PathProgramCache]: Analyzing trace with hash 906589526, now seen corresponding path program 3 times [2019-08-05 10:31:48,366 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:48,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:48,386 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 10:31:48,387 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:48,422 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:48,485 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:48,587 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:48,718 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 3 [2019-08-05 10:31:48,719 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:48,720 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:48,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:31:48,720 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:31:48,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:31:48,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:31:48,722 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 6 states. [2019-08-05 10:31:48,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:48,778 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-08-05 10:31:48,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:31:48,779 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-08-05 10:31:48,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:48,780 INFO L225 Difference]: With dead ends: 10 [2019-08-05 10:31:48,780 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 10:31:48,781 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:31:48,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 10:31:48,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-08-05 10:31:48,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 10:31:48,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-08-05 10:31:48,785 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 6 [2019-08-05 10:31:48,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:48,785 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-08-05 10:31:48,785 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:31:48,785 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-08-05 10:31:48,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 10:31:48,786 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:48,786 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-08-05 10:31:48,787 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:48,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:48,787 INFO L82 PathProgramCache]: Analyzing trace with hash -1960488096, now seen corresponding path program 4 times [2019-08-05 10:31:48,788 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:48,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:48,817 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:31:48,818 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:48,848 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:48,950 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:49,007 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:49,045 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:49,108 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:49,108 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:49,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:31:49,109 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:31:49,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:31:49,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:31:49,110 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 7 states. [2019-08-05 10:31:49,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:49,155 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-08-05 10:31:49,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:31:49,155 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-08-05 10:31:49,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:49,156 INFO L225 Difference]: With dead ends: 11 [2019-08-05 10:31:49,156 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 10:31:49,156 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:31:49,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 10:31:49,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-05 10:31:49,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 10:31:49,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-08-05 10:31:49,159 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 7 [2019-08-05 10:31:49,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:49,160 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-08-05 10:31:49,160 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:31:49,160 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-08-05 10:31:49,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:31:49,160 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:49,160 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2019-08-05 10:31:49,161 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:49,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:49,161 INFO L82 PathProgramCache]: Analyzing trace with hash -645581162, now seen corresponding path program 5 times [2019-08-05 10:31:49,162 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:49,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:49,178 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:31:49,179 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:49,228 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:49,297 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:49,323 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:49,365 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:49,454 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:49,485 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:49,485 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:49,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:31:49,486 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:31:49,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:31:49,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:31:49,487 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 8 states. [2019-08-05 10:31:49,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:49,514 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-08-05 10:31:49,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:31:49,515 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-08-05 10:31:49,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:49,515 INFO L225 Difference]: With dead ends: 12 [2019-08-05 10:31:49,515 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 10:31:49,516 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:31:49,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 10:31:49,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-08-05 10:31:49,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 10:31:49,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-08-05 10:31:49,519 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 8 [2019-08-05 10:31:49,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:49,519 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-08-05 10:31:49,519 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:31:49,519 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-08-05 10:31:49,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 10:31:49,520 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:49,520 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2019-08-05 10:31:49,520 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:49,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:49,521 INFO L82 PathProgramCache]: Analyzing trace with hash 1461828128, now seen corresponding path program 6 times [2019-08-05 10:31:49,521 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:49,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:49,540 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:31:49,541 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:49,563 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:49,600 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:49,651 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:49,678 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:49,936 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 3 [2019-08-05 10:31:49,937 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:50,016 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:50,051 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:50,052 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:50,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:31:50,052 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:31:50,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:31:50,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:31:50,053 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 9 states. [2019-08-05 10:31:50,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:50,089 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-08-05 10:31:50,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:31:50,091 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-08-05 10:31:50,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:50,092 INFO L225 Difference]: With dead ends: 13 [2019-08-05 10:31:50,092 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 10:31:50,093 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:31:50,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 10:31:50,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-08-05 10:31:50,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 10:31:50,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-08-05 10:31:50,095 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 9 [2019-08-05 10:31:50,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:50,095 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-08-05 10:31:50,095 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:31:50,095 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-08-05 10:31:50,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 10:31:50,096 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:50,096 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2019-08-05 10:31:50,096 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:50,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:50,097 INFO L82 PathProgramCache]: Analyzing trace with hash -1927960618, now seen corresponding path program 7 times [2019-08-05 10:31:50,097 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:50,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:50,123 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:31:50,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:50,141 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:50,176 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:50,217 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:50,243 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:50,280 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:50,298 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:50,350 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:50,382 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:50,383 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:50,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:31:50,384 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:31:50,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:31:50,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:31:50,385 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 10 states. [2019-08-05 10:31:50,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:50,426 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-08-05 10:31:50,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:31:50,427 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2019-08-05 10:31:50,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:50,427 INFO L225 Difference]: With dead ends: 14 [2019-08-05 10:31:50,427 INFO L226 Difference]: Without dead ends: 14 [2019-08-05 10:31:50,428 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:31:50,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-05 10:31:50,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-08-05 10:31:50,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-05 10:31:50,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-08-05 10:31:50,430 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 10 [2019-08-05 10:31:50,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:50,430 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-08-05 10:31:50,431 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:31:50,431 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-08-05 10:31:50,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 10:31:50,431 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:50,431 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2019-08-05 10:31:50,431 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:50,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:50,432 INFO L82 PathProgramCache]: Analyzing trace with hash 362770656, now seen corresponding path program 8 times [2019-08-05 10:31:50,433 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:50,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:50,452 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 10:31:50,453 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:50,486 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:50,533 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:50,548 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:50,569 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:50,593 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:50,612 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:50,647 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:50,708 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:50,735 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:50,735 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:50,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:31:50,736 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:31:50,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:31:50,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:31:50,737 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 11 states. [2019-08-05 10:31:50,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:50,777 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-08-05 10:31:50,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:31:50,777 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2019-08-05 10:31:50,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:50,778 INFO L225 Difference]: With dead ends: 15 [2019-08-05 10:31:50,778 INFO L226 Difference]: Without dead ends: 15 [2019-08-05 10:31:50,778 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:31:50,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-05 10:31:50,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-08-05 10:31:50,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 10:31:50,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-08-05 10:31:50,782 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 11 [2019-08-05 10:31:50,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:50,783 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-08-05 10:31:50,783 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:31:50,783 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-08-05 10:31:50,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:31:50,783 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:50,784 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2019-08-05 10:31:50,784 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:50,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:50,784 INFO L82 PathProgramCache]: Analyzing trace with hash -1639003882, now seen corresponding path program 9 times [2019-08-05 10:31:50,785 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:50,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:50,804 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 10:31:50,805 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:50,841 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:50,874 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:50,926 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:50,941 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:51,001 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:51,020 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:51,044 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:51,066 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:51,099 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:51,114 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:51,115 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:51,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:31:51,115 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:31:51,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:31:51,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:31:51,116 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 12 states. [2019-08-05 10:31:51,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:51,144 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-08-05 10:31:51,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:31:51,145 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2019-08-05 10:31:51,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:51,146 INFO L225 Difference]: With dead ends: 16 [2019-08-05 10:31:51,146 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 10:31:51,147 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:31:51,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 10:31:51,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-08-05 10:31:51,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 10:31:51,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-08-05 10:31:51,150 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 12 [2019-08-05 10:31:51,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:51,150 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-08-05 10:31:51,150 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:31:51,150 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-08-05 10:31:51,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 10:31:51,151 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:51,151 INFO L399 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2019-08-05 10:31:51,151 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:51,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:51,151 INFO L82 PathProgramCache]: Analyzing trace with hash 730494880, now seen corresponding path program 10 times [2019-08-05 10:31:51,152 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:51,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:51,170 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 10:31:51,172 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:51,186 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:51,211 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:51,228 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:51,240 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:51,266 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:51,293 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:51,307 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:51,340 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:51,367 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:51,386 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:51,407 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:51,407 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:51,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:31:51,408 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:31:51,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:31:51,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:31:51,409 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 13 states. [2019-08-05 10:31:51,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:51,446 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-08-05 10:31:51,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:31:51,450 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2019-08-05 10:31:51,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:51,451 INFO L225 Difference]: With dead ends: 17 [2019-08-05 10:31:51,451 INFO L226 Difference]: Without dead ends: 17 [2019-08-05 10:31:51,452 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:31:51,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-05 10:31:51,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-08-05 10:31:51,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 10:31:51,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-08-05 10:31:51,455 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 13 [2019-08-05 10:31:51,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:51,455 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-08-05 10:31:51,455 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:31:51,455 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-08-05 10:31:51,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 10:31:51,456 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:51,456 INFO L399 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2019-08-05 10:31:51,456 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:51,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:51,457 INFO L82 PathProgramCache]: Analyzing trace with hash 1170512470, now seen corresponding path program 11 times [2019-08-05 10:31:51,457 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:51,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:51,480 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 10:31:51,481 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:51,540 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:51,612 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:51,625 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:51,677 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:51,719 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:51,951 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:51,977 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:51,995 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:52,012 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:52,034 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:52,082 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:52,104 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:52,105 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:52,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:31:52,106 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:31:52,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:31:52,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:31:52,107 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 14 states. [2019-08-05 10:31:52,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:52,133 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-08-05 10:31:52,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:31:52,133 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2019-08-05 10:31:52,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:52,134 INFO L225 Difference]: With dead ends: 18 [2019-08-05 10:31:52,134 INFO L226 Difference]: Without dead ends: 18 [2019-08-05 10:31:52,135 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:31:52,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-05 10:31:52,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-08-05 10:31:52,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-05 10:31:52,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-08-05 10:31:52,139 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 14 [2019-08-05 10:31:52,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:52,139 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-08-05 10:31:52,140 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:31:52,140 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-08-05 10:31:52,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:31:52,140 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:52,140 INFO L399 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2019-08-05 10:31:52,141 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:52,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:52,141 INFO L82 PathProgramCache]: Analyzing trace with hash 1926155872, now seen corresponding path program 12 times [2019-08-05 10:31:52,142 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:52,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:52,166 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 10:31:52,168 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:52,191 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:52,223 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:52,302 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:52,315 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:52,341 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:52,354 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:52,376 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:52,411 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:52,426 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:52,459 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:52,612 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:52,628 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:52,648 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:52,649 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:52,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:31:52,649 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 10:31:52,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 10:31:52,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:31:52,650 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 15 states. [2019-08-05 10:31:52,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:52,677 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-08-05 10:31:52,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:31:52,678 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2019-08-05 10:31:52,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:52,679 INFO L225 Difference]: With dead ends: 19 [2019-08-05 10:31:52,679 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 10:31:52,679 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:31:52,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 10:31:52,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-08-05 10:31:52,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 10:31:52,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-08-05 10:31:52,683 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 15 [2019-08-05 10:31:52,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:52,683 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-08-05 10:31:52,683 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 10:31:52,683 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-08-05 10:31:52,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:31:52,684 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:52,684 INFO L399 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2019-08-05 10:31:52,684 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:52,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:52,684 INFO L82 PathProgramCache]: Analyzing trace with hash -418702442, now seen corresponding path program 13 times [2019-08-05 10:31:52,685 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:52,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:52,703 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 10:31:52,705 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:52,742 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:52,767 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:52,786 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:52,798 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:52,813 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:52,826 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:52,840 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:52,856 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:52,876 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:52,894 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:52,910 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:52,927 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:52,947 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:52,976 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:52,977 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:52,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 10:31:52,977 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:31:52,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:31:52,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:31:52,978 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 16 states. [2019-08-05 10:31:53,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:53,005 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-08-05 10:31:53,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:31:53,006 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2019-08-05 10:31:53,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:53,007 INFO L225 Difference]: With dead ends: 20 [2019-08-05 10:31:53,007 INFO L226 Difference]: Without dead ends: 20 [2019-08-05 10:31:53,007 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:31:53,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-05 10:31:53,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-08-05 10:31:53,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 10:31:53,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-08-05 10:31:53,010 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 16 [2019-08-05 10:31:53,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:53,010 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-08-05 10:31:53,010 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:31:53,010 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-08-05 10:31:53,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 10:31:53,010 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:53,011 INFO L399 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2019-08-05 10:31:53,011 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:53,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:53,011 INFO L82 PathProgramCache]: Analyzing trace with hash -94866144, now seen corresponding path program 14 times [2019-08-05 10:31:53,012 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:53,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:53,030 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 10:31:53,031 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:53,062 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:53,072 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:53,081 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:53,174 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:53,186 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:53,201 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:53,214 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:53,228 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:53,282 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:53,299 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:53,318 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:53,335 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:53,353 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:53,371 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:53,416 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:53,417 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:53,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:31:53,417 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 10:31:53,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 10:31:53,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:31:53,418 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 17 states. [2019-08-05 10:31:53,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:53,638 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-08-05 10:31:53,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:31:53,641 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2019-08-05 10:31:53,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:53,641 INFO L225 Difference]: With dead ends: 21 [2019-08-05 10:31:53,641 INFO L226 Difference]: Without dead ends: 21 [2019-08-05 10:31:53,642 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:31:53,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-05 10:31:53,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-08-05 10:31:53,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-05 10:31:53,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-08-05 10:31:53,647 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 17 [2019-08-05 10:31:53,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:53,649 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-08-05 10:31:53,649 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 10:31:53,650 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-08-05 10:31:53,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:31:53,650 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:53,650 INFO L399 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2019-08-05 10:31:53,651 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:53,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:53,651 INFO L82 PathProgramCache]: Analyzing trace with hash 1354124502, now seen corresponding path program 15 times [2019-08-05 10:31:53,652 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:53,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:53,688 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 10:31:53,689 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:53,726 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:53,746 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:53,756 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:53,827 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:53,840 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:53,856 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:53,872 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:53,889 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:53,911 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:53,936 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:54,010 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:54,027 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:54,045 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:54,142 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:54,161 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:54,188 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:54,188 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:54,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:31:54,189 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:31:54,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:31:54,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:31:54,190 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 18 states. [2019-08-05 10:31:54,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:54,219 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-08-05 10:31:54,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 10:31:54,219 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2019-08-05 10:31:54,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:54,220 INFO L225 Difference]: With dead ends: 22 [2019-08-05 10:31:54,220 INFO L226 Difference]: Without dead ends: 22 [2019-08-05 10:31:54,221 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:31:54,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-05 10:31:54,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-08-05 10:31:54,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-05 10:31:54,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-08-05 10:31:54,223 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 18 [2019-08-05 10:31:54,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:54,223 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-08-05 10:31:54,223 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:31:54,223 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-08-05 10:31:54,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:31:54,224 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:54,224 INFO L399 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2019-08-05 10:31:54,224 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:54,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:54,224 INFO L82 PathProgramCache]: Analyzing trace with hash -971805728, now seen corresponding path program 16 times [2019-08-05 10:31:54,225 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:54,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:54,241 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 10:31:54,242 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:54,280 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:54,302 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:54,320 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:54,330 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:54,341 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:54,354 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:54,366 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:54,380 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:54,397 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:54,416 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:54,432 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:54,447 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:54,468 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:54,485 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:54,502 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:54,534 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:54,557 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:54,557 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:54,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:31:54,558 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:31:54,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:31:54,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:31:54,559 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 19 states. [2019-08-05 10:31:54,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:54,599 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-08-05 10:31:54,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:31:54,601 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-08-05 10:31:54,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:54,602 INFO L225 Difference]: With dead ends: 23 [2019-08-05 10:31:54,602 INFO L226 Difference]: Without dead ends: 23 [2019-08-05 10:31:54,603 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:31:54,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-08-05 10:31:54,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-08-05 10:31:54,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-05 10:31:54,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-08-05 10:31:54,606 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 19 [2019-08-05 10:31:54,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:54,606 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-08-05 10:31:54,606 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:31:54,606 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-08-05 10:31:54,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:31:54,607 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:54,607 INFO L399 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2019-08-05 10:31:54,607 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:54,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:54,607 INFO L82 PathProgramCache]: Analyzing trace with hash -61198826, now seen corresponding path program 17 times [2019-08-05 10:31:54,608 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:54,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:54,624 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 10:31:54,626 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:54,643 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:54,662 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:54,671 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:54,681 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:54,707 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:54,754 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:54,766 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:54,779 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:54,824 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:54,842 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:54,868 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:54,884 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:54,901 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:54,919 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:54,942 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:54,976 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:55,017 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:55,043 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:55,043 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 [19] total 19 [2019-08-05 10:31:55,044 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:31:55,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:31:55,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:31:55,045 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 20 states. [2019-08-05 10:31:55,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:55,097 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-08-05 10:31:55,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 10:31:55,098 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2019-08-05 10:31:55,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:55,098 INFO L225 Difference]: With dead ends: 24 [2019-08-05 10:31:55,099 INFO L226 Difference]: Without dead ends: 24 [2019-08-05 10:31:55,100 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:31:55,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-08-05 10:31:55,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-08-05 10:31:55,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-05 10:31:55,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-08-05 10:31:55,102 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 20 [2019-08-05 10:31:55,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:55,103 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-08-05 10:31:55,103 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:31:55,103 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-08-05 10:31:55,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:31:55,103 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:55,104 INFO L399 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2019-08-05 10:31:55,104 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:55,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:55,104 INFO L82 PathProgramCache]: Analyzing trace with hash -1897155936, now seen corresponding path program 18 times [2019-08-05 10:31:55,105 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:55,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:55,121 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 10:31:55,122 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:55,140 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:55,169 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:55,204 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:55,250 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:55,261 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:55,275 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:55,290 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:55,305 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:55,328 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:55,351 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:55,368 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:55,386 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:55,404 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:55,422 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:55,441 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:55,460 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:55,480 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:55,505 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:55,999 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:55,999 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:55,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:31:56,000 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:31:56,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:31:56,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:31:56,001 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 21 states. [2019-08-05 10:31:56,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:56,034 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-08-05 10:31:56,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:31:56,034 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2019-08-05 10:31:56,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:56,035 INFO L225 Difference]: With dead ends: 25 [2019-08-05 10:31:56,035 INFO L226 Difference]: Without dead ends: 25 [2019-08-05 10:31:56,036 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:31:56,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-05 10:31:56,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-08-05 10:31:56,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-05 10:31:56,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-08-05 10:31:56,039 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 21 [2019-08-05 10:31:56,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:56,040 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-08-05 10:31:56,040 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:31:56,040 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-08-05 10:31:56,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:31:56,040 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:56,041 INFO L399 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2019-08-05 10:31:56,041 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:56,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:56,041 INFO L82 PathProgramCache]: Analyzing trace with hash 1317715798, now seen corresponding path program 19 times [2019-08-05 10:31:56,042 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:56,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:56,058 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 10:31:56,059 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:56,082 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:56,103 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:56,112 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:56,121 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:56,133 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:56,144 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:56,156 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:56,169 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:56,182 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:56,197 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:56,215 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:56,267 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:56,284 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:56,303 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:56,322 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:56,342 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:56,363 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:56,384 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:56,413 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:56,454 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:56,455 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:56,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:31:56,455 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:31:56,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:31:56,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:31:56,456 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 22 states. [2019-08-05 10:31:56,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:56,487 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-08-05 10:31:56,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:31:56,488 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2019-08-05 10:31:56,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:56,489 INFO L225 Difference]: With dead ends: 26 [2019-08-05 10:31:56,489 INFO L226 Difference]: Without dead ends: 26 [2019-08-05 10:31:56,490 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:31:56,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-08-05 10:31:56,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-08-05 10:31:56,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-08-05 10:31:56,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-08-05 10:31:56,493 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 22 [2019-08-05 10:31:56,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:56,493 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-08-05 10:31:56,493 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:31:56,493 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-08-05 10:31:56,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:31:56,494 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:56,494 INFO L399 BasicCegarLoop]: trace histogram [20, 1, 1, 1] [2019-08-05 10:31:56,494 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:56,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:56,495 INFO L82 PathProgramCache]: Analyzing trace with hash -2100475552, now seen corresponding path program 20 times [2019-08-05 10:31:56,495 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:56,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:56,512 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 10:31:56,514 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:56,564 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:56,695 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:56,710 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:56,723 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:56,738 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:56,753 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:56,780 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:56,834 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:56,862 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:56,926 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:56,957 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:57,015 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:57,093 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:57,121 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:57,176 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:57,200 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:57,221 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:57,242 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:57,264 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:57,288 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:57,316 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:57,316 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:57,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:31:57,317 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:31:57,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:31:57,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:31:57,317 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 23 states. [2019-08-05 10:31:57,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:57,353 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-08-05 10:31:57,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 10:31:57,353 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2019-08-05 10:31:57,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:57,354 INFO L225 Difference]: With dead ends: 27 [2019-08-05 10:31:57,354 INFO L226 Difference]: Without dead ends: 27 [2019-08-05 10:31:57,355 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:31:57,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-08-05 10:31:57,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-08-05 10:31:57,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-05 10:31:57,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-08-05 10:31:57,358 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 23 [2019-08-05 10:31:57,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:57,358 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-08-05 10:31:57,359 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:31:57,359 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-08-05 10:31:57,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:31:57,359 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:57,359 INFO L399 BasicCegarLoop]: trace histogram [21, 1, 1, 1] [2019-08-05 10:31:57,360 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:57,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:57,360 INFO L82 PathProgramCache]: Analyzing trace with hash -690225002, now seen corresponding path program 21 times [2019-08-05 10:31:57,361 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:57,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:57,376 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 10:31:57,378 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:57,422 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:57,447 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:57,494 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:57,512 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:57,524 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:57,536 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:57,549 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:57,566 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:57,579 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:57,593 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:57,610 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:57,626 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:57,644 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:57,661 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:57,681 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:57,700 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:57,737 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:57,760 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:57,781 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:57,804 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:57,954 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:57,988 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:57,988 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:57,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 10:31:57,989 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:31:57,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:31:57,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:31:57,990 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 24 states. [2019-08-05 10:31:58,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:58,044 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-08-05 10:31:58,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 10:31:58,050 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2019-08-05 10:31:58,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:58,050 INFO L225 Difference]: With dead ends: 28 [2019-08-05 10:31:58,050 INFO L226 Difference]: Without dead ends: 28 [2019-08-05 10:31:58,051 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:31:58,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-08-05 10:31:58,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-08-05 10:31:58,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-05 10:31:58,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-08-05 10:31:58,053 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 24 [2019-08-05 10:31:58,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:58,054 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-08-05 10:31:58,054 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:31:58,054 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-08-05 10:31:58,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:31:58,054 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:58,055 INFO L399 BasicCegarLoop]: trace histogram [22, 1, 1, 1] [2019-08-05 10:31:58,055 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:58,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:58,055 INFO L82 PathProgramCache]: Analyzing trace with hash 77869088, now seen corresponding path program 22 times [2019-08-05 10:31:58,056 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:58,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:58,072 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 24 conjunts are in the unsatisfiable core [2019-08-05 10:31:58,073 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:58,134 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:58,177 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:58,195 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:58,207 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:58,218 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:58,236 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:58,253 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:58,266 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:58,281 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:58,295 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:58,311 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:58,328 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:58,345 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:58,364 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:58,383 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:58,403 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:58,423 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:58,445 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:58,479 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:58,499 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:58,547 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:58,575 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:58,608 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:58,609 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:58,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 10:31:58,609 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 10:31:58,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 10:31:58,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:31:58,610 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 25 states. [2019-08-05 10:31:58,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:58,650 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-08-05 10:31:58,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:31:58,650 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2019-08-05 10:31:58,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:58,651 INFO L225 Difference]: With dead ends: 29 [2019-08-05 10:31:58,651 INFO L226 Difference]: Without dead ends: 29 [2019-08-05 10:31:58,651 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:31:58,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-08-05 10:31:58,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-08-05 10:31:58,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-08-05 10:31:58,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-08-05 10:31:58,654 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 25 [2019-08-05 10:31:58,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:58,654 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-08-05 10:31:58,654 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 10:31:58,654 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-08-05 10:31:58,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 10:31:58,655 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:58,655 INFO L399 BasicCegarLoop]: trace histogram [23, 1, 1, 1] [2019-08-05 10:31:58,655 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:58,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:58,656 INFO L82 PathProgramCache]: Analyzing trace with hash -1881017898, now seen corresponding path program 23 times [2019-08-05 10:31:58,656 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:58,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:58,672 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 10:31:58,673 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:58,712 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:58,734 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:58,743 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:58,759 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:58,770 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:58,781 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:58,794 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:58,809 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:58,824 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:58,839 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:58,855 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:58,873 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:58,891 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:58,911 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:58,931 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:59,005 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:59,024 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:59,060 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:59,087 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:59,107 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:59,131 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:59,154 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:59,179 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:59,207 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:59,207 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:59,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 10:31:59,208 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 10:31:59,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 10:31:59,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:31:59,209 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 26 states. [2019-08-05 10:31:59,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:59,266 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-08-05 10:31:59,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:31:59,266 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2019-08-05 10:31:59,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:59,267 INFO L225 Difference]: With dead ends: 30 [2019-08-05 10:31:59,267 INFO L226 Difference]: Without dead ends: 30 [2019-08-05 10:31:59,268 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:31:59,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-08-05 10:31:59,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-08-05 10:31:59,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-05 10:31:59,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-08-05 10:31:59,272 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 26 [2019-08-05 10:31:59,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:59,272 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-08-05 10:31:59,273 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 10:31:59,273 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-08-05 10:31:59,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:31:59,273 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:59,274 INFO L399 BasicCegarLoop]: trace histogram [24, 1, 1, 1] [2019-08-05 10:31:59,274 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:59,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:59,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1817994976, now seen corresponding path program 24 times [2019-08-05 10:31:59,277 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:59,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:59,307 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 26 conjunts are in the unsatisfiable core [2019-08-05 10:31:59,309 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:59,332 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:59,352 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:59,360 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:59,374 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:59,391 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:59,401 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:59,413 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:59,439 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:59,465 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:59,481 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:59,496 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:59,590 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:59,639 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:59,657 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:59,675 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:59,692 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:59,714 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:59,738 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:59,760 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:59,783 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:59,806 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:59,842 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:00,000 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:00,040 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:00,075 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:00,076 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:00,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 10:32:00,076 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 10:32:00,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 10:32:00,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:32:00,077 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 27 states. [2019-08-05 10:32:00,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:00,113 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-08-05 10:32:00,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 10:32:00,114 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2019-08-05 10:32:00,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:00,114 INFO L225 Difference]: With dead ends: 31 [2019-08-05 10:32:00,114 INFO L226 Difference]: Without dead ends: 31 [2019-08-05 10:32:00,115 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:32:00,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-08-05 10:32:00,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-08-05 10:32:00,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-08-05 10:32:00,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-08-05 10:32:00,127 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 27 [2019-08-05 10:32:00,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:00,127 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-08-05 10:32:00,127 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 10:32:00,127 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-08-05 10:32:00,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 10:32:00,128 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:00,128 INFO L399 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2019-08-05 10:32:00,128 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:00,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:00,129 INFO L82 PathProgramCache]: Analyzing trace with hash 523277078, now seen corresponding path program 25 times [2019-08-05 10:32:00,130 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:00,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:00,145 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 10:32:00,147 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:00,175 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:00,182 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:00,211 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:00,221 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:00,259 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:00,272 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:00,292 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:00,305 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:00,331 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:00,345 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:00,360 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:00,378 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:00,394 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:00,415 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:00,434 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:00,455 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:00,476 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:00,495 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:00,518 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:00,541 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:00,564 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:00,589 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:00,615 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:00,644 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:00,786 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:00,813 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:00,813 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:00,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 10:32:00,814 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 10:32:00,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 10:32:00,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:32:00,815 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 28 states. [2019-08-05 10:32:00,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:00,957 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-08-05 10:32:00,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 10:32:00,958 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 28 [2019-08-05 10:32:00,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:00,958 INFO L225 Difference]: With dead ends: 32 [2019-08-05 10:32:00,958 INFO L226 Difference]: Without dead ends: 32 [2019-08-05 10:32:00,959 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:32:00,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-08-05 10:32:00,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-08-05 10:32:00,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-05 10:32:00,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-08-05 10:32:00,962 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 28 [2019-08-05 10:32:00,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:00,962 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-08-05 10:32:00,963 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 10:32:00,963 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-08-05 10:32:00,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 10:32:00,963 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:00,963 INFO L399 BasicCegarLoop]: trace histogram [26, 1, 1, 1] [2019-08-05 10:32:00,963 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:00,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:00,964 INFO L82 PathProgramCache]: Analyzing trace with hash -958272096, now seen corresponding path program 26 times [2019-08-05 10:32:00,964 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:00,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:00,980 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 28 conjunts are in the unsatisfiable core [2019-08-05 10:32:00,982 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:01,030 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:01,112 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:01,122 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:01,133 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:01,143 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:01,155 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:01,171 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:01,185 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:01,202 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:01,216 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:01,243 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:01,348 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:01,365 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:01,380 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:01,398 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:01,417 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:01,439 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:01,461 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:01,511 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:01,533 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:01,554 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:01,578 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:01,603 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:01,629 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:01,654 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:01,857 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:01,896 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:01,897 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:01,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 10:32:01,897 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 10:32:01,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 10:32:01,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:32:01,898 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 29 states. [2019-08-05 10:32:01,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:01,984 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-08-05 10:32:01,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 10:32:01,984 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 29 [2019-08-05 10:32:01,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:01,985 INFO L225 Difference]: With dead ends: 33 [2019-08-05 10:32:01,985 INFO L226 Difference]: Without dead ends: 33 [2019-08-05 10:32:01,985 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:32:01,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-08-05 10:32:01,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-08-05 10:32:01,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-05 10:32:01,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-08-05 10:32:01,999 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 29 [2019-08-05 10:32:01,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:01,999 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-08-05 10:32:01,999 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 10:32:01,999 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-08-05 10:32:02,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 10:32:02,000 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:02,000 INFO L399 BasicCegarLoop]: trace histogram [27, 1, 1, 1] [2019-08-05 10:32:02,000 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:02,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:02,001 INFO L82 PathProgramCache]: Analyzing trace with hash 358343766, now seen corresponding path program 27 times [2019-08-05 10:32:02,002 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:02,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:02,016 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 10:32:02,018 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:02,068 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:02,118 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:02,144 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:02,175 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:02,196 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:02,231 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:02,283 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:02,296 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:02,311 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:02,324 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:02,339 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:02,357 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:02,375 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:02,391 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:02,411 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:02,431 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:02,453 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:02,472 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:02,496 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:02,518 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:02,542 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:02,566 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:02,709 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:02,734 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:02,758 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:02,784 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:02,810 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:02,844 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:02,845 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:02,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 10:32:02,845 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 10:32:02,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 10:32:02,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:32:02,846 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 30 states. [2019-08-05 10:32:02,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:02,908 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-08-05 10:32:02,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 10:32:02,908 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 30 [2019-08-05 10:32:02,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:02,909 INFO L225 Difference]: With dead ends: 34 [2019-08-05 10:32:02,909 INFO L226 Difference]: Without dead ends: 34 [2019-08-05 10:32:02,910 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:32:02,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-08-05 10:32:02,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-08-05 10:32:02,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-05 10:32:02,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-08-05 10:32:02,913 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 30 [2019-08-05 10:32:02,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:02,914 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-08-05 10:32:02,914 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 10:32:02,914 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-08-05 10:32:02,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-05 10:32:02,914 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:02,914 INFO L399 BasicCegarLoop]: trace histogram [28, 1, 1, 1] [2019-08-05 10:32:02,914 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:02,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:02,915 INFO L82 PathProgramCache]: Analyzing trace with hash -1776237472, now seen corresponding path program 28 times [2019-08-05 10:32:02,915 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:02,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:02,931 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 30 conjunts are in the unsatisfiable core [2019-08-05 10:32:02,932 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:02,982 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:03,162 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 3 [2019-08-05 10:32:03,163 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:03,355 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 3 [2019-08-05 10:32:03,355 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:03,520 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:03,530 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:03,560 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:03,573 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:03,588 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:03,604 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:03,621 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:03,637 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:03,654 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:03,670 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:03,687 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:03,706 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:03,726 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:03,745 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:03,769 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:03,792 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:03,815 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:03,839 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:03,861 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:03,886 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:03,913 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:03,937 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:03,963 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:03,995 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:04,039 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:04,082 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:32:04,083 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:04,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-05 10:32:04,083 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-05 10:32:04,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-05 10:32:04,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:32:04,084 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 31 states. [2019-08-05 10:32:04,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:04,225 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-08-05 10:32:04,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 10:32:04,226 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 31 [2019-08-05 10:32:04,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:04,226 INFO L225 Difference]: With dead ends: 35 [2019-08-05 10:32:04,227 INFO L226 Difference]: Without dead ends: 35 [2019-08-05 10:32:04,228 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:32:04,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-08-05 10:32:04,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-08-05 10:32:04,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-05 10:32:04,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-08-05 10:32:04,232 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 31 [2019-08-05 10:32:04,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:04,232 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-08-05 10:32:04,232 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-05 10:32:04,233 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-08-05 10:32:04,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 10:32:04,233 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:04,233 INFO L399 BasicCegarLoop]: trace histogram [29, 1, 1, 1] [2019-08-05 10:32:04,234 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:04,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:04,235 INFO L82 PathProgramCache]: Analyzing trace with hash 771220886, now seen corresponding path program 29 times [2019-08-05 10:32:04,236 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:04,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:04,264 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 10:32:04,271 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:04,331 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:04,495 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 3 [2019-08-05 10:32:04,495 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:04,532 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:04,541 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:04,572 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:04,582 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:04,595 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:04,609 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:04,632 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:04,645 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:04,662 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:04,678 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:04,694 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:04,713 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:04,732 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:04,751 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:04,778 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:04,799 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:04,819 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:04,840 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:04,865 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:04,888 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:04,912 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:04,936 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:04,961 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:04,986 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:05,015 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:05,043 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:05,073 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:05,102 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:05,102 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:05,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-05 10:32:05,103 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 10:32:05,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 10:32:05,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:32:05,104 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 32 states. [2019-08-05 10:32:05,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:05,143 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-08-05 10:32:05,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-05 10:32:05,144 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 32 [2019-08-05 10:32:05,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:05,144 INFO L225 Difference]: With dead ends: 36 [2019-08-05 10:32:05,145 INFO L226 Difference]: Without dead ends: 36 [2019-08-05 10:32:05,146 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:32:05,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-08-05 10:32:05,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-08-05 10:32:05,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-05 10:32:05,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-08-05 10:32:05,149 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 32 [2019-08-05 10:32:05,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:05,149 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-08-05 10:32:05,149 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 10:32:05,149 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-08-05 10:32:05,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-05 10:32:05,150 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:05,150 INFO L399 BasicCegarLoop]: trace histogram [30, 1, 1, 1] [2019-08-05 10:32:05,150 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:05,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:05,150 INFO L82 PathProgramCache]: Analyzing trace with hash -1861948640, now seen corresponding path program 30 times [2019-08-05 10:32:05,151 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:05,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:05,165 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 32 conjunts are in the unsatisfiable core [2019-08-05 10:32:05,167 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:05,214 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:05,403 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 3 [2019-08-05 10:32:05,404 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:05,555 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:05,563 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:05,575 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:05,587 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:05,599 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:05,612 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:05,626 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:05,641 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:05,656 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:05,671 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:05,687 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:05,705 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:05,723 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:05,742 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:05,767 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:05,787 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:05,808 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:05,828 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:05,850 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:05,873 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:05,897 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:05,922 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:05,946 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:05,972 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:05,999 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:06,027 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:06,056 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:06,095 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:06,127 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:32:06,128 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:06,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-05 10:32:06,128 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-05 10:32:06,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-05 10:32:06,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:32:06,130 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 33 states. [2019-08-05 10:32:06,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:06,192 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-08-05 10:32:06,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-05 10:32:06,193 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 33 [2019-08-05 10:32:06,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:06,193 INFO L225 Difference]: With dead ends: 37 [2019-08-05 10:32:06,193 INFO L226 Difference]: Without dead ends: 37 [2019-08-05 10:32:06,194 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:32:06,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-08-05 10:32:06,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-08-05 10:32:06,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-05 10:32:06,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-08-05 10:32:06,197 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 33 [2019-08-05 10:32:06,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:06,197 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-08-05 10:32:06,197 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-05 10:32:06,198 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-08-05 10:32:06,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-05 10:32:06,198 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:06,198 INFO L399 BasicCegarLoop]: trace histogram [31, 1, 1, 1] [2019-08-05 10:32:06,198 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:06,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:06,199 INFO L82 PathProgramCache]: Analyzing trace with hash -1885825322, now seen corresponding path program 31 times [2019-08-05 10:32:06,199 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:06,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:06,214 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 33 conjunts are in the unsatisfiable core [2019-08-05 10:32:06,216 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:06,260 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:06,450 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 3 [2019-08-05 10:32:06,451 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:06,662 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 3 [2019-08-05 10:32:06,663 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:06,917 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 3 [2019-08-05 10:32:06,918 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:07,043 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:07,079 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:07,105 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:07,163 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:07,191 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:07,246 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:07,297 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:07,365 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:07,389 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:07,405 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:07,426 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:07,445 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:07,464 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:07,486 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:07,509 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:07,558 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:07,581 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:07,628 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:07,651 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:07,676 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:07,702 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:07,729 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:07,755 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:07,783 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:07,810 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:07,839 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:07,870 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:07,901 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:07,902 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:07,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 10:32:07,902 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 10:32:07,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 10:32:07,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:32:07,903 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 34 states. [2019-08-05 10:32:07,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:07,961 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-08-05 10:32:07,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-05 10:32:07,961 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 34 [2019-08-05 10:32:07,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:07,962 INFO L225 Difference]: With dead ends: 38 [2019-08-05 10:32:07,962 INFO L226 Difference]: Without dead ends: 38 [2019-08-05 10:32:07,963 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:32:07,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-08-05 10:32:07,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-08-05 10:32:07,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-05 10:32:07,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-08-05 10:32:07,966 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 34 [2019-08-05 10:32:07,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:07,967 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-08-05 10:32:07,967 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 10:32:07,967 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-08-05 10:32:07,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-05 10:32:07,968 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:07,968 INFO L399 BasicCegarLoop]: trace histogram [32, 1, 1, 1] [2019-08-05 10:32:07,968 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:07,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:07,968 INFO L82 PathProgramCache]: Analyzing trace with hash 1668964832, now seen corresponding path program 32 times [2019-08-05 10:32:07,969 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:07,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:07,983 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 34 conjunts are in the unsatisfiable core [2019-08-05 10:32:07,985 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:08,008 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:08,034 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:08,043 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:08,054 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:08,064 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:08,076 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:08,087 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:08,100 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:08,113 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:08,128 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:08,143 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:08,159 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:08,176 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:08,193 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:08,213 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:08,233 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:08,251 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:08,290 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:08,312 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:08,337 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:08,362 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:08,387 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:08,409 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:08,439 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:08,474 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:08,513 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:08,545 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:08,594 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:08,625 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:08,655 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:08,682 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:08,714 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:08,749 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:08,749 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:08,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-05 10:32:08,750 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 10:32:08,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 10:32:08,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:32:08,751 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 35 states. [2019-08-05 10:32:08,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:08,789 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-08-05 10:32:08,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 10:32:08,789 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 35 [2019-08-05 10:32:08,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:08,790 INFO L225 Difference]: With dead ends: 39 [2019-08-05 10:32:08,790 INFO L226 Difference]: Without dead ends: 39 [2019-08-05 10:32:08,791 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:32:08,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-08-05 10:32:08,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-08-05 10:32:08,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-05 10:32:08,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-08-05 10:32:08,794 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 35 [2019-08-05 10:32:08,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:08,794 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-08-05 10:32:08,794 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 10:32:08,795 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-08-05 10:32:08,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-05 10:32:08,795 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:08,795 INFO L399 BasicCegarLoop]: trace histogram [33, 1, 1, 1] [2019-08-05 10:32:08,795 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:08,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:08,796 INFO L82 PathProgramCache]: Analyzing trace with hash 198309910, now seen corresponding path program 33 times [2019-08-05 10:32:08,796 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:08,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:08,811 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 35 conjunts are in the unsatisfiable core [2019-08-05 10:32:08,812 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:08,869 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:08,906 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:08,950 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:08,958 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:08,968 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:08,980 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:08,991 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:09,005 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:09,113 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:09,127 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:09,141 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:09,201 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:09,218 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:09,235 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:09,253 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:09,271 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:09,290 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:09,311 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:09,336 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:09,357 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:09,380 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:09,404 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:09,429 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:09,453 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:09,477 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:09,506 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:09,530 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:09,559 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:09,588 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:09,617 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:09,647 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:09,681 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:09,711 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:09,748 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:09,748 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:09,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-05 10:32:09,749 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-05 10:32:09,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-05 10:32:09,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:32:09,751 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 36 states. [2019-08-05 10:32:09,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:09,793 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-08-05 10:32:09,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-05 10:32:09,794 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 36 [2019-08-05 10:32:09,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:09,794 INFO L225 Difference]: With dead ends: 40 [2019-08-05 10:32:09,795 INFO L226 Difference]: Without dead ends: 40 [2019-08-05 10:32:09,795 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:32:09,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-08-05 10:32:09,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-08-05 10:32:09,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-05 10:32:09,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-08-05 10:32:09,798 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 36 [2019-08-05 10:32:09,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:09,798 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-08-05 10:32:09,798 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-05 10:32:09,798 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-08-05 10:32:09,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-08-05 10:32:09,799 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:09,799 INFO L399 BasicCegarLoop]: trace histogram [34, 1, 1, 1] [2019-08-05 10:32:09,799 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:09,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:09,800 INFO L82 PathProgramCache]: Analyzing trace with hash 1852647584, now seen corresponding path program 34 times [2019-08-05 10:32:09,800 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:09,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:09,815 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 36 conjunts are in the unsatisfiable core [2019-08-05 10:32:09,816 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:09,838 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:09,861 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:09,869 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:09,879 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:09,998 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:10,010 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:10,022 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:10,036 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:10,051 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:10,065 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:10,080 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:10,096 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:10,113 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:10,132 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:10,151 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:10,169 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:10,191 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:10,212 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:10,237 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:10,257 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:10,291 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:10,315 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:10,339 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:10,362 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:10,386 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:10,413 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:10,446 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:10,474 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:10,509 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:10,560 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:10,590 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:10,643 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:10,674 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:10,708 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:10,759 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:10,759 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:10,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-05 10:32:10,760 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-05 10:32:10,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-05 10:32:10,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:32:10,761 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 37 states. [2019-08-05 10:32:10,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:10,801 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-08-05 10:32:10,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-05 10:32:10,801 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 37 [2019-08-05 10:32:10,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:10,802 INFO L225 Difference]: With dead ends: 41 [2019-08-05 10:32:10,802 INFO L226 Difference]: Without dead ends: 41 [2019-08-05 10:32:10,803 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:32:10,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-08-05 10:32:10,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-08-05 10:32:10,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-05 10:32:10,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-08-05 10:32:10,805 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 37 [2019-08-05 10:32:10,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:10,806 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-08-05 10:32:10,806 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-05 10:32:10,806 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-08-05 10:32:10,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-05 10:32:10,807 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:10,807 INFO L399 BasicCegarLoop]: trace histogram [35, 1, 1, 1] [2019-08-05 10:32:10,807 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:10,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:10,807 INFO L82 PathProgramCache]: Analyzing trace with hash 1597507926, now seen corresponding path program 35 times [2019-08-05 10:32:10,808 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:10,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:10,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-05 10:32:10,823 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:10,871 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:10,889 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:10,898 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:10,908 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:10,932 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:10,945 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:10,958 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:10,976 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:11,003 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:11,019 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:11,035 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:11,081 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:11,112 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:11,127 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:11,145 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:11,163 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:11,183 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:11,203 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:11,227 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:11,249 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:11,283 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:11,306 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:11,331 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:11,372 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:11,395 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:11,423 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:11,452 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:11,480 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:11,509 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:11,539 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:11,569 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:11,601 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:11,632 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:11,667 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:11,700 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:11,734 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:11,734 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:11,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-05 10:32:11,735 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-05 10:32:11,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-05 10:32:11,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:32:11,736 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 38 states. [2019-08-05 10:32:11,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:11,831 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-08-05 10:32:11,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-05 10:32:11,831 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 38 [2019-08-05 10:32:11,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:11,832 INFO L225 Difference]: With dead ends: 42 [2019-08-05 10:32:11,832 INFO L226 Difference]: Without dead ends: 42 [2019-08-05 10:32:11,833 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:32:11,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-08-05 10:32:11,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-08-05 10:32:11,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-05 10:32:11,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-08-05 10:32:11,835 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 38 [2019-08-05 10:32:11,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:11,836 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-08-05 10:32:11,836 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-05 10:32:11,836 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-08-05 10:32:11,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-08-05 10:32:11,836 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:11,837 INFO L399 BasicCegarLoop]: trace histogram [36, 1, 1, 1] [2019-08-05 10:32:11,837 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:11,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:11,837 INFO L82 PathProgramCache]: Analyzing trace with hash -2016854176, now seen corresponding path program 36 times [2019-08-05 10:32:11,838 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:11,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:11,853 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 38 conjunts are in the unsatisfiable core [2019-08-05 10:32:11,855 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:11,922 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:12,130 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 3 [2019-08-05 10:32:12,131 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:12,378 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 3 [2019-08-05 10:32:12,379 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:12,632 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 3 [2019-08-05 10:32:12,633 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:12,678 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:12,692 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:12,710 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:12,729 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:12,746 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:12,763 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:12,793 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:12,811 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:12,828 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:12,845 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:12,868 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:12,887 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:12,905 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:12,938 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:12,958 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:12,980 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:13,001 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:13,025 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:13,049 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:13,080 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:13,132 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:13,160 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:13,187 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:13,214 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:13,243 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:13,272 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:13,304 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:13,335 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:13,369 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:13,402 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:13,437 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:13,472 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:13,510 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:13,511 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:13,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-05 10:32:13,511 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-05 10:32:13,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-05 10:32:13,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:32:13,512 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 39 states. [2019-08-05 10:32:13,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:13,557 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-08-05 10:32:13,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-05 10:32:13,557 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 39 [2019-08-05 10:32:13,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:13,558 INFO L225 Difference]: With dead ends: 43 [2019-08-05 10:32:13,558 INFO L226 Difference]: Without dead ends: 43 [2019-08-05 10:32:13,559 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:32:13,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-08-05 10:32:13,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-08-05 10:32:13,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-05 10:32:13,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-08-05 10:32:13,562 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 39 [2019-08-05 10:32:13,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:13,562 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-08-05 10:32:13,562 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-05 10:32:13,562 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-08-05 10:32:13,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 10:32:13,563 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:13,563 INFO L399 BasicCegarLoop]: trace histogram [37, 1, 1, 1] [2019-08-05 10:32:13,563 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:13,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:13,563 INFO L82 PathProgramCache]: Analyzing trace with hash 1902037654, now seen corresponding path program 37 times [2019-08-05 10:32:13,564 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:13,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:13,580 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 39 conjunts are in the unsatisfiable core [2019-08-05 10:32:13,581 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:13,624 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:13,788 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 3 [2019-08-05 10:32:13,789 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:13,800 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:13,810 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:13,821 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:13,832 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:13,844 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:13,857 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:13,870 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:13,885 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:13,900 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:13,918 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:13,935 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:13,953 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:13,970 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:13,990 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:14,011 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:14,029 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:14,054 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:14,075 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:14,099 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:14,122 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:14,144 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:14,170 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:14,196 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:14,225 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:14,251 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:14,279 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:14,307 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:14,335 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:14,368 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:14,402 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:14,436 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:14,491 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:14,533 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:14,568 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:14,603 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:14,640 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:14,641 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:14,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-05 10:32:14,641 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-05 10:32:14,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-05 10:32:14,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:32:14,642 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 40 states. [2019-08-05 10:32:14,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:14,699 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-08-05 10:32:14,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-05 10:32:14,700 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 40 [2019-08-05 10:32:14,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:14,701 INFO L225 Difference]: With dead ends: 44 [2019-08-05 10:32:14,701 INFO L226 Difference]: Without dead ends: 44 [2019-08-05 10:32:14,702 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:32:14,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-08-05 10:32:14,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-08-05 10:32:14,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-05 10:32:14,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-08-05 10:32:14,704 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 40 [2019-08-05 10:32:14,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:14,704 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-08-05 10:32:14,704 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-05 10:32:14,704 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-08-05 10:32:14,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-08-05 10:32:14,705 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:14,705 INFO L399 BasicCegarLoop]: trace histogram [38, 1, 1, 1] [2019-08-05 10:32:14,705 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:14,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:14,705 INFO L82 PathProgramCache]: Analyzing trace with hash -1166367200, now seen corresponding path program 38 times [2019-08-05 10:32:14,706 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:14,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:14,721 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 40 conjunts are in the unsatisfiable core [2019-08-05 10:32:14,722 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:14,779 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:14,804 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:14,813 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:14,823 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:14,838 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:14,850 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:14,861 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:14,874 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:14,887 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:14,904 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:14,921 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:14,938 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:14,954 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:14,971 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:14,990 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:15,008 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:15,028 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:15,047 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:15,067 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:15,089 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:15,111 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:15,136 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:15,160 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:15,191 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:15,217 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:15,245 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:15,279 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:15,328 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:15,359 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:15,390 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:15,417 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:15,447 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:15,480 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:15,515 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:15,546 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:15,581 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:15,614 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:15,651 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:15,695 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:15,696 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:15,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-05 10:32:15,696 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-05 10:32:15,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-05 10:32:15,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:32:15,697 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 41 states. [2019-08-05 10:32:15,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:15,743 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-08-05 10:32:15,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-05 10:32:15,743 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 41 [2019-08-05 10:32:15,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:15,744 INFO L225 Difference]: With dead ends: 45 [2019-08-05 10:32:15,744 INFO L226 Difference]: Without dead ends: 45 [2019-08-05 10:32:15,745 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:32:15,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-05 10:32:15,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-08-05 10:32:15,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-05 10:32:15,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-08-05 10:32:15,747 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 41 [2019-08-05 10:32:15,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:15,747 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-08-05 10:32:15,747 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-05 10:32:15,747 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-08-05 10:32:15,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-05 10:32:15,748 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:15,748 INFO L399 BasicCegarLoop]: trace histogram [39, 1, 1, 1] [2019-08-05 10:32:15,748 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:15,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:15,748 INFO L82 PathProgramCache]: Analyzing trace with hash -1797637162, now seen corresponding path program 39 times [2019-08-05 10:32:15,749 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:15,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:15,764 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 41 conjunts are in the unsatisfiable core [2019-08-05 10:32:15,766 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:15,826 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:15,954 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:15,961 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:15,972 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:15,982 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:15,994 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:16,007 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:16,020 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:16,034 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:16,048 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:16,064 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:16,082 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:16,101 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:16,121 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:16,542 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:16,560 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:16,580 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:16,617 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:16,646 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:16,676 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:16,701 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:16,950 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:16,976 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:17,002 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:17,028 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:17,054 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:17,098 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:17,124 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:17,153 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:17,182 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:17,211 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:17,240 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:17,360 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:17,476 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:17,508 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:17,544 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:17,579 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:17,615 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:17,655 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:17,696 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:17,696 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:17,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-05 10:32:17,696 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-05 10:32:17,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-05 10:32:17,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:32:17,698 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 42 states. [2019-08-05 10:32:17,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:17,763 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-08-05 10:32:17,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-05 10:32:17,764 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 42 [2019-08-05 10:32:17,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:17,765 INFO L225 Difference]: With dead ends: 46 [2019-08-05 10:32:17,765 INFO L226 Difference]: Without dead ends: 46 [2019-08-05 10:32:17,766 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:32:17,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-08-05 10:32:17,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-08-05 10:32:17,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-05 10:32:17,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-08-05 10:32:17,768 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 42 [2019-08-05 10:32:17,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:17,769 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-08-05 10:32:17,769 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-05 10:32:17,769 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-08-05 10:32:17,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-08-05 10:32:17,769 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:17,770 INFO L399 BasicCegarLoop]: trace histogram [40, 1, 1, 1] [2019-08-05 10:32:17,770 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:17,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:17,770 INFO L82 PathProgramCache]: Analyzing trace with hash 107830496, now seen corresponding path program 40 times [2019-08-05 10:32:17,770 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:17,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:17,786 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 42 conjunts are in the unsatisfiable core [2019-08-05 10:32:17,787 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:17,800 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:17,812 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:17,821 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:17,831 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:17,841 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:17,853 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:17,865 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:17,889 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:17,902 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:17,916 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:17,932 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:17,948 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:17,963 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:17,979 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:17,996 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:18,027 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:18,047 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:18,068 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:18,095 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:18,117 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:18,139 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:18,164 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:18,188 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:18,213 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:18,237 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:18,262 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:18,295 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:18,324 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:18,352 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:18,383 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:18,416 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:18,451 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:18,482 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:18,516 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:18,580 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:18,631 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:18,668 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:18,703 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:18,748 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:18,784 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:18,827 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:18,827 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:18,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-05 10:32:18,827 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-05 10:32:18,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-05 10:32:18,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:32:18,828 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 43 states. [2019-08-05 10:32:18,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:18,876 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-08-05 10:32:18,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-05 10:32:18,876 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 43 [2019-08-05 10:32:18,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:18,877 INFO L225 Difference]: With dead ends: 47 [2019-08-05 10:32:18,877 INFO L226 Difference]: Without dead ends: 47 [2019-08-05 10:32:18,878 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:32:18,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-08-05 10:32:18,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-08-05 10:32:18,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-08-05 10:32:18,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-08-05 10:32:18,880 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 43 [2019-08-05 10:32:18,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:18,880 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-08-05 10:32:18,880 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-05 10:32:18,880 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-08-05 10:32:18,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-08-05 10:32:18,881 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:18,881 INFO L399 BasicCegarLoop]: trace histogram [41, 1, 1, 1] [2019-08-05 10:32:18,881 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:18,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:18,881 INFO L82 PathProgramCache]: Analyzing trace with hash -952214250, now seen corresponding path program 41 times [2019-08-05 10:32:18,882 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:18,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:18,897 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 43 conjunts are in the unsatisfiable core [2019-08-05 10:32:18,899 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:18,937 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:18,952 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:18,962 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:18,972 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:18,981 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:18,993 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:19,006 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:19,019 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:19,039 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:19,052 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:19,067 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:19,084 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:19,099 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:19,116 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:19,134 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:19,153 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:19,174 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:19,196 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:19,216 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:19,239 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:19,263 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:19,286 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:19,309 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:19,335 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:19,361 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:19,388 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:19,415 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:19,444 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:19,473 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:19,501 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:19,531 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:19,564 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:19,596 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:19,628 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:19,666 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:19,702 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:19,738 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:19,775 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:19,811 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:19,846 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:19,900 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:19,941 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:19,941 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:19,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-05 10:32:19,942 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-05 10:32:19,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-05 10:32:19,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:32:19,943 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 44 states. [2019-08-05 10:32:19,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:19,994 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-08-05 10:32:19,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-05 10:32:19,994 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 44 [2019-08-05 10:32:19,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:19,995 INFO L225 Difference]: With dead ends: 48 [2019-08-05 10:32:19,995 INFO L226 Difference]: Without dead ends: 48 [2019-08-05 10:32:19,996 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:32:19,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-08-05 10:32:19,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-08-05 10:32:19,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-05 10:32:19,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-08-05 10:32:19,998 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 44 [2019-08-05 10:32:19,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:19,998 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-08-05 10:32:19,998 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-05 10:32:19,998 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-08-05 10:32:19,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-08-05 10:32:19,999 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:19,999 INFO L399 BasicCegarLoop]: trace histogram [42, 1, 1, 1] [2019-08-05 10:32:19,999 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:19,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:19,999 INFO L82 PathProgramCache]: Analyzing trace with hash 546136992, now seen corresponding path program 42 times [2019-08-05 10:32:20,000 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:20,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:20,015 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 44 conjunts are in the unsatisfiable core [2019-08-05 10:32:20,017 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:20,068 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:20,088 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:20,096 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:20,107 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:20,118 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:20,129 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:20,142 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:20,158 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:20,172 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:20,189 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:20,203 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:20,220 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:20,236 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:20,253 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:20,272 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:20,350 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:20,377 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:20,460 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:20,480 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:20,509 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:20,542 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:20,566 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:20,606 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:20,632 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:20,658 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:20,687 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:20,712 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:20,779 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:20,810 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:20,838 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:20,868 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:20,897 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:20,929 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:20,960 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:20,994 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:21,028 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:21,064 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:21,101 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:21,135 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:21,171 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:21,207 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:21,245 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:21,287 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:21,287 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:21,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-05 10:32:21,287 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-05 10:32:21,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-05 10:32:21,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:32:21,288 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 45 states. [2019-08-05 10:32:21,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:21,343 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-08-05 10:32:21,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-05 10:32:21,343 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 45 [2019-08-05 10:32:21,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:21,344 INFO L225 Difference]: With dead ends: 49 [2019-08-05 10:32:21,344 INFO L226 Difference]: Without dead ends: 49 [2019-08-05 10:32:21,346 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:32:21,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-08-05 10:32:21,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-08-05 10:32:21,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-08-05 10:32:21,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-08-05 10:32:21,348 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 45 [2019-08-05 10:32:21,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:21,348 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-08-05 10:32:21,348 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-05 10:32:21,348 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-08-05 10:32:21,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-08-05 10:32:21,349 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:21,349 INFO L399 BasicCegarLoop]: trace histogram [43, 1, 1, 1] [2019-08-05 10:32:21,349 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:21,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:21,349 INFO L82 PathProgramCache]: Analyzing trace with hash -249614762, now seen corresponding path program 43 times [2019-08-05 10:32:21,350 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:21,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:21,366 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 45 conjunts are in the unsatisfiable core [2019-08-05 10:32:21,367 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:21,410 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:21,426 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:21,436 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:21,446 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:21,458 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:21,469 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:21,482 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:21,494 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:21,508 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:21,521 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:21,536 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:21,554 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:21,568 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:21,586 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:21,607 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:21,625 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:21,646 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:21,666 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:21,688 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:21,709 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:21,748 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:21,774 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:21,800 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:21,823 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:21,851 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:21,878 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:21,905 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:21,936 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:21,964 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:21,994 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:22,022 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:22,052 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:22,084 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:22,117 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:22,153 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:22,185 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:22,218 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:22,261 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:22,296 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:22,333 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:22,376 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:22,468 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:22,643 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:22,684 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:22,684 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:22,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-05 10:32:22,684 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-05 10:32:22,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-05 10:32:22,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:32:22,686 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 46 states. [2019-08-05 10:32:22,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:22,786 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-08-05 10:32:22,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-05 10:32:22,786 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 46 [2019-08-05 10:32:22,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:22,787 INFO L225 Difference]: With dead ends: 50 [2019-08-05 10:32:22,787 INFO L226 Difference]: Without dead ends: 50 [2019-08-05 10:32:22,788 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:32:22,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-08-05 10:32:22,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-08-05 10:32:22,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-08-05 10:32:22,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-08-05 10:32:22,790 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 46 [2019-08-05 10:32:22,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:22,790 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2019-08-05 10:32:22,790 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-05 10:32:22,790 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-08-05 10:32:22,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 10:32:22,791 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:22,791 INFO L399 BasicCegarLoop]: trace histogram [44, 1, 1, 1] [2019-08-05 10:32:22,791 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:22,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:22,791 INFO L82 PathProgramCache]: Analyzing trace with hash 851884640, now seen corresponding path program 44 times [2019-08-05 10:32:22,792 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:22,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:22,810 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 46 conjunts are in the unsatisfiable core [2019-08-05 10:32:22,811 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:22,841 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:22,865 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:22,874 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:22,883 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:22,894 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:22,906 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:22,919 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:22,932 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:22,945 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:22,959 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:22,975 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:22,991 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:23,007 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:23,024 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:23,042 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:23,061 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:23,083 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:23,105 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:23,127 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:23,149 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:23,170 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:23,195 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:23,219 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:23,248 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:23,273 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:23,299 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:23,324 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:23,350 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:23,379 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:23,408 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:23,439 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:23,473 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:23,504 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:23,538 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:23,573 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:23,607 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:23,642 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:23,677 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:23,714 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:23,751 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:23,789 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:23,829 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:23,911 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:23,951 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:23,996 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:23,996 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:23,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-05 10:32:23,997 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-05 10:32:23,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-05 10:32:23,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:32:23,998 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 47 states. [2019-08-05 10:32:24,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:24,308 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-08-05 10:32:24,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-05 10:32:24,308 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 47 [2019-08-05 10:32:24,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:24,309 INFO L225 Difference]: With dead ends: 51 [2019-08-05 10:32:24,309 INFO L226 Difference]: Without dead ends: 51 [2019-08-05 10:32:24,310 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:32:24,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-05 10:32:24,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-08-05 10:32:24,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-08-05 10:32:24,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-08-05 10:32:24,312 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 47 [2019-08-05 10:32:24,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:24,312 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-08-05 10:32:24,312 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-05 10:32:24,312 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-08-05 10:32:24,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-08-05 10:32:24,313 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:24,313 INFO L399 BasicCegarLoop]: trace histogram [45, 1, 1, 1] [2019-08-05 10:32:24,313 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:24,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:24,313 INFO L82 PathProgramCache]: Analyzing trace with hash 638627734, now seen corresponding path program 45 times [2019-08-05 10:32:24,314 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:24,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:24,330 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 47 conjunts are in the unsatisfiable core [2019-08-05 10:32:24,332 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:24,375 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:24,514 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:24,523 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:24,533 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:24,544 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:24,556 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:24,568 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:24,582 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:24,600 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:24,617 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:24,637 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:24,656 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:24,685 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:24,704 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:24,721 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:24,742 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:24,762 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:24,783 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:24,804 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:24,826 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:24,848 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:24,872 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:24,897 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:24,920 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:24,945 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:24,972 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:24,998 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:25,027 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:25,055 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:25,086 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:25,118 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:25,148 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:25,178 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:25,210 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:25,244 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:25,281 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:25,315 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:25,348 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:25,387 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:25,424 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:25,462 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:25,501 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:25,539 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:25,584 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:25,622 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:25,666 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:25,666 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:25,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-05 10:32:25,666 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-05 10:32:25,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-05 10:32:25,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:32:25,667 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 48 states. [2019-08-05 10:32:25,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:25,721 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-08-05 10:32:25,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-05 10:32:25,721 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 48 [2019-08-05 10:32:25,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:25,722 INFO L225 Difference]: With dead ends: 52 [2019-08-05 10:32:25,722 INFO L226 Difference]: Without dead ends: 52 [2019-08-05 10:32:25,723 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:32:25,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-08-05 10:32:25,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-08-05 10:32:25,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-05 10:32:25,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-08-05 10:32:25,725 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 48 [2019-08-05 10:32:25,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:25,725 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-08-05 10:32:25,725 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-05 10:32:25,725 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-08-05 10:32:25,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-08-05 10:32:25,726 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:25,726 INFO L399 BasicCegarLoop]: trace histogram [46, 1, 1, 1] [2019-08-05 10:32:25,726 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:25,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:25,727 INFO L82 PathProgramCache]: Analyzing trace with hash -1677369056, now seen corresponding path program 46 times [2019-08-05 10:32:25,727 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:25,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:25,744 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 48 conjunts are in the unsatisfiable core [2019-08-05 10:32:25,745 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:25,793 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:25,814 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:25,823 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:25,834 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:25,844 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:25,857 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:25,870 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:25,884 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:25,897 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:25,913 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:25,928 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:25,945 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:25,961 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:25,980 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:26,001 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:26,019 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:26,038 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:26,060 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:26,081 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:26,102 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:26,124 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:26,147 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:26,171 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:26,198 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:26,223 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:26,268 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:26,294 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:26,322 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:26,352 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:26,382 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:26,423 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:26,454 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:26,485 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:26,518 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:26,552 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:26,587 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:26,619 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:26,655 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:26,690 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:26,728 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:26,764 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:26,814 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:26,852 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:26,892 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:26,932 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:26,975 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:27,021 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:27,022 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:27,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-08-05 10:32:27,022 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-05 10:32:27,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-05 10:32:27,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:32:27,023 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 49 states. [2019-08-05 10:32:27,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:27,148 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-08-05 10:32:27,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-08-05 10:32:27,149 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 49 [2019-08-05 10:32:27,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:27,149 INFO L225 Difference]: With dead ends: 53 [2019-08-05 10:32:27,149 INFO L226 Difference]: Without dead ends: 53 [2019-08-05 10:32:27,150 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:32:27,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-08-05 10:32:27,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-08-05 10:32:27,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-08-05 10:32:27,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-08-05 10:32:27,152 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 49 [2019-08-05 10:32:27,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:27,153 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-08-05 10:32:27,153 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-05 10:32:27,153 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-08-05 10:32:27,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-08-05 10:32:27,153 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:27,153 INFO L399 BasicCegarLoop]: trace histogram [47, 1, 1, 1] [2019-08-05 10:32:27,154 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:27,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:27,154 INFO L82 PathProgramCache]: Analyzing trace with hash -458825514, now seen corresponding path program 47 times [2019-08-05 10:32:27,155 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:27,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:27,172 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 49 conjunts are in the unsatisfiable core [2019-08-05 10:32:27,173 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:27,216 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:27,234 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:27,243 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:27,252 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:27,264 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:27,275 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:27,288 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:27,301 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:27,315 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:27,328 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:27,344 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:27,360 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:27,378 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:27,396 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:27,416 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:27,435 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:27,453 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:27,473 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:27,517 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:27,582 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:27,638 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:27,729 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:27,767 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:27,840 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:27,928 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:27,958 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:27,984 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:28,014 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:28,041 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:28,072 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:28,106 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:28,138 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:28,169 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:28,201 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:28,235 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:28,268 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:28,303 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:28,339 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:28,375 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:28,410 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:28,451 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:28,488 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:28,546 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:28,603 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:28,642 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:28,682 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:28,724 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:28,769 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:28,769 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:28,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-05 10:32:28,769 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-05 10:32:28,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-05 10:32:28,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:32:28,770 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 50 states. [2019-08-05 10:32:28,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:28,828 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-08-05 10:32:28,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-05 10:32:28,829 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 50 [2019-08-05 10:32:28,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:28,830 INFO L225 Difference]: With dead ends: 54 [2019-08-05 10:32:28,830 INFO L226 Difference]: Without dead ends: 54 [2019-08-05 10:32:28,831 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:32:28,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-05 10:32:28,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-08-05 10:32:28,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-08-05 10:32:28,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2019-08-05 10:32:28,833 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 50 [2019-08-05 10:32:28,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:28,833 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2019-08-05 10:32:28,833 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-05 10:32:28,833 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2019-08-05 10:32:28,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-08-05 10:32:28,834 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:28,834 INFO L399 BasicCegarLoop]: trace histogram [48, 1, 1, 1] [2019-08-05 10:32:28,834 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:28,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:28,834 INFO L82 PathProgramCache]: Analyzing trace with hash -1338681376, now seen corresponding path program 48 times [2019-08-05 10:32:28,835 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:28,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:28,851 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 50 conjunts are in the unsatisfiable core [2019-08-05 10:32:28,853 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:28,901 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:28,934 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:28,943 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:28,954 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:28,966 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:28,976 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:28,987 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:29,000 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:29,015 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:29,029 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:29,043 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:29,061 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:29,078 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:29,096 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:29,113 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:29,132 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:29,151 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:29,173 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:29,194 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:29,217 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:29,239 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:29,263 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:29,286 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:29,310 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:29,335 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:29,482 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:29,508 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:29,564 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:29,593 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:29,621 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:29,650 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:29,681 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:29,711 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:29,744 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:29,779 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:29,811 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:29,846 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:29,885 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:29,920 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:29,958 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:29,998 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:30,075 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:30,111 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:30,150 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:30,187 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:30,227 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:30,271 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:30,314 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:30,357 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:30,358 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:30,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-08-05 10:32:30,358 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-05 10:32:30,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-05 10:32:30,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:32:30,359 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 51 states. [2019-08-05 10:32:30,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:30,413 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-08-05 10:32:30,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-05 10:32:30,413 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 51 [2019-08-05 10:32:30,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:30,414 INFO L225 Difference]: With dead ends: 55 [2019-08-05 10:32:30,414 INFO L226 Difference]: Without dead ends: 55 [2019-08-05 10:32:30,415 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:32:30,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-08-05 10:32:30,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-08-05 10:32:30,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-08-05 10:32:30,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-08-05 10:32:30,417 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 51 [2019-08-05 10:32:30,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:30,417 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-08-05 10:32:30,417 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-08-05 10:32:30,418 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-08-05 10:32:30,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-08-05 10:32:30,418 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:30,418 INFO L399 BasicCegarLoop]: trace histogram [49, 1, 1, 1] [2019-08-05 10:32:30,418 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:30,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:30,419 INFO L82 PathProgramCache]: Analyzing trace with hash 1450557974, now seen corresponding path program 49 times [2019-08-05 10:32:30,419 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:30,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:30,434 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 51 conjunts are in the unsatisfiable core [2019-08-05 10:32:30,436 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:30,466 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:30,478 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:30,489 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:30,499 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:30,510 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:30,520 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:30,532 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:30,545 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:30,561 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:30,583 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:30,599 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:30,613 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:30,628 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:30,645 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:30,665 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:30,683 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:30,703 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:30,723 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:30,743 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:30,765 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:30,788 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:30,813 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:30,838 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:30,862 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:30,890 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:30,915 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:30,944 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:30,973 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:31,004 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:31,034 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:31,062 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:31,095 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:31,127 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:31,157 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:31,191 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:31,225 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:31,260 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:31,296 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:31,333 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:31,372 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:31,410 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:31,450 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:31,488 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:31,528 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:31,568 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:31,632 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:31,674 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:31,716 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:31,757 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:31,805 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:31,805 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:31,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-05 10:32:31,806 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-05 10:32:31,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-05 10:32:31,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:32:31,806 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 52 states. [2019-08-05 10:32:31,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:31,876 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-08-05 10:32:31,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-05 10:32:31,876 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 52 [2019-08-05 10:32:31,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:31,877 INFO L225 Difference]: With dead ends: 56 [2019-08-05 10:32:31,877 INFO L226 Difference]: Without dead ends: 56 [2019-08-05 10:32:31,878 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:32:31,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-08-05 10:32:31,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-08-05 10:32:31,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-08-05 10:32:31,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-08-05 10:32:31,880 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 52 [2019-08-05 10:32:31,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:31,881 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-08-05 10:32:31,881 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-05 10:32:31,881 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-08-05 10:32:31,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-08-05 10:32:31,881 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:31,881 INFO L399 BasicCegarLoop]: trace histogram [50, 1, 1, 1] [2019-08-05 10:32:31,882 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:31,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:31,882 INFO L82 PathProgramCache]: Analyzing trace with hash 2017631904, now seen corresponding path program 50 times [2019-08-05 10:32:31,883 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:31,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:31,901 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 52 conjunts are in the unsatisfiable core [2019-08-05 10:32:31,903 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:31,951 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:32,042 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:32,049 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:32,061 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:32,071 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:32,082 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:32,098 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:32,111 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:32,124 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:32,138 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:32,152 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:32,171 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:32,188 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:32,205 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:32,229 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:32,247 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:32,265 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:32,284 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:32,306 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:32,327 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:32,352 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:32,375 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:32,399 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:32,425 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:32,452 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:32,483 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:32,520 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:32,557 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:32,584 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:32,663 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:32,802 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:32,888 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:32,943 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:33,032 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:33,065 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:33,099 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:33,132 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:33,171 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:33,207 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:33,245 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:33,284 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:33,325 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:33,362 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:33,418 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:33,455 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:33,497 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:33,536 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:33,579 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:33,626 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:33,670 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:33,718 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:33,719 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:33,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-08-05 10:32:33,719 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-08-05 10:32:33,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-08-05 10:32:33,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:32:33,720 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 53 states. [2019-08-05 10:32:33,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:33,782 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-08-05 10:32:33,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-08-05 10:32:33,783 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 53 [2019-08-05 10:32:33,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:33,784 INFO L225 Difference]: With dead ends: 57 [2019-08-05 10:32:33,784 INFO L226 Difference]: Without dead ends: 57 [2019-08-05 10:32:33,785 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:32:33,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-05 10:32:33,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-08-05 10:32:33,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-08-05 10:32:33,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-08-05 10:32:33,787 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 53 [2019-08-05 10:32:33,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:33,787 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-08-05 10:32:33,787 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-08-05 10:32:33,788 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-08-05 10:32:33,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 10:32:33,788 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:33,788 INFO L399 BasicCegarLoop]: trace histogram [51, 1, 1, 1] [2019-08-05 10:32:33,788 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:33,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:33,789 INFO L82 PathProgramCache]: Analyzing trace with hash -1877912746, now seen corresponding path program 51 times [2019-08-05 10:32:33,789 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:33,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:33,808 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 54 conjunts are in the unsatisfiable core [2019-08-05 10:32:33,810 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:35,049 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:35,050 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:35,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-05 10:32:35,050 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-08-05 10:32:35,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-08-05 10:32:35,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:32:35,051 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 54 states. [2019-08-05 10:32:37,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:37,181 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-08-05 10:32:37,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-05 10:32:37,182 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 54 [2019-08-05 10:32:37,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:37,183 INFO L225 Difference]: With dead ends: 58 [2019-08-05 10:32:37,183 INFO L226 Difference]: Without dead ends: 58 [2019-08-05 10:32:37,183 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:32:37,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-08-05 10:32:37,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-08-05 10:32:37,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-08-05 10:32:37,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-08-05 10:32:37,186 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 54 [2019-08-05 10:32:37,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:37,186 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-08-05 10:32:37,186 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-08-05 10:32:37,186 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-08-05 10:32:37,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-08-05 10:32:37,186 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:37,187 INFO L399 BasicCegarLoop]: trace histogram [52, 1, 1, 1] [2019-08-05 10:32:37,187 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:37,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:37,187 INFO L82 PathProgramCache]: Analyzing trace with hash 1914254688, now seen corresponding path program 52 times [2019-08-05 10:32:37,188 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:37,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:37,208 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 55 conjunts are in the unsatisfiable core [2019-08-05 10:32:37,210 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:38,646 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:38,647 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:38,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-08-05 10:32:38,647 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-08-05 10:32:38,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-08-05 10:32:38,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:32:38,648 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 55 states. [2019-08-05 10:32:41,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:41,041 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-08-05 10:32:41,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-05 10:32:41,042 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 55 [2019-08-05 10:32:41,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:41,042 INFO L225 Difference]: With dead ends: 59 [2019-08-05 10:32:41,042 INFO L226 Difference]: Without dead ends: 59 [2019-08-05 10:32:41,043 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:32:41,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-08-05 10:32:41,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-08-05 10:32:41,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-08-05 10:32:41,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2019-08-05 10:32:41,046 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 55 [2019-08-05 10:32:41,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:41,047 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2019-08-05 10:32:41,047 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-08-05 10:32:41,047 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2019-08-05 10:32:41,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-08-05 10:32:41,047 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:41,048 INFO L399 BasicCegarLoop]: trace histogram [53, 1, 1, 1] [2019-08-05 10:32:41,048 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:41,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:41,048 INFO L82 PathProgramCache]: Analyzing trace with hash -787639146, now seen corresponding path program 53 times [2019-08-05 10:32:41,049 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:41,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:41,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 56 conjunts are in the unsatisfiable core [2019-08-05 10:32:41,071 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:42,290 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:42,291 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:42,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-08-05 10:32:42,291 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-08-05 10:32:42,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-08-05 10:32:42,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:32:42,292 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 56 states. [2019-08-05 10:32:44,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:44,344 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-08-05 10:32:44,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-08-05 10:32:44,345 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 56 [2019-08-05 10:32:44,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:44,346 INFO L225 Difference]: With dead ends: 60 [2019-08-05 10:32:44,346 INFO L226 Difference]: Without dead ends: 60 [2019-08-05 10:32:44,346 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:32:44,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-05 10:32:44,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-08-05 10:32:44,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-08-05 10:32:44,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2019-08-05 10:32:44,348 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 56 [2019-08-05 10:32:44,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:44,348 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2019-08-05 10:32:44,349 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-08-05 10:32:44,349 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2019-08-05 10:32:44,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-08-05 10:32:44,349 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:44,349 INFO L399 BasicCegarLoop]: trace histogram [54, 1, 1, 1] [2019-08-05 10:32:44,349 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:44,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:44,350 INFO L82 PathProgramCache]: Analyzing trace with hash 1352997920, now seen corresponding path program 54 times [2019-08-05 10:32:44,350 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:44,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:44,370 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 57 conjunts are in the unsatisfiable core [2019-08-05 10:32:44,372 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:45,533 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:45,534 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:45,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2019-08-05 10:32:45,534 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-08-05 10:32:45,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-08-05 10:32:45,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:32:45,535 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 57 states. [2019-08-05 10:32:47,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:47,508 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-08-05 10:32:47,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-08-05 10:32:47,509 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 57 [2019-08-05 10:32:47,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:47,510 INFO L225 Difference]: With dead ends: 61 [2019-08-05 10:32:47,510 INFO L226 Difference]: Without dead ends: 61 [2019-08-05 10:32:47,511 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:32:47,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-08-05 10:32:47,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-08-05 10:32:47,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-08-05 10:32:47,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-08-05 10:32:47,513 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 57 [2019-08-05 10:32:47,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:47,513 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-08-05 10:32:47,513 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-08-05 10:32:47,513 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-08-05 10:32:47,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-08-05 10:32:47,514 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:47,514 INFO L399 BasicCegarLoop]: trace histogram [55, 1, 1, 1] [2019-08-05 10:32:47,514 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:47,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:47,514 INFO L82 PathProgramCache]: Analyzing trace with hash -1006729770, now seen corresponding path program 55 times [2019-08-05 10:32:47,515 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:47,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:47,541 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 58 conjunts are in the unsatisfiable core [2019-08-05 10:32:47,543 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:49,143 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:49,144 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:49,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-08-05 10:32:49,144 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-08-05 10:32:49,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-08-05 10:32:49,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 10:32:49,145 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 58 states. [2019-08-05 10:32:51,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:51,194 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-08-05 10:32:51,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-08-05 10:32:51,195 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 58 [2019-08-05 10:32:51,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:51,196 INFO L225 Difference]: With dead ends: 62 [2019-08-05 10:32:51,196 INFO L226 Difference]: Without dead ends: 62 [2019-08-05 10:32:51,196 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 10:32:51,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-08-05 10:32:51,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-08-05 10:32:51,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-08-05 10:32:51,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2019-08-05 10:32:51,199 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 58 [2019-08-05 10:32:51,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:51,199 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2019-08-05 10:32:51,199 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-08-05 10:32:51,200 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-08-05 10:32:51,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-08-05 10:32:51,200 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:51,200 INFO L399 BasicCegarLoop]: trace histogram [56, 1, 1, 1] [2019-08-05 10:32:51,200 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:51,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:51,201 INFO L82 PathProgramCache]: Analyzing trace with hash -1143844128, now seen corresponding path program 56 times [2019-08-05 10:32:51,201 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:51,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:51,222 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 59 conjunts are in the unsatisfiable core [2019-08-05 10:32:51,224 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:52,630 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:52,630 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:52,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2019-08-05 10:32:52,630 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-08-05 10:32:52,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-08-05 10:32:52,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:32:52,631 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 59 states. [2019-08-05 10:32:54,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:54,858 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-08-05 10:32:54,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-08-05 10:32:54,859 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 59 [2019-08-05 10:32:54,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:54,860 INFO L225 Difference]: With dead ends: 63 [2019-08-05 10:32:54,860 INFO L226 Difference]: Without dead ends: 63 [2019-08-05 10:32:54,860 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:32:54,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-05 10:32:54,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-08-05 10:32:54,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-08-05 10:32:54,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2019-08-05 10:32:54,863 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 59 [2019-08-05 10:32:54,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:54,863 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2019-08-05 10:32:54,863 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-08-05 10:32:54,863 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2019-08-05 10:32:54,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-08-05 10:32:54,864 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:54,864 INFO L399 BasicCegarLoop]: trace histogram [57, 1, 1, 1] [2019-08-05 10:32:54,864 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:54,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:54,864 INFO L82 PathProgramCache]: Analyzing trace with hash -1099421930, now seen corresponding path program 57 times [2019-08-05 10:32:54,865 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:54,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:54,882 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 60 conjunts are in the unsatisfiable core [2019-08-05 10:32:54,884 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:56,180 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:56,180 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:56,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2019-08-05 10:32:56,181 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-08-05 10:32:56,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-08-05 10:32:56,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:32:56,181 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 60 states. [2019-08-05 10:32:58,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:58,519 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2019-08-05 10:32:58,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-08-05 10:32:58,519 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 60 [2019-08-05 10:32:58,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:58,520 INFO L225 Difference]: With dead ends: 64 [2019-08-05 10:32:58,520 INFO L226 Difference]: Without dead ends: 64 [2019-08-05 10:32:58,520 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:32:58,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-08-05 10:32:58,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-08-05 10:32:58,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-08-05 10:32:58,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2019-08-05 10:32:58,522 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 60 [2019-08-05 10:32:58,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:58,523 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2019-08-05 10:32:58,523 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-08-05 10:32:58,523 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2019-08-05 10:32:58,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 10:32:58,524 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:58,524 INFO L399 BasicCegarLoop]: trace histogram [58, 1, 1, 1] [2019-08-05 10:32:58,524 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:58,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:58,525 INFO L82 PathProgramCache]: Analyzing trace with hash 277666208, now seen corresponding path program 58 times [2019-08-05 10:32:58,525 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:58,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:58,546 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 61 conjunts are in the unsatisfiable core [2019-08-05 10:32:58,548 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:00,103 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:00,103 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:00,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2019-08-05 10:33:00,103 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-08-05 10:33:00,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-08-05 10:33:00,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 10:33:00,104 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 61 states. [2019-08-05 10:33:02,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:02,366 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-08-05 10:33:02,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-08-05 10:33:02,366 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 61 [2019-08-05 10:33:02,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:02,367 INFO L225 Difference]: With dead ends: 65 [2019-08-05 10:33:02,367 INFO L226 Difference]: Without dead ends: 65 [2019-08-05 10:33:02,368 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 10:33:02,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-08-05 10:33:02,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-08-05 10:33:02,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-08-05 10:33:02,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-08-05 10:33:02,370 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 61 [2019-08-05 10:33:02,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:02,370 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-08-05 10:33:02,370 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-08-05 10:33:02,370 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-08-05 10:33:02,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-08-05 10:33:02,371 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:02,371 INFO L399 BasicCegarLoop]: trace histogram [59, 1, 1, 1] [2019-08-05 10:33:02,371 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:33:02,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:02,371 INFO L82 PathProgramCache]: Analyzing trace with hash 17725526, now seen corresponding path program 59 times [2019-08-05 10:33:02,372 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:02,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:02,392 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 62 conjunts are in the unsatisfiable core [2019-08-05 10:33:02,394 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:04,023 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:04,023 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:04,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2019-08-05 10:33:04,024 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-08-05 10:33:04,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-08-05 10:33:04,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 10:33:04,024 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 62 states. [2019-08-05 10:33:06,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:06,361 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-08-05 10:33:06,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-08-05 10:33:06,361 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 62 [2019-08-05 10:33:06,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:06,362 INFO L225 Difference]: With dead ends: 66 [2019-08-05 10:33:06,362 INFO L226 Difference]: Without dead ends: 66 [2019-08-05 10:33:06,363 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 10:33:06,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-05 10:33:06,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-08-05 10:33:06,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-08-05 10:33:06,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2019-08-05 10:33:06,365 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 62 [2019-08-05 10:33:06,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:06,365 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2019-08-05 10:33:06,365 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-08-05 10:33:06,365 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-08-05 10:33:06,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-08-05 10:33:06,366 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:06,366 INFO L399 BasicCegarLoop]: trace histogram [60, 1, 1, 1] [2019-08-05 10:33:06,366 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:33:06,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:06,366 INFO L82 PathProgramCache]: Analyzing trace with hash 549498976, now seen corresponding path program 60 times [2019-08-05 10:33:06,367 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:06,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:06,389 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 63 conjunts are in the unsatisfiable core [2019-08-05 10:33:06,391 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:07,989 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:07,989 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:07,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2019-08-05 10:33:07,990 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-08-05 10:33:07,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-08-05 10:33:07,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 10:33:07,990 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 63 states. [2019-08-05 10:33:10,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:10,593 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2019-08-05 10:33:10,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-08-05 10:33:10,593 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 63 [2019-08-05 10:33:10,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:10,594 INFO L225 Difference]: With dead ends: 67 [2019-08-05 10:33:10,594 INFO L226 Difference]: Without dead ends: 67 [2019-08-05 10:33:10,595 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 10:33:10,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-08-05 10:33:10,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-08-05 10:33:10,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-08-05 10:33:10,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-08-05 10:33:10,597 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 63 [2019-08-05 10:33:10,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:10,598 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2019-08-05 10:33:10,598 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-08-05 10:33:10,598 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-08-05 10:33:10,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-08-05 10:33:10,598 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:10,599 INFO L399 BasicCegarLoop]: trace histogram [61, 1, 1, 1] [2019-08-05 10:33:10,599 INFO L418 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:33:10,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:10,599 INFO L82 PathProgramCache]: Analyzing trace with hash -145393258, now seen corresponding path program 61 times [2019-08-05 10:33:10,600 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:10,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:10,621 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 64 conjunts are in the unsatisfiable core [2019-08-05 10:33:10,623 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:12,091 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:12,091 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:12,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2019-08-05 10:33:12,091 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-08-05 10:33:12,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-08-05 10:33:12,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 10:33:12,092 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 64 states. [2019-08-05 10:33:14,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:14,706 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-08-05 10:33:14,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-08-05 10:33:14,707 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 64 [2019-08-05 10:33:14,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:14,707 INFO L225 Difference]: With dead ends: 68 [2019-08-05 10:33:14,708 INFO L226 Difference]: Without dead ends: 68 [2019-08-05 10:33:14,708 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 10:33:14,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-08-05 10:33:14,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-08-05 10:33:14,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-08-05 10:33:14,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2019-08-05 10:33:14,710 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 64 [2019-08-05 10:33:14,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:14,711 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2019-08-05 10:33:14,711 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-08-05 10:33:14,711 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2019-08-05 10:33:14,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-08-05 10:33:14,712 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:14,712 INFO L399 BasicCegarLoop]: trace histogram [62, 1, 1, 1] [2019-08-05 10:33:14,712 INFO L418 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:33:14,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:14,712 INFO L82 PathProgramCache]: Analyzing trace with hash -212216032, now seen corresponding path program 62 times [2019-08-05 10:33:14,713 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:14,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:14,730 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 65 conjunts are in the unsatisfiable core [2019-08-05 10:33:14,732 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:16,307 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:16,307 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:16,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2019-08-05 10:33:16,308 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-08-05 10:33:16,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-08-05 10:33:16,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 10:33:16,308 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 65 states. [2019-08-05 10:33:18,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:18,965 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2019-08-05 10:33:18,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-08-05 10:33:18,966 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 65 [2019-08-05 10:33:18,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:18,966 INFO L225 Difference]: With dead ends: 69 [2019-08-05 10:33:18,967 INFO L226 Difference]: Without dead ends: 69 [2019-08-05 10:33:18,967 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 10:33:18,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-05 10:33:18,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-08-05 10:33:18,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-05 10:33:18,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2019-08-05 10:33:18,969 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 65 [2019-08-05 10:33:18,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:18,969 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2019-08-05 10:33:18,970 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-08-05 10:33:18,970 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2019-08-05 10:33:18,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-08-05 10:33:18,970 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:18,970 INFO L399 BasicCegarLoop]: trace histogram [63, 1, 1, 1] [2019-08-05 10:33:18,970 INFO L418 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:33:18,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:18,971 INFO L82 PathProgramCache]: Analyzing trace with hash 2011245270, now seen corresponding path program 63 times [2019-08-05 10:33:18,971 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:18,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:18,988 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 66 conjunts are in the unsatisfiable core [2019-08-05 10:33:18,990 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:20,512 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:20,512 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:20,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2019-08-05 10:33:20,513 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-08-05 10:33:20,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-08-05 10:33:20,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 10:33:20,513 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 66 states. [2019-08-05 10:33:23,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:23,153 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-08-05 10:33:23,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-08-05 10:33:23,153 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 66 [2019-08-05 10:33:23,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:23,154 INFO L225 Difference]: With dead ends: 70 [2019-08-05 10:33:23,154 INFO L226 Difference]: Without dead ends: 70 [2019-08-05 10:33:23,155 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 10:33:23,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-08-05 10:33:23,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-08-05 10:33:23,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-08-05 10:33:23,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2019-08-05 10:33:23,156 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 66 [2019-08-05 10:33:23,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:23,157 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2019-08-05 10:33:23,157 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-08-05 10:33:23,157 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2019-08-05 10:33:23,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-08-05 10:33:23,158 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:23,158 INFO L399 BasicCegarLoop]: trace histogram [64, 1, 1, 1] [2019-08-05 10:33:23,158 INFO L418 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:33:23,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:23,159 INFO L82 PathProgramCache]: Analyzing trace with hash -2075898400, now seen corresponding path program 64 times [2019-08-05 10:33:23,159 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:23,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:23,176 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 67 conjunts are in the unsatisfiable core [2019-08-05 10:33:23,178 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:25,012 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:25,013 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:25,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2019-08-05 10:33:25,013 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-08-05 10:33:25,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-08-05 10:33:25,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:33:25,014 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 67 states. [2019-08-05 10:33:27,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:27,744 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2019-08-05 10:33:27,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-08-05 10:33:27,744 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 67 [2019-08-05 10:33:27,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:27,745 INFO L225 Difference]: With dead ends: 71 [2019-08-05 10:33:27,745 INFO L226 Difference]: Without dead ends: 71 [2019-08-05 10:33:27,746 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:33:27,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-08-05 10:33:27,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-08-05 10:33:27,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-08-05 10:33:27,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2019-08-05 10:33:27,747 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 67 [2019-08-05 10:33:27,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:27,747 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2019-08-05 10:33:27,747 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-08-05 10:33:27,748 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-08-05 10:33:27,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 10:33:27,748 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:27,748 INFO L399 BasicCegarLoop]: trace histogram [65, 1, 1, 1] [2019-08-05 10:33:27,748 INFO L418 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:33:27,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:27,748 INFO L82 PathProgramCache]: Analyzing trace with hash 71666710, now seen corresponding path program 65 times [2019-08-05 10:33:27,749 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:27,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:27,766 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 68 conjunts are in the unsatisfiable core [2019-08-05 10:33:27,768 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:29,706 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:29,706 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:29,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2019-08-05 10:33:29,706 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-08-05 10:33:29,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-08-05 10:33:29,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:33:29,707 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 68 states. [2019-08-05 10:33:32,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:32,516 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2019-08-05 10:33:32,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-08-05 10:33:32,516 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 68 [2019-08-05 10:33:32,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:32,517 INFO L225 Difference]: With dead ends: 72 [2019-08-05 10:33:32,517 INFO L226 Difference]: Without dead ends: 72 [2019-08-05 10:33:32,517 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:33:32,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-08-05 10:33:32,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-08-05 10:33:32,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-08-05 10:33:32,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2019-08-05 10:33:32,520 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 68 [2019-08-05 10:33:32,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:32,520 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2019-08-05 10:33:32,520 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-08-05 10:33:32,520 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2019-08-05 10:33:32,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-08-05 10:33:32,521 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:32,521 INFO L399 BasicCegarLoop]: trace histogram [66, 1, 1, 1] [2019-08-05 10:33:32,521 INFO L418 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:33:32,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:32,521 INFO L82 PathProgramCache]: Analyzing trace with hash -2073291616, now seen corresponding path program 66 times [2019-08-05 10:33:32,521 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:32,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:32,542 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 69 conjunts are in the unsatisfiable core [2019-08-05 10:33:32,545 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:34,326 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:34,326 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:34,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2019-08-05 10:33:34,327 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-08-05 10:33:34,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-08-05 10:33:34,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 10:33:34,327 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 69 states. [2019-08-05 10:33:37,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:37,238 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2019-08-05 10:33:37,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-08-05 10:33:37,238 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 69 [2019-08-05 10:33:37,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:37,239 INFO L225 Difference]: With dead ends: 73 [2019-08-05 10:33:37,239 INFO L226 Difference]: Without dead ends: 73 [2019-08-05 10:33:37,240 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 10:33:37,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-08-05 10:33:37,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-08-05 10:33:37,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-08-05 10:33:37,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-08-05 10:33:37,241 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 69 [2019-08-05 10:33:37,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:37,241 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2019-08-05 10:33:37,241 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-08-05 10:33:37,241 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-08-05 10:33:37,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-08-05 10:33:37,242 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:37,242 INFO L399 BasicCegarLoop]: trace histogram [67, 1, 1, 1] [2019-08-05 10:33:37,242 INFO L418 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:33:37,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:37,242 INFO L82 PathProgramCache]: Analyzing trace with hash 152477014, now seen corresponding path program 67 times [2019-08-05 10:33:37,243 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:37,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:37,266 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 70 conjunts are in the unsatisfiable core [2019-08-05 10:33:37,268 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:39,046 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:39,047 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:39,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2019-08-05 10:33:39,047 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-08-05 10:33:39,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-08-05 10:33:39,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 10:33:39,047 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 70 states. [2019-08-05 10:33:42,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:42,106 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-08-05 10:33:42,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-08-05 10:33:42,107 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 70 [2019-08-05 10:33:42,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:42,108 INFO L225 Difference]: With dead ends: 74 [2019-08-05 10:33:42,108 INFO L226 Difference]: Without dead ends: 74 [2019-08-05 10:33:42,108 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 10:33:42,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-08-05 10:33:42,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-08-05 10:33:42,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-08-05 10:33:42,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2019-08-05 10:33:42,111 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 70 [2019-08-05 10:33:42,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:42,112 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2019-08-05 10:33:42,112 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-08-05 10:33:42,112 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2019-08-05 10:33:42,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-08-05 10:33:42,112 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:42,113 INFO L399 BasicCegarLoop]: trace histogram [68, 1, 1, 1] [2019-08-05 10:33:42,113 INFO L418 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:33:42,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:42,113 INFO L82 PathProgramCache]: Analyzing trace with hash 431827808, now seen corresponding path program 68 times [2019-08-05 10:33:42,114 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:42,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:42,138 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 71 conjunts are in the unsatisfiable core [2019-08-05 10:33:42,140 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:44,168 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:44,168 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:44,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2019-08-05 10:33:44,169 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-08-05 10:33:44,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-08-05 10:33:44,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 10:33:44,169 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 71 states. [2019-08-05 10:33:47,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:47,420 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-08-05 10:33:47,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-08-05 10:33:47,420 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 71 [2019-08-05 10:33:47,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:47,421 INFO L225 Difference]: With dead ends: 75 [2019-08-05 10:33:47,422 INFO L226 Difference]: Without dead ends: 75 [2019-08-05 10:33:47,422 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 10:33:47,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-08-05 10:33:47,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-08-05 10:33:47,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-05 10:33:47,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2019-08-05 10:33:47,424 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 71 [2019-08-05 10:33:47,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:47,425 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2019-08-05 10:33:47,425 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-08-05 10:33:47,425 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2019-08-05 10:33:47,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-08-05 10:33:47,426 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:47,426 INFO L399 BasicCegarLoop]: trace histogram [69, 1, 1, 1] [2019-08-05 10:33:47,426 INFO L418 AbstractCegarLoop]: === Iteration 70 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:33:47,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:47,426 INFO L82 PathProgramCache]: Analyzing trace with hash 501767830, now seen corresponding path program 69 times [2019-08-05 10:33:47,427 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:47,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:47,453 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 72 conjunts are in the unsatisfiable core [2019-08-05 10:33:47,456 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:49,839 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:49,839 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:49,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2019-08-05 10:33:49,839 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-08-05 10:33:49,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-08-05 10:33:49,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 10:33:49,840 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 72 states. [2019-08-05 10:33:52,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:52,992 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2019-08-05 10:33:52,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-08-05 10:33:52,992 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 72 [2019-08-05 10:33:52,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:52,993 INFO L225 Difference]: With dead ends: 76 [2019-08-05 10:33:52,993 INFO L226 Difference]: Without dead ends: 76 [2019-08-05 10:33:52,994 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 10:33:52,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-08-05 10:33:52,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-08-05 10:33:52,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-08-05 10:33:52,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2019-08-05 10:33:52,996 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 72 [2019-08-05 10:33:52,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:52,996 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2019-08-05 10:33:52,996 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-08-05 10:33:52,997 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2019-08-05 10:33:52,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-08-05 10:33:52,997 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:52,997 INFO L399 BasicCegarLoop]: trace histogram [70, 1, 1, 1] [2019-08-05 10:33:52,997 INFO L418 AbstractCegarLoop]: === Iteration 71 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:33:52,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:52,998 INFO L82 PathProgramCache]: Analyzing trace with hash -1625058784, now seen corresponding path program 70 times [2019-08-05 10:33:52,998 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:53,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:53,024 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 73 conjunts are in the unsatisfiable core [2019-08-05 10:33:53,026 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:55,369 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:55,369 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:55,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2019-08-05 10:33:55,370 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-08-05 10:33:55,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-08-05 10:33:55,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 10:33:55,371 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 73 states. [2019-08-05 10:33:58,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:58,621 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2019-08-05 10:33:58,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-08-05 10:33:58,621 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 73 [2019-08-05 10:33:58,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:58,622 INFO L225 Difference]: With dead ends: 77 [2019-08-05 10:33:58,622 INFO L226 Difference]: Without dead ends: 77 [2019-08-05 10:33:58,623 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 10:33:58,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-08-05 10:33:58,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-08-05 10:33:58,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-05 10:33:58,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-08-05 10:33:58,625 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 73 [2019-08-05 10:33:58,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:58,625 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-08-05 10:33:58,625 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-08-05 10:33:58,625 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-08-05 10:33:58,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-08-05 10:33:58,626 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:58,626 INFO L399 BasicCegarLoop]: trace histogram [71, 1, 1, 1] [2019-08-05 10:33:58,627 INFO L418 AbstractCegarLoop]: === Iteration 72 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:33:58,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:58,627 INFO L82 PathProgramCache]: Analyzing trace with hash 1162792918, now seen corresponding path program 71 times [2019-08-05 10:33:58,628 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:58,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:58,652 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 74 conjunts are in the unsatisfiable core [2019-08-05 10:33:58,654 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:01,057 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:01,058 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:01,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2019-08-05 10:34:01,058 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-08-05 10:34:01,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-08-05 10:34:01,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 10:34:01,059 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 74 states. [2019-08-05 10:34:04,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:04,400 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2019-08-05 10:34:04,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-08-05 10:34:04,401 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 74 [2019-08-05 10:34:04,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:04,402 INFO L225 Difference]: With dead ends: 78 [2019-08-05 10:34:04,402 INFO L226 Difference]: Without dead ends: 78 [2019-08-05 10:34:04,403 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 10:34:04,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-08-05 10:34:04,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-08-05 10:34:04,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-08-05 10:34:04,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2019-08-05 10:34:04,405 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 74 [2019-08-05 10:34:04,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:04,405 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2019-08-05 10:34:04,405 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-08-05 10:34:04,405 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2019-08-05 10:34:04,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-08-05 10:34:04,406 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:04,406 INFO L399 BasicCegarLoop]: trace histogram [72, 1, 1, 1] [2019-08-05 10:34:04,406 INFO L418 AbstractCegarLoop]: === Iteration 73 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:34:04,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:04,407 INFO L82 PathProgramCache]: Analyzing trace with hash 1686849760, now seen corresponding path program 72 times [2019-08-05 10:34:04,407 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:04,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:04,434 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 75 conjunts are in the unsatisfiable core [2019-08-05 10:34:04,436 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:06,837 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:06,837 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:06,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2019-08-05 10:34:06,838 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-08-05 10:34:06,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-08-05 10:34:06,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 10:34:06,838 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 75 states. [2019-08-05 10:34:10,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:10,466 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2019-08-05 10:34:10,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-08-05 10:34:10,466 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 75 [2019-08-05 10:34:10,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:10,467 INFO L225 Difference]: With dead ends: 79 [2019-08-05 10:34:10,467 INFO L226 Difference]: Without dead ends: 79 [2019-08-05 10:34:10,467 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 10:34:10,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-08-05 10:34:10,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-08-05 10:34:10,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-08-05 10:34:10,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2019-08-05 10:34:10,469 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 75 [2019-08-05 10:34:10,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:10,469 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2019-08-05 10:34:10,469 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-08-05 10:34:10,470 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2019-08-05 10:34:10,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-08-05 10:34:10,470 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:10,470 INFO L399 BasicCegarLoop]: trace histogram [73, 1, 1, 1] [2019-08-05 10:34:10,471 INFO L418 AbstractCegarLoop]: === Iteration 74 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:34:10,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:10,471 INFO L82 PathProgramCache]: Analyzing trace with hash 752742678, now seen corresponding path program 73 times [2019-08-05 10:34:10,472 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:10,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:10,497 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 76 conjunts are in the unsatisfiable core [2019-08-05 10:34:10,499 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:12,562 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:12,562 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:12,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2019-08-05 10:34:12,562 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-08-05 10:34:12,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-08-05 10:34:12,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 10:34:12,563 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 76 states. [2019-08-05 10:34:16,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:16,203 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2019-08-05 10:34:16,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-08-05 10:34:16,204 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 76 [2019-08-05 10:34:16,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:16,204 INFO L225 Difference]: With dead ends: 80 [2019-08-05 10:34:16,204 INFO L226 Difference]: Without dead ends: 80 [2019-08-05 10:34:16,205 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 10:34:16,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-08-05 10:34:16,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-08-05 10:34:16,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-08-05 10:34:16,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2019-08-05 10:34:16,207 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 76 [2019-08-05 10:34:16,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:16,207 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2019-08-05 10:34:16,207 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-08-05 10:34:16,207 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2019-08-05 10:34:16,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 10:34:16,208 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:16,208 INFO L399 BasicCegarLoop]: trace histogram [74, 1, 1, 1] [2019-08-05 10:34:16,208 INFO L418 AbstractCegarLoop]: === Iteration 75 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:34:16,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:16,208 INFO L82 PathProgramCache]: Analyzing trace with hash 1860194208, now seen corresponding path program 74 times [2019-08-05 10:34:16,209 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:16,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:16,229 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 77 conjunts are in the unsatisfiable core [2019-08-05 10:34:16,232 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:18,419 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:18,419 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:18,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2019-08-05 10:34:18,419 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-08-05 10:34:18,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-08-05 10:34:18,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 10:34:18,420 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 77 states. [2019-08-05 10:34:22,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:22,232 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2019-08-05 10:34:22,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-08-05 10:34:22,232 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 77 [2019-08-05 10:34:22,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:22,233 INFO L225 Difference]: With dead ends: 81 [2019-08-05 10:34:22,233 INFO L226 Difference]: Without dead ends: 81 [2019-08-05 10:34:22,234 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 10:34:22,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-08-05 10:34:22,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-08-05 10:34:22,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-08-05 10:34:22,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-08-05 10:34:22,235 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 77 [2019-08-05 10:34:22,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:22,235 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2019-08-05 10:34:22,235 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-08-05 10:34:22,236 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-08-05 10:34:22,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-08-05 10:34:22,236 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:22,236 INFO L399 BasicCegarLoop]: trace histogram [75, 1, 1, 1] [2019-08-05 10:34:22,237 INFO L418 AbstractCegarLoop]: === Iteration 76 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:34:22,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:22,237 INFO L82 PathProgramCache]: Analyzing trace with hash 1831453270, now seen corresponding path program 75 times [2019-08-05 10:34:22,237 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:22,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:22,266 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 78 conjunts are in the unsatisfiable core [2019-08-05 10:34:22,269 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:24,913 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:24,913 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:24,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2019-08-05 10:34:24,913 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-08-05 10:34:24,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-08-05 10:34:24,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 10:34:24,914 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 78 states. [2019-08-05 10:34:28,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:28,761 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2019-08-05 10:34:28,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-08-05 10:34:28,762 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 78 [2019-08-05 10:34:28,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:28,763 INFO L225 Difference]: With dead ends: 82 [2019-08-05 10:34:28,763 INFO L226 Difference]: Without dead ends: 82 [2019-08-05 10:34:28,764 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 10:34:28,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-08-05 10:34:28,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2019-08-05 10:34:28,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-08-05 10:34:28,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2019-08-05 10:34:28,765 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 78 [2019-08-05 10:34:28,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:28,766 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2019-08-05 10:34:28,766 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-08-05 10:34:28,766 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2019-08-05 10:34:28,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-08-05 10:34:28,766 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:28,767 INFO L399 BasicCegarLoop]: trace histogram [76, 1, 1, 1] [2019-08-05 10:34:28,767 INFO L418 AbstractCegarLoop]: === Iteration 77 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:34:28,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:28,767 INFO L82 PathProgramCache]: Analyzing trace with hash 940484192, now seen corresponding path program 76 times [2019-08-05 10:34:28,768 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:28,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:28,794 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 79 conjunts are in the unsatisfiable core [2019-08-05 10:34:28,797 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:33,024 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:33,024 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:33,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2019-08-05 10:34:33,025 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-08-05 10:34:33,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-08-05 10:34:33,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 10:34:33,025 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 79 states. [2019-08-05 10:34:37,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:37,037 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2019-08-05 10:34:37,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-08-05 10:34:37,037 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 79 [2019-08-05 10:34:37,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:37,038 INFO L225 Difference]: With dead ends: 83 [2019-08-05 10:34:37,038 INFO L226 Difference]: Without dead ends: 83 [2019-08-05 10:34:37,039 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 10:34:37,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-08-05 10:34:37,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-08-05 10:34:37,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-08-05 10:34:37,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2019-08-05 10:34:37,041 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 79 [2019-08-05 10:34:37,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:37,041 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2019-08-05 10:34:37,041 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-08-05 10:34:37,042 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2019-08-05 10:34:37,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-08-05 10:34:37,042 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:37,042 INFO L399 BasicCegarLoop]: trace histogram [77, 1, 1, 1] [2019-08-05 10:34:37,042 INFO L418 AbstractCegarLoop]: === Iteration 78 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:34:37,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:37,043 INFO L82 PathProgramCache]: Analyzing trace with hash -909753450, now seen corresponding path program 77 times [2019-08-05 10:34:37,043 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:37,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:37,064 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 80 conjunts are in the unsatisfiable core [2019-08-05 10:34:37,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:39,331 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:39,333 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:39,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2019-08-05 10:34:39,333 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-08-05 10:34:39,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-08-05 10:34:39,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=6163, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 10:34:39,334 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 80 states. [2019-08-05 10:34:43,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:43,445 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2019-08-05 10:34:43,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-08-05 10:34:43,446 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 80 [2019-08-05 10:34:43,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:43,446 INFO L225 Difference]: With dead ends: 84 [2019-08-05 10:34:43,447 INFO L226 Difference]: Without dead ends: 84 [2019-08-05 10:34:43,447 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=157, Invalid=6163, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 10:34:43,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-08-05 10:34:43,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2019-08-05 10:34:43,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-08-05 10:34:43,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2019-08-05 10:34:43,449 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 80 [2019-08-05 10:34:43,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:43,450 INFO L475 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2019-08-05 10:34:43,450 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-08-05 10:34:43,450 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2019-08-05 10:34:43,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-08-05 10:34:43,450 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:43,450 INFO L399 BasicCegarLoop]: trace histogram [78, 1, 1, 1] [2019-08-05 10:34:43,450 INFO L418 AbstractCegarLoop]: === Iteration 79 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:34:43,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:43,451 INFO L82 PathProgramCache]: Analyzing trace with hash 1862421792, now seen corresponding path program 78 times [2019-08-05 10:34:43,451 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:43,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:43,475 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 81 conjunts are in the unsatisfiable core [2019-08-05 10:34:43,477 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:46,001 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:46,002 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:46,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2019-08-05 10:34:46,002 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-08-05 10:34:46,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-08-05 10:34:46,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=6321, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 10:34:46,003 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 81 states. [2019-08-05 10:34:50,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:50,038 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2019-08-05 10:34:50,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-08-05 10:34:50,038 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 81 [2019-08-05 10:34:50,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:50,039 INFO L225 Difference]: With dead ends: 85 [2019-08-05 10:34:50,039 INFO L226 Difference]: Without dead ends: 85 [2019-08-05 10:34:50,039 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=159, Invalid=6321, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 10:34:50,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-08-05 10:34:50,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-08-05 10:34:50,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-08-05 10:34:50,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2019-08-05 10:34:50,041 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 81 [2019-08-05 10:34:50,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:50,041 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2019-08-05 10:34:50,041 INFO L476 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-08-05 10:34:50,041 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2019-08-05 10:34:50,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-08-05 10:34:50,041 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:50,041 INFO L399 BasicCegarLoop]: trace histogram [79, 1, 1, 1] [2019-08-05 10:34:50,042 INFO L418 AbstractCegarLoop]: === Iteration 80 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:34:50,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:50,042 INFO L82 PathProgramCache]: Analyzing trace with hash 1900508374, now seen corresponding path program 79 times [2019-08-05 10:34:50,042 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:50,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:50,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 82 conjunts are in the unsatisfiable core [2019-08-05 10:34:50,072 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:52,503 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:52,504 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:52,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2019-08-05 10:34:52,504 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-08-05 10:34:52,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-08-05 10:34:52,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=6481, Unknown=0, NotChecked=0, Total=6642 [2019-08-05 10:34:52,505 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 82 states. [2019-08-05 10:34:56,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:56,910 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2019-08-05 10:34:56,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-08-05 10:34:56,911 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 82 [2019-08-05 10:34:56,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:56,911 INFO L225 Difference]: With dead ends: 86 [2019-08-05 10:34:56,911 INFO L226 Difference]: Without dead ends: 86 [2019-08-05 10:34:56,912 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=161, Invalid=6481, Unknown=0, NotChecked=0, Total=6642 [2019-08-05 10:34:56,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-08-05 10:34:56,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2019-08-05 10:34:56,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-08-05 10:34:56,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2019-08-05 10:34:56,914 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 82 [2019-08-05 10:34:56,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:56,914 INFO L475 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2019-08-05 10:34:56,914 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-08-05 10:34:56,914 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2019-08-05 10:34:56,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-08-05 10:34:56,915 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:56,915 INFO L399 BasicCegarLoop]: trace histogram [80, 1, 1, 1] [2019-08-05 10:34:56,915 INFO L418 AbstractCegarLoop]: === Iteration 81 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:34:56,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:56,915 INFO L82 PathProgramCache]: Analyzing trace with hash -1213774880, now seen corresponding path program 80 times [2019-08-05 10:34:56,916 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:56,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:56,937 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 83 conjunts are in the unsatisfiable core [2019-08-05 10:34:56,939 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:00,510 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:00,510 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:00,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2019-08-05 10:35:00,510 INFO L454 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-08-05 10:35:00,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-08-05 10:35:00,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=6643, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 10:35:00,511 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 83 states. [2019-08-05 10:35:05,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:05,085 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2019-08-05 10:35:05,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-08-05 10:35:05,086 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 83 [2019-08-05 10:35:05,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:05,087 INFO L225 Difference]: With dead ends: 87 [2019-08-05 10:35:05,087 INFO L226 Difference]: Without dead ends: 87 [2019-08-05 10:35:05,087 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=163, Invalid=6643, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 10:35:05,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-08-05 10:35:05,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-08-05 10:35:05,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-08-05 10:35:05,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2019-08-05 10:35:05,090 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 83 [2019-08-05 10:35:05,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:05,090 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2019-08-05 10:35:05,090 INFO L476 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-08-05 10:35:05,090 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2019-08-05 10:35:05,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-08-05 10:35:05,091 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:05,092 INFO L399 BasicCegarLoop]: trace histogram [81, 1, 1, 1] [2019-08-05 10:35:05,092 INFO L418 AbstractCegarLoop]: === Iteration 82 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:05,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:05,092 INFO L82 PathProgramCache]: Analyzing trace with hash 1027692054, now seen corresponding path program 81 times [2019-08-05 10:35:05,093 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:05,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:05,121 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 84 conjunts are in the unsatisfiable core [2019-08-05 10:35:05,124 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:08,000 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:08,000 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:08,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2019-08-05 10:35:08,001 INFO L454 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-08-05 10:35:08,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-08-05 10:35:08,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=6807, Unknown=0, NotChecked=0, Total=6972 [2019-08-05 10:35:08,001 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 84 states. [2019-08-05 10:35:12,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:12,593 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2019-08-05 10:35:12,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-08-05 10:35:12,594 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 84 [2019-08-05 10:35:12,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:12,595 INFO L225 Difference]: With dead ends: 88 [2019-08-05 10:35:12,595 INFO L226 Difference]: Without dead ends: 88 [2019-08-05 10:35:12,595 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=165, Invalid=6807, Unknown=0, NotChecked=0, Total=6972 [2019-08-05 10:35:12,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-08-05 10:35:12,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2019-08-05 10:35:12,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-08-05 10:35:12,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2019-08-05 10:35:12,598 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 84 [2019-08-05 10:35:12,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:12,598 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2019-08-05 10:35:12,598 INFO L476 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-08-05 10:35:12,599 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2019-08-05 10:35:12,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 10:35:12,599 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:12,599 INFO L399 BasicCegarLoop]: trace histogram [82, 1, 1, 1] [2019-08-05 10:35:12,599 INFO L418 AbstractCegarLoop]: === Iteration 83 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:12,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:12,600 INFO L82 PathProgramCache]: Analyzing trace with hash 1793690272, now seen corresponding path program 82 times [2019-08-05 10:35:12,600 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:12,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:12,619 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 85 conjunts are in the unsatisfiable core [2019-08-05 10:35:12,621 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:15,276 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:15,277 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:15,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2019-08-05 10:35:15,277 INFO L454 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-08-05 10:35:15,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-08-05 10:35:15,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=6973, Unknown=0, NotChecked=0, Total=7140 [2019-08-05 10:35:15,278 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 85 states. [2019-08-05 10:35:19,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:19,973 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2019-08-05 10:35:19,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-08-05 10:35:19,974 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 85 [2019-08-05 10:35:19,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:19,974 INFO L225 Difference]: With dead ends: 89 [2019-08-05 10:35:19,975 INFO L226 Difference]: Without dead ends: 89 [2019-08-05 10:35:19,975 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=167, Invalid=6973, Unknown=0, NotChecked=0, Total=7140 [2019-08-05 10:35:19,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-08-05 10:35:19,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-08-05 10:35:19,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-08-05 10:35:19,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2019-08-05 10:35:19,977 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 85 [2019-08-05 10:35:19,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:19,977 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2019-08-05 10:35:19,977 INFO L476 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-08-05 10:35:19,977 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2019-08-05 10:35:19,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-08-05 10:35:19,978 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:19,978 INFO L399 BasicCegarLoop]: trace histogram [83, 1, 1, 1] [2019-08-05 10:35:19,978 INFO L418 AbstractCegarLoop]: === Iteration 84 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:19,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:19,979 INFO L82 PathProgramCache]: Analyzing trace with hash -230168746, now seen corresponding path program 83 times [2019-08-05 10:35:19,979 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:19,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:20,000 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 86 conjunts are in the unsatisfiable core [2019-08-05 10:35:20,002 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:22,893 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:22,894 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:22,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2019-08-05 10:35:22,894 INFO L454 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-08-05 10:35:22,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-08-05 10:35:22,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=7141, Unknown=0, NotChecked=0, Total=7310 [2019-08-05 10:35:22,895 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 86 states. [2019-08-05 10:35:27,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:27,761 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2019-08-05 10:35:27,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-08-05 10:35:27,762 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 86 [2019-08-05 10:35:27,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:27,763 INFO L225 Difference]: With dead ends: 90 [2019-08-05 10:35:27,763 INFO L226 Difference]: Without dead ends: 90 [2019-08-05 10:35:27,763 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=169, Invalid=7141, Unknown=0, NotChecked=0, Total=7310 [2019-08-05 10:35:27,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-08-05 10:35:27,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2019-08-05 10:35:27,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-08-05 10:35:27,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2019-08-05 10:35:27,765 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 86 [2019-08-05 10:35:27,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:27,766 INFO L475 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2019-08-05 10:35:27,766 INFO L476 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-08-05 10:35:27,766 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2019-08-05 10:35:27,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-08-05 10:35:27,766 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:27,767 INFO L399 BasicCegarLoop]: trace histogram [84, 1, 1, 1] [2019-08-05 10:35:27,767 INFO L418 AbstractCegarLoop]: === Iteration 85 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:27,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:27,767 INFO L82 PathProgramCache]: Analyzing trace with hash 1454711136, now seen corresponding path program 84 times [2019-08-05 10:35:27,768 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:27,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:27,805 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 87 conjunts are in the unsatisfiable core [2019-08-05 10:35:27,808 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:30,535 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:30,535 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:30,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2019-08-05 10:35:30,536 INFO L454 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-08-05 10:35:30,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-08-05 10:35:30,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=7311, Unknown=0, NotChecked=0, Total=7482 [2019-08-05 10:35:30,536 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 87 states. [2019-08-05 10:35:35,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:35,503 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2019-08-05 10:35:35,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-08-05 10:35:35,503 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 87 [2019-08-05 10:35:35,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:35,504 INFO L225 Difference]: With dead ends: 91 [2019-08-05 10:35:35,504 INFO L226 Difference]: Without dead ends: 91 [2019-08-05 10:35:35,505 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=171, Invalid=7311, Unknown=0, NotChecked=0, Total=7482 [2019-08-05 10:35:35,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-08-05 10:35:35,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-08-05 10:35:35,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-08-05 10:35:35,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2019-08-05 10:35:35,506 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 87 [2019-08-05 10:35:35,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:35,507 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2019-08-05 10:35:35,507 INFO L476 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-08-05 10:35:35,507 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2019-08-05 10:35:35,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-08-05 10:35:35,508 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:35,508 INFO L399 BasicCegarLoop]: trace histogram [85, 1, 1, 1] [2019-08-05 10:35:35,508 INFO L418 AbstractCegarLoop]: === Iteration 86 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:35,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:35,509 INFO L82 PathProgramCache]: Analyzing trace with hash 2146379926, now seen corresponding path program 85 times [2019-08-05 10:35:35,509 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:35,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:35,533 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 88 conjunts are in the unsatisfiable core [2019-08-05 10:35:35,535 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:38,450 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:38,451 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:38,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2019-08-05 10:35:38,451 INFO L454 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-08-05 10:35:38,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-08-05 10:35:38,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=7483, Unknown=0, NotChecked=0, Total=7656 [2019-08-05 10:35:38,452 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 88 states. [2019-08-05 10:35:43,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:43,590 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2019-08-05 10:35:43,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-08-05 10:35:43,590 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 88 [2019-08-05 10:35:43,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:43,591 INFO L225 Difference]: With dead ends: 92 [2019-08-05 10:35:43,591 INFO L226 Difference]: Without dead ends: 92 [2019-08-05 10:35:43,592 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=173, Invalid=7483, Unknown=0, NotChecked=0, Total=7656 [2019-08-05 10:35:43,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-08-05 10:35:43,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2019-08-05 10:35:43,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-08-05 10:35:43,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2019-08-05 10:35:43,595 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 88 [2019-08-05 10:35:43,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:43,595 INFO L475 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2019-08-05 10:35:43,596 INFO L476 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-08-05 10:35:43,596 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2019-08-05 10:35:43,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-08-05 10:35:43,596 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:43,596 INFO L399 BasicCegarLoop]: trace histogram [86, 1, 1, 1] [2019-08-05 10:35:43,597 INFO L418 AbstractCegarLoop]: === Iteration 87 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:43,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:43,597 INFO L82 PathProgramCache]: Analyzing trace with hash 2113275936, now seen corresponding path program 86 times [2019-08-05 10:35:43,597 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:43,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:43,618 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 89 conjunts are in the unsatisfiable core [2019-08-05 10:35:43,619 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:46,387 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:46,387 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:46,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2019-08-05 10:35:46,388 INFO L454 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-08-05 10:35:46,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-08-05 10:35:46,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=7657, Unknown=0, NotChecked=0, Total=7832 [2019-08-05 10:35:46,389 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 89 states. [2019-08-05 10:35:51,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:51,591 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2019-08-05 10:35:51,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-08-05 10:35:51,592 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 89 [2019-08-05 10:35:51,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:51,593 INFO L225 Difference]: With dead ends: 93 [2019-08-05 10:35:51,593 INFO L226 Difference]: Without dead ends: 93 [2019-08-05 10:35:51,593 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=175, Invalid=7657, Unknown=0, NotChecked=0, Total=7832 [2019-08-05 10:35:51,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-08-05 10:35:51,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2019-08-05 10:35:51,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-08-05 10:35:51,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2019-08-05 10:35:51,595 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 89 [2019-08-05 10:35:51,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:51,596 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2019-08-05 10:35:51,596 INFO L476 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-08-05 10:35:51,596 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2019-08-05 10:35:51,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-08-05 10:35:51,596 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:51,596 INFO L399 BasicCegarLoop]: trace histogram [87, 1, 1, 1] [2019-08-05 10:35:51,596 INFO L418 AbstractCegarLoop]: === Iteration 88 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:51,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:51,597 INFO L82 PathProgramCache]: Analyzing trace with hash 1087052246, now seen corresponding path program 87 times [2019-08-05 10:35:51,597 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:51,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:51,628 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 90 conjunts are in the unsatisfiable core [2019-08-05 10:35:51,631 INFO L279 TraceCheckSpWp]: Computing forward predicates... Received shutdown request... [2019-08-05 10:35:52,344 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2019-08-05 10:35:52,345 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-05 10:35:52,349 WARN L223 ceAbstractionStarter]: Timeout [2019-08-05 10:35:52,349 INFO L202 PluginConnector]: Adding new model BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:35:52 BoogieIcfgContainer [2019-08-05 10:35:52,349 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:35:52,351 INFO L168 Benchmark]: Toolchain (without parser) took 245179.88 ms. Allocated memory was 140.5 MB in the beginning and 242.2 MB in the end (delta: 101.7 MB). Free memory was 110.1 MB in the beginning and 64.3 MB in the end (delta: 45.8 MB). Peak memory consumption was 147.5 MB. Max. memory is 7.1 GB. [2019-08-05 10:35:52,351 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.26 ms. Allocated memory is still 140.5 MB. Free memory is still 111.0 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-08-05 10:35:52,352 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.02 ms. Allocated memory is still 140.5 MB. Free memory was 110.1 MB in the beginning and 108.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-08-05 10:35:52,353 INFO L168 Benchmark]: Boogie Preprocessor took 22.33 ms. Allocated memory is still 140.5 MB. Free memory was 108.0 MB in the beginning and 107.1 MB in the end (delta: 909.9 kB). Peak memory consumption was 909.9 kB. Max. memory is 7.1 GB. [2019-08-05 10:35:52,353 INFO L168 Benchmark]: RCFGBuilder took 303.91 ms. Allocated memory is still 140.5 MB. Free memory was 106.7 MB in the beginning and 96.5 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 7.1 GB. [2019-08-05 10:35:52,354 INFO L168 Benchmark]: TraceAbstraction took 244813.14 ms. Allocated memory was 140.5 MB in the beginning and 242.2 MB in the end (delta: 101.7 MB). Free memory was 96.5 MB in the beginning and 64.3 MB in the end (delta: 32.1 MB). Peak memory consumption was 133.8 MB. Max. memory is 7.1 GB. [2019-08-05 10:35:52,356 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.26 ms. Allocated memory is still 140.5 MB. Free memory is still 111.0 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 36.02 ms. Allocated memory is still 140.5 MB. Free memory was 110.1 MB in the beginning and 108.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 22.33 ms. Allocated memory is still 140.5 MB. Free memory was 108.0 MB in the beginning and 107.1 MB in the end (delta: 909.9 kB). Peak memory consumption was 909.9 kB. Max. memory is 7.1 GB. * RCFGBuilder took 303.91 ms. Allocated memory is still 140.5 MB. Free memory was 106.7 MB in the beginning and 96.5 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 244813.14 ms. Allocated memory was 140.5 MB in the beginning and 242.2 MB in the end (delta: 101.7 MB). Free memory was 96.5 MB in the beginning and 64.3 MB in the end (delta: 32.1 MB). Peak memory consumption was 133.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 24]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 24). Cancelled while BasicCegarLoop was analyzing trace of length 91 with TraceHistMax 87,while TraceCheckSpWp was constructing forward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 42 known predicates. - TimeoutResultAtElement [Line: 25]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 25). Cancelled while BasicCegarLoop was analyzing trace of length 91 with TraceHistMax 87,while TraceCheckSpWp was constructing forward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 42 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 2 error locations. TIMEOUT Result, 244.7s OverallTime, 88 OverallIterations, 87 TraceHistogramMax, 123.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 436 SDtfs, 0 SDslu, 8536 SDs, 0 SdLazy, 184498 SolverSat, 95 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 101.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3915 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 3828 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 115.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=93occurred in iteration=87, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 87 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 118.1s InterpolantComputationTime, 4002 NumberOfCodeBlocks, 4002 NumberOfCodeBlocksAsserted, 87 NumberOfCheckSat, 3915 ConstructedInterpolants, 0 QuantifiedInterpolants, 685299 SizeOfPredicates, 137 NumberOfNonLiveVariables, 8178 ConjunctsInSsa, 3951 ConjunctsInUnsatCore, 87 InterpolantComputations, 1 PerfectInterpolantSequences, 0/109736 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown