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/LuxembourgOctopus.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:36:30,103 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:36:30,105 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:36:30,116 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:36:30,117 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:36:30,118 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:36:30,119 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:36:30,121 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:36:30,122 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:36:30,123 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:36:30,124 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:36:30,125 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:36:30,125 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:36:30,126 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:36:30,127 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:36:30,128 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:36:30,129 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:36:30,130 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:36:30,132 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:36:30,134 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:36:30,135 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:36:30,136 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:36:30,137 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:36:30,138 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:36:30,141 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:36:30,141 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:36:30,141 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:36:30,142 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:36:30,143 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:36:30,144 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:36:30,144 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:36:30,145 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:36:30,146 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:36:30,147 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:36:30,148 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:36:30,148 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:36:30,149 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:36:30,149 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:36:30,149 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:36:30,150 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:36:30,151 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:36:30,183 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:36:30,194 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:36:30,197 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:36:30,199 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:36:30,199 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:36:30,200 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/LuxembourgOctopus.bpl [2019-08-05 10:36:30,201 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/LuxembourgOctopus.bpl' [2019-08-05 10:36:30,231 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:36:30,232 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:36:30,233 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:36:30,233 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:36:30,234 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:36:30,249 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "LuxembourgOctopus.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:36:30" (1/1) ... [2019-08-05 10:36:30,258 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "LuxembourgOctopus.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:36:30" (1/1) ... [2019-08-05 10:36:30,265 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 10:36:30,265 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 10:36:30,265 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 10:36:30,267 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:36:30,268 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:36:30,268 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:36:30,269 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:36:30,277 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "LuxembourgOctopus.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:36:30" (1/1) ... [2019-08-05 10:36:30,277 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "LuxembourgOctopus.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:36:30" (1/1) ... [2019-08-05 10:36:30,277 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "LuxembourgOctopus.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:36:30" (1/1) ... [2019-08-05 10:36:30,278 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "LuxembourgOctopus.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:36:30" (1/1) ... [2019-08-05 10:36:30,280 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "LuxembourgOctopus.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:36:30" (1/1) ... [2019-08-05 10:36:30,284 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "LuxembourgOctopus.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:36:30" (1/1) ... [2019-08-05 10:36:30,285 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "LuxembourgOctopus.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:36:30" (1/1) ... [2019-08-05 10:36:30,286 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:36:30,286 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:36:30,286 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:36:30,287 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:36:30,287 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "LuxembourgOctopus.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:36:30" (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:36:30,368 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2019-08-05 10:36:30,368 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-08-05 10:36:30,368 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-08-05 10:36:30,602 INFO L275 CfgBuilder]: Using library mode [2019-08-05 10:36:30,603 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-08-05 10:36:30,604 INFO L202 PluginConnector]: Adding new model LuxembourgOctopus.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:36:30 BoogieIcfgContainer [2019-08-05 10:36:30,604 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:36:30,606 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:36:30,606 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:36:30,610 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:36:30,611 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "LuxembourgOctopus.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:36:30" (1/2) ... [2019-08-05 10:36:30,612 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@138aaeea and model type LuxembourgOctopus.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:36:30, skipping insertion in model container [2019-08-05 10:36:30,612 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "LuxembourgOctopus.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:36:30" (2/2) ... [2019-08-05 10:36:30,615 INFO L109 eAbstractionObserver]: Analyzing ICFG LuxembourgOctopus.bpl [2019-08-05 10:36:30,625 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:36:30,632 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 10:36:30,649 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 10:36:30,675 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:36:30,676 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:36:30,676 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:36:30,676 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:36:30,676 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:36:30,677 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:36:30,677 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:36:30,677 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:36:30,677 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:36:30,691 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2019-08-05 10:36:30,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 10:36:30,699 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:30,700 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 10:36:30,702 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:30,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:30,708 INFO L82 PathProgramCache]: Analyzing trace with hash 30048, now seen corresponding path program 1 times [2019-08-05 10:36:30,752 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:30,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:30,782 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:36:30,785 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:30,834 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:36:30,836 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:36:30,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:36:30,840 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:36:30,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:36:30,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:36:30,853 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2019-08-05 10:36:30,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:30,893 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2019-08-05 10:36:30,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:36:30,896 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-05 10:36:30,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:30,908 INFO L225 Difference]: With dead ends: 9 [2019-08-05 10:36:30,909 INFO L226 Difference]: Without dead ends: 5 [2019-08-05 10:36:30,911 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:36:30,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-08-05 10:36:30,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-08-05 10:36:30,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-08-05 10:36:30,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-08-05 10:36:30,950 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-08-05 10:36:30,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:30,951 INFO L475 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-08-05 10:36:30,951 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:36:30,951 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-08-05 10:36:30,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 10:36:30,952 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:30,952 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 10:36:30,952 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:30,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:30,953 INFO L82 PathProgramCache]: Analyzing trace with hash 927622, now seen corresponding path program 1 times [2019-08-05 10:36:30,954 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:30,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:30,967 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:36:30,968 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:31,074 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:36:31,074 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:31,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 10:36:31,076 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:36:31,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:36:31,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:36:31,078 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2019-08-05 10:36:31,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:31,134 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-08-05 10:36:31,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:36:31,135 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-08-05 10:36:31,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:31,135 INFO L225 Difference]: With dead ends: 6 [2019-08-05 10:36:31,135 INFO L226 Difference]: Without dead ends: 6 [2019-08-05 10:36:31,137 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:36:31,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-08-05 10:36:31,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-08-05 10:36:31,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-05 10:36:31,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-08-05 10:36:31,139 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-08-05 10:36:31,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:31,140 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-08-05 10:36:31,140 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:36:31,140 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-08-05 10:36:31,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 10:36:31,140 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:31,141 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-08-05 10:36:31,141 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:31,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:31,141 INFO L82 PathProgramCache]: Analyzing trace with hash 28752416, now seen corresponding path program 2 times [2019-08-05 10:36:31,142 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:31,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:31,154 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 10:36:31,155 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:31,262 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:36:31,263 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:31,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:36:31,263 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:36:31,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:36:31,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:36:31,265 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2019-08-05 10:36:31,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:31,322 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-08-05 10:36:31,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:36:31,323 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-08-05 10:36:31,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:31,323 INFO L225 Difference]: With dead ends: 7 [2019-08-05 10:36:31,324 INFO L226 Difference]: Without dead ends: 7 [2019-08-05 10:36:31,325 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:36:31,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-05 10:36:31,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-05 10:36:31,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 10:36:31,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-08-05 10:36:31,328 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-08-05 10:36:31,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:31,328 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-08-05 10:36:31,328 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:36:31,328 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-08-05 10:36:31,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:36:31,329 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:31,329 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-08-05 10:36:31,329 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:31,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:31,330 INFO L82 PathProgramCache]: Analyzing trace with hash 891321030, now seen corresponding path program 3 times [2019-08-05 10:36:31,331 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:31,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:31,344 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 10:36:31,345 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:31,441 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:36:31,442 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:31,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:36:31,442 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:36:31,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:36:31,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:36:31,443 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2019-08-05 10:36:31,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:31,467 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-05 10:36:31,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:36:31,468 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-08-05 10:36:31,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:31,469 INFO L225 Difference]: With dead ends: 8 [2019-08-05 10:36:31,469 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 10:36:31,470 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:36:31,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 10:36:31,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-05 10:36:31,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 10:36:31,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-08-05 10:36:31,473 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-08-05 10:36:31,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:31,473 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-08-05 10:36:31,473 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:36:31,473 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-08-05 10:36:31,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 10:36:31,474 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:31,474 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-08-05 10:36:31,475 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:31,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:31,475 INFO L82 PathProgramCache]: Analyzing trace with hash 1861144288, now seen corresponding path program 4 times [2019-08-05 10:36:31,476 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:31,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:31,506 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:36:31,507 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:31,693 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:36:31,693 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:31,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:36:31,693 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:36:31,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:36:31,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:36:31,694 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2019-08-05 10:36:31,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:31,743 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-08-05 10:36:31,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:36:31,744 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-08-05 10:36:31,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:31,744 INFO L225 Difference]: With dead ends: 9 [2019-08-05 10:36:31,744 INFO L226 Difference]: Without dead ends: 9 [2019-08-05 10:36:31,745 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:36:31,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-05 10:36:31,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-08-05 10:36:31,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 10:36:31,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-08-05 10:36:31,747 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-08-05 10:36:31,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:31,748 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-08-05 10:36:31,748 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:36:31,748 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-08-05 10:36:31,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:36:31,749 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:31,749 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2019-08-05 10:36:31,749 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:31,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:31,750 INFO L82 PathProgramCache]: Analyzing trace with hash 1860894214, now seen corresponding path program 5 times [2019-08-05 10:36:31,751 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:31,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:31,766 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:36:31,767 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:31,996 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:36:31,997 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:31,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:36:31,999 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:36:31,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:36:31,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:36:32,000 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2019-08-05 10:36:32,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:32,023 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-08-05 10:36:32,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:36:32,024 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-08-05 10:36:32,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:32,025 INFO L225 Difference]: With dead ends: 10 [2019-08-05 10:36:32,025 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 10:36:32,026 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:36:32,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 10:36:32,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-08-05 10:36:32,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 10:36:32,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-08-05 10:36:32,029 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2019-08-05 10:36:32,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:32,029 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-08-05 10:36:32,029 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:36:32,030 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-08-05 10:36:32,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 10:36:32,030 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:32,030 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2019-08-05 10:36:32,031 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:32,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:32,031 INFO L82 PathProgramCache]: Analyzing trace with hash 1853141920, now seen corresponding path program 6 times [2019-08-05 10:36:32,032 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:32,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:32,048 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:36:32,049 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:32,288 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:36:32,288 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:32,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:36:32,289 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:36:32,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:36:32,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:36:32,290 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2019-08-05 10:36:32,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:32,320 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-08-05 10:36:32,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:36:32,321 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-08-05 10:36:32,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:32,321 INFO L225 Difference]: With dead ends: 11 [2019-08-05 10:36:32,321 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 10:36:32,322 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:36:32,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 10:36:32,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-05 10:36:32,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 10:36:32,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-08-05 10:36:32,324 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2019-08-05 10:36:32,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:32,325 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-08-05 10:36:32,325 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:36:32,325 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-08-05 10:36:32,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 10:36:32,326 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:32,326 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2019-08-05 10:36:32,326 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:32,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:32,327 INFO L82 PathProgramCache]: Analyzing trace with hash 1612820806, now seen corresponding path program 7 times [2019-08-05 10:36:32,328 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:32,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:32,346 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:36:32,347 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:32,512 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:36:32,513 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:32,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:36:32,514 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:36:32,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:36:32,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:36:32,515 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2019-08-05 10:36:32,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:32,545 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-08-05 10:36:32,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:36:32,546 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2019-08-05 10:36:32,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:32,546 INFO L225 Difference]: With dead ends: 12 [2019-08-05 10:36:32,547 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 10:36:32,547 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:36:32,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 10:36:32,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-08-05 10:36:32,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 10:36:32,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-08-05 10:36:32,550 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-08-05 10:36:32,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:32,550 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-08-05 10:36:32,550 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:36:32,550 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-08-05 10:36:32,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 10:36:32,551 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:32,551 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2019-08-05 10:36:32,551 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:32,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:32,552 INFO L82 PathProgramCache]: Analyzing trace with hash -1542166432, now seen corresponding path program 8 times [2019-08-05 10:36:32,553 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:32,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:32,570 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 10:36:32,572 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:33,000 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:36:33,000 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:33,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:36:33,001 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:36:33,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:36:33,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:36:33,002 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2019-08-05 10:36:33,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:33,030 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-08-05 10:36:33,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:36:33,030 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2019-08-05 10:36:33,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:33,031 INFO L225 Difference]: With dead ends: 13 [2019-08-05 10:36:33,031 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 10:36:33,032 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:36:33,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 10:36:33,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-08-05 10:36:33,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 10:36:33,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-08-05 10:36:33,034 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2019-08-05 10:36:33,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:33,035 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-08-05 10:36:33,035 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:36:33,035 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-08-05 10:36:33,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:36:33,036 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:33,036 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2019-08-05 10:36:33,036 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:33,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:33,036 INFO L82 PathProgramCache]: Analyzing trace with hash -562523002, now seen corresponding path program 9 times [2019-08-05 10:36:33,037 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:33,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:33,054 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 10:36:33,055 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:33,222 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:36:33,223 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:33,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:36:33,224 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:36:33,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:36:33,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:36:33,225 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2019-08-05 10:36:33,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:33,262 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-08-05 10:36:33,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:36:33,263 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2019-08-05 10:36:33,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:33,264 INFO L225 Difference]: With dead ends: 14 [2019-08-05 10:36:33,264 INFO L226 Difference]: Without dead ends: 14 [2019-08-05 10:36:33,265 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:36:33,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-05 10:36:33,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-08-05 10:36:33,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-05 10:36:33,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-08-05 10:36:33,268 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2019-08-05 10:36:33,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:33,268 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-08-05 10:36:33,268 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:36:33,268 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-08-05 10:36:33,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 10:36:33,269 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:33,269 INFO L399 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2019-08-05 10:36:33,269 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:33,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:33,270 INFO L82 PathProgramCache]: Analyzing trace with hash -258347744, now seen corresponding path program 10 times [2019-08-05 10:36:33,270 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:33,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:33,291 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 10:36:33,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:33,579 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:36:33,579 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:33,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:36:33,580 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:36:33,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:36:33,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:36:33,588 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 13 states. [2019-08-05 10:36:33,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:33,634 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-08-05 10:36:33,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:36:33,634 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2019-08-05 10:36:33,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:33,635 INFO L225 Difference]: With dead ends: 15 [2019-08-05 10:36:33,635 INFO L226 Difference]: Without dead ends: 15 [2019-08-05 10:36:33,635 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:36:33,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-05 10:36:33,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-08-05 10:36:33,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 10:36:33,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-08-05 10:36:33,638 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2019-08-05 10:36:33,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:33,638 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-08-05 10:36:33,638 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:36:33,638 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-08-05 10:36:33,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 10:36:33,639 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:33,639 INFO L399 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2019-08-05 10:36:33,639 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:33,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:33,640 INFO L82 PathProgramCache]: Analyzing trace with hash 581150662, now seen corresponding path program 11 times [2019-08-05 10:36:33,640 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:33,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:33,658 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 10:36:33,659 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:33,980 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:36:33,981 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:33,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:36:33,981 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:36:33,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:36:33,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:36:33,982 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 14 states. [2019-08-05 10:36:34,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:34,026 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-08-05 10:36:34,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:36:34,026 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2019-08-05 10:36:34,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:34,027 INFO L225 Difference]: With dead ends: 16 [2019-08-05 10:36:34,027 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 10:36:34,027 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:36:34,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 10:36:34,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-08-05 10:36:34,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 10:36:34,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-08-05 10:36:34,030 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2019-08-05 10:36:34,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:34,031 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-08-05 10:36:34,031 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:36:34,031 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-08-05 10:36:34,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:36:34,032 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:34,032 INFO L399 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2019-08-05 10:36:34,032 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:34,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:34,033 INFO L82 PathProgramCache]: Analyzing trace with hash 835797472, now seen corresponding path program 12 times [2019-08-05 10:36:34,034 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:34,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:34,050 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 10:36:34,052 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:34,208 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:34,209 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:34,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:36:34,209 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 10:36:34,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 10:36:34,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:36:34,210 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 15 states. [2019-08-05 10:36:34,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:34,246 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-08-05 10:36:34,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:36:34,246 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2019-08-05 10:36:34,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:34,248 INFO L225 Difference]: With dead ends: 17 [2019-08-05 10:36:34,248 INFO L226 Difference]: Without dead ends: 17 [2019-08-05 10:36:34,248 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:36:34,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-05 10:36:34,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-08-05 10:36:34,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 10:36:34,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-08-05 10:36:34,251 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2019-08-05 10:36:34,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:34,251 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-08-05 10:36:34,252 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 10:36:34,252 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-08-05 10:36:34,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:36:34,252 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:34,252 INFO L399 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2019-08-05 10:36:34,253 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:34,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:34,253 INFO L82 PathProgramCache]: Analyzing trace with hash 139913990, now seen corresponding path program 13 times [2019-08-05 10:36:34,254 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:34,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:34,270 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 10:36:34,271 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:34,478 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:36:34,478 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:34,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 10:36:34,479 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:36:34,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:36:34,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:36:34,479 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 16 states. [2019-08-05 10:36:34,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:34,510 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-08-05 10:36:34,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:36:34,510 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2019-08-05 10:36:34,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:34,511 INFO L225 Difference]: With dead ends: 18 [2019-08-05 10:36:34,511 INFO L226 Difference]: Without dead ends: 18 [2019-08-05 10:36:34,512 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:36:34,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-05 10:36:34,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-08-05 10:36:34,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-05 10:36:34,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-08-05 10:36:34,516 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2019-08-05 10:36:34,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:34,516 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-08-05 10:36:34,516 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:36:34,516 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-08-05 10:36:34,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 10:36:34,517 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:34,517 INFO L399 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2019-08-05 10:36:34,517 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:34,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:34,518 INFO L82 PathProgramCache]: Analyzing trace with hash 42362528, now seen corresponding path program 14 times [2019-08-05 10:36:34,518 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:34,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:34,534 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 10:36:34,536 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:34,730 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:36:34,731 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:34,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:36:34,732 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 10:36:34,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 10:36:34,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:36:34,733 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 17 states. [2019-08-05 10:36:34,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:34,865 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-08-05 10:36:34,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:36:34,865 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2019-08-05 10:36:34,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:34,866 INFO L225 Difference]: With dead ends: 19 [2019-08-05 10:36:34,868 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 10:36:34,869 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:36:34,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 10:36:34,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-08-05 10:36:34,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 10:36:34,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-08-05 10:36:34,875 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2019-08-05 10:36:34,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:34,875 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-08-05 10:36:34,875 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 10:36:34,875 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-08-05 10:36:34,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:36:34,876 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:34,877 INFO L399 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2019-08-05 10:36:34,877 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:34,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:34,878 INFO L82 PathProgramCache]: Analyzing trace with hash 1313234502, now seen corresponding path program 15 times [2019-08-05 10:36:34,879 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:34,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:34,916 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 10:36:34,918 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:35,276 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:36:35,276 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:35,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:36:35,277 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:36:35,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:36:35,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:36:35,278 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 18 states. [2019-08-05 10:36:35,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:35,364 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-08-05 10:36:35,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 10:36:35,366 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2019-08-05 10:36:35,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:35,367 INFO L225 Difference]: With dead ends: 20 [2019-08-05 10:36:35,367 INFO L226 Difference]: Without dead ends: 20 [2019-08-05 10:36:35,368 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:36:35,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-05 10:36:35,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-08-05 10:36:35,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 10:36:35,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-08-05 10:36:35,371 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2019-08-05 10:36:35,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:35,371 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-08-05 10:36:35,371 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:36:35,371 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-08-05 10:36:35,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:36:35,372 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:35,372 INFO L399 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2019-08-05 10:36:35,372 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:35,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:35,373 INFO L82 PathProgramCache]: Analyzing trace with hash 2055560032, now seen corresponding path program 16 times [2019-08-05 10:36:35,373 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:35,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:35,387 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 10:36:35,388 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:35,677 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:36:35,677 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:35,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:36:35,678 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:36:35,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:36:35,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:36:35,679 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 19 states. [2019-08-05 10:36:35,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:35,706 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-08-05 10:36:35,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:36:35,707 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-08-05 10:36:35,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:35,707 INFO L225 Difference]: With dead ends: 21 [2019-08-05 10:36:35,708 INFO L226 Difference]: Without dead ends: 21 [2019-08-05 10:36:35,708 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:36:35,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-05 10:36:35,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-08-05 10:36:35,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-05 10:36:35,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-08-05 10:36:35,712 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2019-08-05 10:36:35,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:35,712 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-08-05 10:36:35,712 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:36:35,712 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-08-05 10:36:35,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:36:35,713 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:35,713 INFO L399 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2019-08-05 10:36:35,713 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:35,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:35,713 INFO L82 PathProgramCache]: Analyzing trace with hash -702152314, now seen corresponding path program 17 times [2019-08-05 10:36:35,714 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:35,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:35,728 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 10:36:35,729 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:36,274 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:36:36,275 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:36,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:36:36,276 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:36:36,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:36:36,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:36:36,277 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 20 states. [2019-08-05 10:36:36,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:36,523 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-08-05 10:36:36,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 10:36:36,524 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2019-08-05 10:36:36,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:36,524 INFO L225 Difference]: With dead ends: 22 [2019-08-05 10:36:36,524 INFO L226 Difference]: Without dead ends: 22 [2019-08-05 10:36:36,525 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:36:36,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-05 10:36:36,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-08-05 10:36:36,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-05 10:36:36,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-08-05 10:36:36,528 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2019-08-05 10:36:36,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:36,528 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-08-05 10:36:36,528 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:36:36,528 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-08-05 10:36:36,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:36:36,529 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:36,529 INFO L399 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2019-08-05 10:36:36,529 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:36,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:36,530 INFO L82 PathProgramCache]: Analyzing trace with hash -291889120, now seen corresponding path program 18 times [2019-08-05 10:36:36,531 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:36,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:36,545 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 10:36:36,546 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:36,911 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:36:36,911 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:36,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:36:36,912 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:36:36,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:36:36,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:36:36,913 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 21 states. [2019-08-05 10:36:37,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:37,171 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-08-05 10:36:37,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:36:37,173 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2019-08-05 10:36:37,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:37,174 INFO L225 Difference]: With dead ends: 23 [2019-08-05 10:36:37,174 INFO L226 Difference]: Without dead ends: 23 [2019-08-05 10:36:37,175 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:36:37,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-08-05 10:36:37,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-08-05 10:36:37,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-05 10:36:37,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-08-05 10:36:37,177 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2019-08-05 10:36:37,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:37,178 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-08-05 10:36:37,178 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:36:37,178 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-08-05 10:36:37,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:36:37,179 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:37,179 INFO L399 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2019-08-05 10:36:37,179 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:37,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:37,180 INFO L82 PathProgramCache]: Analyzing trace with hash -458631994, now seen corresponding path program 19 times [2019-08-05 10:36:37,180 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:37,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:37,194 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 10:36:37,196 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:37,443 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:36:37,443 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:37,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:36:37,444 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:36:37,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:36:37,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:36:37,445 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 22 states. [2019-08-05 10:36:37,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:37,476 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-08-05 10:36:37,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:36:37,477 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2019-08-05 10:36:37,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:37,477 INFO L225 Difference]: With dead ends: 24 [2019-08-05 10:36:37,478 INFO L226 Difference]: Without dead ends: 24 [2019-08-05 10:36:37,479 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:36:37,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-08-05 10:36:37,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-08-05 10:36:37,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-05 10:36:37,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-08-05 10:36:37,482 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2019-08-05 10:36:37,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:37,482 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-08-05 10:36:37,482 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:36:37,483 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-08-05 10:36:37,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:36:37,483 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:37,483 INFO L399 BasicCegarLoop]: trace histogram [20, 1, 1, 1] [2019-08-05 10:36:37,484 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:37,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:37,484 INFO L82 PathProgramCache]: Analyzing trace with hash -1332693792, now seen corresponding path program 20 times [2019-08-05 10:36:37,485 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:37,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:37,498 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 10:36:37,499 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:37,759 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:36:37,760 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:37,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:36:37,760 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:36:37,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:36:37,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:36:37,761 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 23 states. [2019-08-05 10:36:37,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:37,804 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-08-05 10:36:37,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 10:36:37,805 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2019-08-05 10:36:37,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:37,806 INFO L225 Difference]: With dead ends: 25 [2019-08-05 10:36:37,806 INFO L226 Difference]: Without dead ends: 25 [2019-08-05 10:36:37,807 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:36:37,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-05 10:36:37,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-08-05 10:36:37,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-05 10:36:37,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-08-05 10:36:37,809 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2019-08-05 10:36:37,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:37,810 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-08-05 10:36:37,810 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:36:37,810 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-08-05 10:36:37,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:36:37,811 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:37,811 INFO L399 BasicCegarLoop]: trace histogram [21, 1, 1, 1] [2019-08-05 10:36:37,811 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:37,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:37,811 INFO L82 PathProgramCache]: Analyzing trace with hash 1636161542, now seen corresponding path program 21 times [2019-08-05 10:36:37,812 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:37,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:37,825 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 10:36:37,826 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:38,232 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:36:38,232 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:38,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 10:36:38,232 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:36:38,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:36:38,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:36:38,233 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 24 states. [2019-08-05 10:36:38,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:38,298 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-08-05 10:36:38,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 10:36:38,299 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2019-08-05 10:36:38,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:38,300 INFO L225 Difference]: With dead ends: 26 [2019-08-05 10:36:38,300 INFO L226 Difference]: Without dead ends: 26 [2019-08-05 10:36:38,300 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:36:38,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-08-05 10:36:38,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-08-05 10:36:38,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-08-05 10:36:38,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-08-05 10:36:38,304 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2019-08-05 10:36:38,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:38,304 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-08-05 10:36:38,304 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:36:38,304 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-08-05 10:36:38,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:36:38,305 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:38,305 INFO L399 BasicCegarLoop]: trace histogram [22, 1, 1, 1] [2019-08-05 10:36:38,305 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:38,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:38,306 INFO L82 PathProgramCache]: Analyzing trace with hash -818603616, now seen corresponding path program 22 times [2019-08-05 10:36:38,306 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:38,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:38,319 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 24 conjunts are in the unsatisfiable core [2019-08-05 10:36:38,320 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:38,911 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:36:38,911 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:38,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 10:36:38,911 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 10:36:38,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 10:36:38,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:36:38,912 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 25 states. [2019-08-05 10:36:38,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:38,946 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-08-05 10:36:38,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:36:38,947 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2019-08-05 10:36:38,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:38,947 INFO L225 Difference]: With dead ends: 27 [2019-08-05 10:36:38,947 INFO L226 Difference]: Without dead ends: 27 [2019-08-05 10:36:38,948 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:36:38,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-08-05 10:36:38,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-08-05 10:36:38,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-05 10:36:38,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-08-05 10:36:38,951 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2019-08-05 10:36:38,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:38,952 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-08-05 10:36:38,952 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 10:36:38,952 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-08-05 10:36:38,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 10:36:38,952 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:38,952 INFO L399 BasicCegarLoop]: trace histogram [23, 1, 1, 1] [2019-08-05 10:36:38,953 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:38,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:38,953 INFO L82 PathProgramCache]: Analyzing trace with hash 393087814, now seen corresponding path program 23 times [2019-08-05 10:36:38,954 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:38,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:38,966 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 10:36:38,967 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:39,359 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:36:39,360 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:39,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 10:36:39,360 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 10:36:39,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 10:36:39,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:36:39,361 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 26 states. [2019-08-05 10:36:39,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:39,425 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-08-05 10:36:39,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:36:39,426 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2019-08-05 10:36:39,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:39,426 INFO L225 Difference]: With dead ends: 28 [2019-08-05 10:36:39,427 INFO L226 Difference]: Without dead ends: 28 [2019-08-05 10:36:39,428 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:36:39,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-08-05 10:36:39,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-08-05 10:36:39,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-05 10:36:39,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-08-05 10:36:39,431 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2019-08-05 10:36:39,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:39,432 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-08-05 10:36:39,432 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 10:36:39,432 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-08-05 10:36:39,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:36:39,433 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:39,433 INFO L399 BasicCegarLoop]: trace histogram [24, 1, 1, 1] [2019-08-05 10:36:39,433 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:39,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:39,434 INFO L82 PathProgramCache]: Analyzing trace with hash -699183520, now seen corresponding path program 24 times [2019-08-05 10:36:39,435 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:39,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:39,450 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 26 conjunts are in the unsatisfiable core [2019-08-05 10:36:39,452 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:40,138 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:36:40,139 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:40,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 10:36:40,139 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 10:36:40,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 10:36:40,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:36:40,141 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 27 states. [2019-08-05 10:36:40,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:40,191 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-08-05 10:36:40,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 10:36:40,191 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2019-08-05 10:36:40,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:40,192 INFO L225 Difference]: With dead ends: 29 [2019-08-05 10:36:40,192 INFO L226 Difference]: Without dead ends: 29 [2019-08-05 10:36:40,193 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:36:40,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-08-05 10:36:40,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-08-05 10:36:40,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-08-05 10:36:40,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-08-05 10:36:40,196 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2019-08-05 10:36:40,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:40,196 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-08-05 10:36:40,196 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 10:36:40,196 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-08-05 10:36:40,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 10:36:40,197 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:40,197 INFO L399 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2019-08-05 10:36:40,197 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:40,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:40,198 INFO L82 PathProgramCache]: Analyzing trace with hash -199856506, now seen corresponding path program 25 times [2019-08-05 10:36:40,198 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:40,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:40,211 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 10:36:40,213 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:41,035 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:36:41,036 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:41,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 10:36:41,036 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 10:36:41,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 10:36:41,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:36:41,037 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 28 states. [2019-08-05 10:36:41,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:41,087 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-08-05 10:36:41,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 10:36:41,088 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 28 [2019-08-05 10:36:41,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:41,089 INFO L225 Difference]: With dead ends: 30 [2019-08-05 10:36:41,089 INFO L226 Difference]: Without dead ends: 30 [2019-08-05 10:36:41,090 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:36:41,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-08-05 10:36:41,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-08-05 10:36:41,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-05 10:36:41,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-08-05 10:36:41,091 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2019-08-05 10:36:41,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:41,092 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-08-05 10:36:41,092 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 10:36:41,092 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-08-05 10:36:41,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 10:36:41,092 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:41,092 INFO L399 BasicCegarLoop]: trace histogram [26, 1, 1, 1] [2019-08-05 10:36:41,093 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:41,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:41,093 INFO L82 PathProgramCache]: Analyzing trace with hash -1900588256, now seen corresponding path program 26 times [2019-08-05 10:36:41,094 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:41,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:41,106 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 28 conjunts are in the unsatisfiable core [2019-08-05 10:36:41,107 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:41,991 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:36:41,991 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:41,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 10:36:41,992 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 10:36:41,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 10:36:41,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:36:41,993 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 29 states. [2019-08-05 10:36:42,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:42,128 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-08-05 10:36:42,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 10:36:42,128 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 29 [2019-08-05 10:36:42,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:42,128 INFO L225 Difference]: With dead ends: 31 [2019-08-05 10:36:42,128 INFO L226 Difference]: Without dead ends: 31 [2019-08-05 10:36:42,129 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:36:42,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-08-05 10:36:42,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-08-05 10:36:42,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-08-05 10:36:42,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-08-05 10:36:42,132 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2019-08-05 10:36:42,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:42,132 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-08-05 10:36:42,132 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 10:36:42,132 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-08-05 10:36:42,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 10:36:42,133 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:42,133 INFO L399 BasicCegarLoop]: trace histogram [27, 1, 1, 1] [2019-08-05 10:36:42,133 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:42,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:42,133 INFO L82 PathProgramCache]: Analyzing trace with hash 1211302342, now seen corresponding path program 27 times [2019-08-05 10:36:42,134 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:42,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:42,149 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 10:36:42,150 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:42,683 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:36:42,684 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:42,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 10:36:42,684 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 10:36:42,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 10:36:42,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:36:42,685 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 30 states. [2019-08-05 10:36:42,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:42,739 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-08-05 10:36:42,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 10:36:42,740 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 30 [2019-08-05 10:36:42,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:42,741 INFO L225 Difference]: With dead ends: 32 [2019-08-05 10:36:42,741 INFO L226 Difference]: Without dead ends: 32 [2019-08-05 10:36:42,742 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:36:42,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-08-05 10:36:42,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-08-05 10:36:42,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-05 10:36:42,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-08-05 10:36:42,745 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2019-08-05 10:36:42,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:42,746 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-08-05 10:36:42,746 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 10:36:42,746 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-08-05 10:36:42,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-05 10:36:42,746 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:42,747 INFO L399 BasicCegarLoop]: trace histogram [28, 1, 1, 1] [2019-08-05 10:36:42,747 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:42,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:42,747 INFO L82 PathProgramCache]: Analyzing trace with hash -1104336928, now seen corresponding path program 28 times [2019-08-05 10:36:42,748 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:42,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:42,759 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 30 conjunts are in the unsatisfiable core [2019-08-05 10:36:42,761 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:43,224 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:36:43,225 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:43,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-05 10:36:43,225 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-05 10:36:43,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-05 10:36:43,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:36:43,226 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 31 states. [2019-08-05 10:36:43,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:43,287 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-08-05 10:36:43,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 10:36:43,287 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 31 [2019-08-05 10:36:43,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:43,288 INFO L225 Difference]: With dead ends: 33 [2019-08-05 10:36:43,288 INFO L226 Difference]: Without dead ends: 33 [2019-08-05 10:36:43,289 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:36:43,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-08-05 10:36:43,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-08-05 10:36:43,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-05 10:36:43,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-08-05 10:36:43,293 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2019-08-05 10:36:43,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:43,293 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-08-05 10:36:43,293 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-05 10:36:43,293 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-08-05 10:36:43,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 10:36:43,294 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:43,294 INFO L399 BasicCegarLoop]: trace histogram [29, 1, 1, 1] [2019-08-05 10:36:43,294 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:43,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:43,295 INFO L82 PathProgramCache]: Analyzing trace with hash 125289734, now seen corresponding path program 29 times [2019-08-05 10:36:43,296 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:43,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:43,309 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 10:36:43,311 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:44,627 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:36:44,628 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:44,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-05 10:36:44,628 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 10:36:44,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 10:36:44,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:36:44,629 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 32 states. [2019-08-05 10:36:44,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:44,776 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-08-05 10:36:44,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-05 10:36:44,776 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 32 [2019-08-05 10:36:44,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:44,777 INFO L225 Difference]: With dead ends: 34 [2019-08-05 10:36:44,777 INFO L226 Difference]: Without dead ends: 34 [2019-08-05 10:36:44,778 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:36:44,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-08-05 10:36:44,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-08-05 10:36:44,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-05 10:36:44,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-08-05 10:36:44,781 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2019-08-05 10:36:44,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:44,781 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-08-05 10:36:44,781 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 10:36:44,781 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-08-05 10:36:44,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-05 10:36:44,782 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:44,782 INFO L399 BasicCegarLoop]: trace histogram [30, 1, 1, 1] [2019-08-05 10:36:44,782 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:44,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:44,783 INFO L82 PathProgramCache]: Analyzing trace with hash -410989408, now seen corresponding path program 30 times [2019-08-05 10:36:44,783 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:44,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:44,795 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 32 conjunts are in the unsatisfiable core [2019-08-05 10:36:44,797 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:45,256 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:36:45,256 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:45,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-05 10:36:45,257 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-05 10:36:45,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-05 10:36:45,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:36:45,258 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 33 states. [2019-08-05 10:36:45,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:45,367 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-08-05 10:36:45,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-05 10:36:45,368 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 33 [2019-08-05 10:36:45,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:45,368 INFO L225 Difference]: With dead ends: 35 [2019-08-05 10:36:45,369 INFO L226 Difference]: Without dead ends: 35 [2019-08-05 10:36:45,369 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:36:45,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-08-05 10:36:45,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-08-05 10:36:45,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-05 10:36:45,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-08-05 10:36:45,372 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2019-08-05 10:36:45,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:45,373 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-08-05 10:36:45,373 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-05 10:36:45,373 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-08-05 10:36:45,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-05 10:36:45,373 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:45,373 INFO L399 BasicCegarLoop]: trace histogram [31, 1, 1, 1] [2019-08-05 10:36:45,373 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:45,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:45,374 INFO L82 PathProgramCache]: Analyzing trace with hash 144226374, now seen corresponding path program 31 times [2019-08-05 10:36:45,374 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:45,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:45,386 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 33 conjunts are in the unsatisfiable core [2019-08-05 10:36:45,387 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:46,304 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:36:46,305 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:46,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 10:36:46,305 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 10:36:46,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 10:36:46,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:36:46,306 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 34 states. [2019-08-05 10:36:46,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:46,353 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-08-05 10:36:46,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-05 10:36:46,353 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 34 [2019-08-05 10:36:46,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:46,354 INFO L225 Difference]: With dead ends: 36 [2019-08-05 10:36:46,354 INFO L226 Difference]: Without dead ends: 36 [2019-08-05 10:36:46,355 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:36:46,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-08-05 10:36:46,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-08-05 10:36:46,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-05 10:36:46,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-08-05 10:36:46,358 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2019-08-05 10:36:46,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:46,358 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-08-05 10:36:46,358 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 10:36:46,358 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-08-05 10:36:46,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-05 10:36:46,359 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:46,359 INFO L399 BasicCegarLoop]: trace histogram [32, 1, 1, 1] [2019-08-05 10:36:46,359 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:46,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:46,359 INFO L82 PathProgramCache]: Analyzing trace with hash 176046432, now seen corresponding path program 32 times [2019-08-05 10:36:46,360 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:46,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:46,372 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 34 conjunts are in the unsatisfiable core [2019-08-05 10:36:46,374 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:46,909 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:36:46,909 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:46,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-05 10:36:46,910 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 10:36:46,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 10:36:46,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:36:46,911 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 35 states. [2019-08-05 10:36:46,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:46,953 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-08-05 10:36:46,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 10:36:46,954 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 35 [2019-08-05 10:36:46,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:46,954 INFO L225 Difference]: With dead ends: 37 [2019-08-05 10:36:46,954 INFO L226 Difference]: Without dead ends: 37 [2019-08-05 10:36:46,956 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:36:46,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-08-05 10:36:46,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-08-05 10:36:46,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-05 10:36:46,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-08-05 10:36:46,958 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2019-08-05 10:36:46,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:46,958 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-08-05 10:36:46,959 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 10:36:46,959 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-08-05 10:36:46,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-05 10:36:46,959 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:46,959 INFO L399 BasicCegarLoop]: trace histogram [33, 1, 1, 1] [2019-08-05 10:36:46,960 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:46,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:46,960 INFO L82 PathProgramCache]: Analyzing trace with hash 1162468230, now seen corresponding path program 33 times [2019-08-05 10:36:46,961 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:46,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:46,973 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 35 conjunts are in the unsatisfiable core [2019-08-05 10:36:46,975 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:49,075 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:36:49,075 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:49,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-05 10:36:49,076 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-05 10:36:49,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-05 10:36:49,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:36:49,077 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 36 states. [2019-08-05 10:36:49,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:49,122 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-08-05 10:36:49,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-05 10:36:49,122 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 36 [2019-08-05 10:36:49,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:49,123 INFO L225 Difference]: With dead ends: 38 [2019-08-05 10:36:49,123 INFO L226 Difference]: Without dead ends: 38 [2019-08-05 10:36:49,124 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:36:49,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-08-05 10:36:49,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-08-05 10:36:49,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-05 10:36:49,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-08-05 10:36:49,127 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2019-08-05 10:36:49,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:49,128 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-08-05 10:36:49,128 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-05 10:36:49,128 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-08-05 10:36:49,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-08-05 10:36:49,128 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:49,128 INFO L399 BasicCegarLoop]: trace histogram [34, 1, 1, 1] [2019-08-05 10:36:49,129 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:49,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:49,129 INFO L82 PathProgramCache]: Analyzing trace with hash 1676772896, now seen corresponding path program 34 times [2019-08-05 10:36:49,129 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:49,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:49,144 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 36 conjunts are in the unsatisfiable core [2019-08-05 10:36:49,145 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:49,993 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:36:49,993 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:49,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-05 10:36:49,994 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-05 10:36:49,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-05 10:36:49,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:36:49,995 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 37 states. [2019-08-05 10:36:50,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:50,035 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-08-05 10:36:50,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-05 10:36:50,035 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 37 [2019-08-05 10:36:50,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:50,036 INFO L225 Difference]: With dead ends: 39 [2019-08-05 10:36:50,036 INFO L226 Difference]: Without dead ends: 39 [2019-08-05 10:36:50,037 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:36:50,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-08-05 10:36:50,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-08-05 10:36:50,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-05 10:36:50,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-08-05 10:36:50,040 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2019-08-05 10:36:50,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:50,040 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-08-05 10:36:50,040 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-05 10:36:50,040 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-08-05 10:36:50,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-05 10:36:50,041 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:50,041 INFO L399 BasicCegarLoop]: trace histogram [35, 1, 1, 1] [2019-08-05 10:36:50,041 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:50,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:50,042 INFO L82 PathProgramCache]: Analyzing trace with hash 440348358, now seen corresponding path program 35 times [2019-08-05 10:36:50,042 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:50,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:50,055 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-05 10:36:50,056 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:50,670 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:36:50,671 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:50,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-05 10:36:50,671 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-05 10:36:50,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-05 10:36:50,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:36:50,672 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 38 states. [2019-08-05 10:36:50,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:50,742 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-08-05 10:36:50,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-05 10:36:50,743 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 38 [2019-08-05 10:36:50,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:50,743 INFO L225 Difference]: With dead ends: 40 [2019-08-05 10:36:50,743 INFO L226 Difference]: Without dead ends: 40 [2019-08-05 10:36:50,744 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:36:50,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-08-05 10:36:50,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-08-05 10:36:50,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-05 10:36:50,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-08-05 10:36:50,746 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2019-08-05 10:36:50,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:50,747 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-08-05 10:36:50,747 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-05 10:36:50,747 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-08-05 10:36:50,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-08-05 10:36:50,748 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:50,748 INFO L399 BasicCegarLoop]: trace histogram [36, 1, 1, 1] [2019-08-05 10:36:50,748 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:50,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:50,748 INFO L82 PathProgramCache]: Analyzing trace with hash 765893344, now seen corresponding path program 36 times [2019-08-05 10:36:50,749 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:50,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:50,761 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 38 conjunts are in the unsatisfiable core [2019-08-05 10:36:50,763 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:51,401 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:36:51,402 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:51,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-05 10:36:51,402 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-05 10:36:51,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-05 10:36:51,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:36:51,403 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 39 states. [2019-08-05 10:36:51,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:51,493 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-08-05 10:36:51,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-05 10:36:51,493 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 39 [2019-08-05 10:36:51,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:51,494 INFO L225 Difference]: With dead ends: 41 [2019-08-05 10:36:51,494 INFO L226 Difference]: Without dead ends: 41 [2019-08-05 10:36:51,494 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:36:51,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-08-05 10:36:51,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-08-05 10:36:51,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-05 10:36:51,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-08-05 10:36:51,496 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2019-08-05 10:36:51,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:51,496 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-08-05 10:36:51,496 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-05 10:36:51,496 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-08-05 10:36:51,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 10:36:51,497 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:51,497 INFO L399 BasicCegarLoop]: trace histogram [37, 1, 1, 1] [2019-08-05 10:36:51,497 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:51,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:51,498 INFO L82 PathProgramCache]: Analyzing trace with hash -2027113978, now seen corresponding path program 37 times [2019-08-05 10:36:51,498 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:51,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:51,525 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 39 conjunts are in the unsatisfiable core [2019-08-05 10:36:51,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:52,180 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:36:52,180 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:52,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-05 10:36:52,181 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-05 10:36:52,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-05 10:36:52,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:36:52,182 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 40 states. [2019-08-05 10:36:52,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:52,248 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-08-05 10:36:52,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-05 10:36:52,249 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 40 [2019-08-05 10:36:52,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:52,249 INFO L225 Difference]: With dead ends: 42 [2019-08-05 10:36:52,249 INFO L226 Difference]: Without dead ends: 42 [2019-08-05 10:36:52,250 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:36:52,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-08-05 10:36:52,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-08-05 10:36:52,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-05 10:36:52,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-08-05 10:36:52,251 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2019-08-05 10:36:52,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:52,252 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-08-05 10:36:52,252 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-05 10:36:52,252 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-08-05 10:36:52,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-08-05 10:36:52,252 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:52,253 INFO L399 BasicCegarLoop]: trace histogram [38, 1, 1, 1] [2019-08-05 10:36:52,253 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:52,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:52,253 INFO L82 PathProgramCache]: Analyzing trace with hash 1583972256, now seen corresponding path program 38 times [2019-08-05 10:36:52,254 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:52,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:52,267 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 40 conjunts are in the unsatisfiable core [2019-08-05 10:36:52,268 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:53,063 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:36:53,063 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:53,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-05 10:36:53,064 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-05 10:36:53,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-05 10:36:53,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:36:53,065 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 41 states. [2019-08-05 10:36:53,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:53,159 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-08-05 10:36:53,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-05 10:36:53,159 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 41 [2019-08-05 10:36:53,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:53,160 INFO L225 Difference]: With dead ends: 43 [2019-08-05 10:36:53,160 INFO L226 Difference]: Without dead ends: 43 [2019-08-05 10:36:53,162 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:36:53,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-08-05 10:36:53,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-08-05 10:36:53,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-05 10:36:53,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-08-05 10:36:53,163 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2019-08-05 10:36:53,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:53,163 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-08-05 10:36:53,163 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-05 10:36:53,163 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-08-05 10:36:53,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-05 10:36:53,164 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:53,164 INFO L399 BasicCegarLoop]: trace histogram [39, 1, 1, 1] [2019-08-05 10:36:53,165 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:53,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:53,165 INFO L82 PathProgramCache]: Analyzing trace with hash 1858495814, now seen corresponding path program 39 times [2019-08-05 10:36:53,166 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:53,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:53,179 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 41 conjunts are in the unsatisfiable core [2019-08-05 10:36:53,180 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:54,157 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:36:54,158 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:54,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-05 10:36:54,158 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-05 10:36:54,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-05 10:36:54,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:36:54,159 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 42 states. [2019-08-05 10:36:54,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:54,212 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-08-05 10:36:54,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-05 10:36:54,213 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 42 [2019-08-05 10:36:54,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:54,214 INFO L225 Difference]: With dead ends: 44 [2019-08-05 10:36:54,214 INFO L226 Difference]: Without dead ends: 44 [2019-08-05 10:36:54,215 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:36:54,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-08-05 10:36:54,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-08-05 10:36:54,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-05 10:36:54,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-08-05 10:36:54,217 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2019-08-05 10:36:54,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:54,217 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-08-05 10:36:54,217 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-05 10:36:54,217 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-08-05 10:36:54,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-08-05 10:36:54,217 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:54,217 INFO L399 BasicCegarLoop]: trace histogram [40, 1, 1, 1] [2019-08-05 10:36:54,218 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:54,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:54,218 INFO L82 PathProgramCache]: Analyzing trace with hash 1778791520, now seen corresponding path program 40 times [2019-08-05 10:36:54,219 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:54,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:54,230 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 42 conjunts are in the unsatisfiable core [2019-08-05 10:36:54,231 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:55,008 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:36:55,009 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:55,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-05 10:36:55,009 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-05 10:36:55,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-05 10:36:55,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:36:55,010 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 43 states. [2019-08-05 10:36:55,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:55,083 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-08-05 10:36:55,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-05 10:36:55,084 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 43 [2019-08-05 10:36:55,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:55,084 INFO L225 Difference]: With dead ends: 45 [2019-08-05 10:36:55,084 INFO L226 Difference]: Without dead ends: 45 [2019-08-05 10:36:55,085 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:36:55,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-05 10:36:55,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-08-05 10:36:55,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-05 10:36:55,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-08-05 10:36:55,087 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2019-08-05 10:36:55,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:55,087 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-08-05 10:36:55,088 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-05 10:36:55,088 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-08-05 10:36:55,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-08-05 10:36:55,088 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:55,088 INFO L399 BasicCegarLoop]: trace histogram [41, 1, 1, 1] [2019-08-05 10:36:55,089 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:55,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:55,089 INFO L82 PathProgramCache]: Analyzing trace with hash -692041594, now seen corresponding path program 41 times [2019-08-05 10:36:55,090 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:55,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:55,104 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 43 conjunts are in the unsatisfiable core [2019-08-05 10:36:55,106 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:55,980 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:36:55,980 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:55,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-05 10:36:55,980 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-05 10:36:55,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-05 10:36:55,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:36:55,982 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 44 states. [2019-08-05 10:36:56,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:56,039 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-08-05 10:36:56,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-05 10:36:56,039 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 44 [2019-08-05 10:36:56,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:56,040 INFO L225 Difference]: With dead ends: 46 [2019-08-05 10:36:56,040 INFO L226 Difference]: Without dead ends: 46 [2019-08-05 10:36:56,041 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:36:56,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-08-05 10:36:56,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-08-05 10:36:56,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-05 10:36:56,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-08-05 10:36:56,043 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2019-08-05 10:36:56,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:56,043 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-08-05 10:36:56,043 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-05 10:36:56,043 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-08-05 10:36:56,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-08-05 10:36:56,044 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:56,044 INFO L399 BasicCegarLoop]: trace histogram [42, 1, 1, 1] [2019-08-05 10:36:56,044 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:56,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:56,045 INFO L82 PathProgramCache]: Analyzing trace with hash 21543200, now seen corresponding path program 42 times [2019-08-05 10:36:56,045 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:56,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:56,061 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 44 conjunts are in the unsatisfiable core [2019-08-05 10:36:56,062 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:56,872 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:36:56,872 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:56,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-05 10:36:56,872 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-05 10:36:56,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-05 10:36:56,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:36:56,873 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 45 states. [2019-08-05 10:36:56,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:56,925 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-08-05 10:36:56,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-05 10:36:56,926 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 45 [2019-08-05 10:36:56,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:56,926 INFO L225 Difference]: With dead ends: 47 [2019-08-05 10:36:56,927 INFO L226 Difference]: Without dead ends: 47 [2019-08-05 10:36:56,928 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:36:56,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-08-05 10:36:56,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-08-05 10:36:56,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-08-05 10:36:56,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-08-05 10:36:56,930 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2019-08-05 10:36:56,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:56,931 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-08-05 10:36:56,931 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-05 10:36:56,931 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-08-05 10:36:56,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-08-05 10:36:56,931 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:56,931 INFO L399 BasicCegarLoop]: trace histogram [43, 1, 1, 1] [2019-08-05 10:36:56,932 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:56,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:56,932 INFO L82 PathProgramCache]: Analyzing trace with hash 667835334, now seen corresponding path program 43 times [2019-08-05 10:36:56,933 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:56,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:56,947 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 45 conjunts are in the unsatisfiable core [2019-08-05 10:36:56,948 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:57,788 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:36:57,788 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:57,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-05 10:36:57,789 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-05 10:36:57,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-05 10:36:57,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:36:57,790 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 46 states. [2019-08-05 10:36:57,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:57,893 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-08-05 10:36:57,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-05 10:36:57,894 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 46 [2019-08-05 10:36:57,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:57,895 INFO L225 Difference]: With dead ends: 48 [2019-08-05 10:36:57,895 INFO L226 Difference]: Without dead ends: 48 [2019-08-05 10:36:57,895 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:36:57,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-08-05 10:36:57,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-08-05 10:36:57,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-05 10:36:57,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-08-05 10:36:57,897 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2019-08-05 10:36:57,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:57,898 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-08-05 10:36:57,898 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-05 10:36:57,898 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-08-05 10:36:57,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 10:36:57,898 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:57,898 INFO L399 BasicCegarLoop]: trace histogram [44, 1, 1, 1] [2019-08-05 10:36:57,899 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:57,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:57,899 INFO L82 PathProgramCache]: Analyzing trace with hash -771944992, now seen corresponding path program 44 times [2019-08-05 10:36:57,899 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:57,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:57,915 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 46 conjunts are in the unsatisfiable core [2019-08-05 10:36:57,917 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:58,819 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:36:58,819 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:58,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-05 10:36:58,819 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-05 10:36:58,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-05 10:36:58,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:36:58,820 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 47 states. [2019-08-05 10:36:58,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:58,898 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-08-05 10:36:58,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-05 10:36:58,899 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 47 [2019-08-05 10:36:58,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:58,900 INFO L225 Difference]: With dead ends: 49 [2019-08-05 10:36:58,900 INFO L226 Difference]: Without dead ends: 49 [2019-08-05 10:36:58,900 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:36:58,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-08-05 10:36:58,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-08-05 10:36:58,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-08-05 10:36:58,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-08-05 10:36:58,902 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2019-08-05 10:36:58,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:58,902 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-08-05 10:36:58,902 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-05 10:36:58,902 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-08-05 10:36:58,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-08-05 10:36:58,903 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:58,903 INFO L399 BasicCegarLoop]: trace histogram [45, 1, 1, 1] [2019-08-05 10:36:58,903 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:58,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:58,903 INFO L82 PathProgramCache]: Analyzing trace with hash 1839505158, now seen corresponding path program 45 times [2019-08-05 10:36:58,904 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:58,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:58,920 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 47 conjunts are in the unsatisfiable core [2019-08-05 10:36:58,921 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:59,892 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:36:59,892 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:59,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-05 10:36:59,893 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-05 10:36:59,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-05 10:36:59,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:36:59,893 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 48 states. [2019-08-05 10:37:00,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:00,202 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-08-05 10:37:00,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-05 10:37:00,203 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 48 [2019-08-05 10:37:00,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:00,203 INFO L225 Difference]: With dead ends: 50 [2019-08-05 10:37:00,204 INFO L226 Difference]: Without dead ends: 50 [2019-08-05 10:37:00,204 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:37:00,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-08-05 10:37:00,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-08-05 10:37:00,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-08-05 10:37:00,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-08-05 10:37:00,206 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2019-08-05 10:37:00,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:00,206 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2019-08-05 10:37:00,206 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-05 10:37:00,206 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-08-05 10:37:00,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-08-05 10:37:00,207 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:00,207 INFO L399 BasicCegarLoop]: trace histogram [46, 1, 1, 1] [2019-08-05 10:37:00,207 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:00,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:00,207 INFO L82 PathProgramCache]: Analyzing trace with hash 1190081184, now seen corresponding path program 46 times [2019-08-05 10:37:00,208 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:00,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:00,225 INFO L256 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 48 conjunts are in the unsatisfiable core [2019-08-05 10:37:00,226 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:01,295 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:37:01,296 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:01,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-08-05 10:37:01,297 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-05 10:37:01,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-05 10:37:01,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:37:01,298 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 49 states. [2019-08-05 10:37:01,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:01,365 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-08-05 10:37:01,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-08-05 10:37:01,366 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 49 [2019-08-05 10:37:01,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:01,367 INFO L225 Difference]: With dead ends: 51 [2019-08-05 10:37:01,367 INFO L226 Difference]: Without dead ends: 51 [2019-08-05 10:37:01,368 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:37:01,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-05 10:37:01,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-08-05 10:37:01,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-08-05 10:37:01,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-08-05 10:37:01,370 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2019-08-05 10:37:01,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:01,371 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-08-05 10:37:01,371 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-05 10:37:01,371 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-08-05 10:37:01,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-08-05 10:37:01,371 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:01,371 INFO L399 BasicCegarLoop]: trace histogram [47, 1, 1, 1] [2019-08-05 10:37:01,372 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:01,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:01,372 INFO L82 PathProgramCache]: Analyzing trace with hash -1762192826, now seen corresponding path program 47 times [2019-08-05 10:37:01,372 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:01,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:01,387 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 49 conjunts are in the unsatisfiable core [2019-08-05 10:37:01,388 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:02,317 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:37:02,317 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:02,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-05 10:37:02,317 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-05 10:37:02,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-05 10:37:02,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:37:02,318 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 50 states. [2019-08-05 10:37:02,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:02,378 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-08-05 10:37:02,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-05 10:37:02,379 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 50 [2019-08-05 10:37:02,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:02,380 INFO L225 Difference]: With dead ends: 52 [2019-08-05 10:37:02,380 INFO L226 Difference]: Without dead ends: 52 [2019-08-05 10:37:02,381 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:37:02,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-08-05 10:37:02,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-08-05 10:37:02,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-05 10:37:02,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-08-05 10:37:02,383 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2019-08-05 10:37:02,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:02,383 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-08-05 10:37:02,383 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-05 10:37:02,383 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-08-05 10:37:02,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-08-05 10:37:02,384 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:02,384 INFO L399 BasicCegarLoop]: trace histogram [48, 1, 1, 1] [2019-08-05 10:37:02,384 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:02,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:02,384 INFO L82 PathProgramCache]: Analyzing trace with hash 1206593376, now seen corresponding path program 48 times [2019-08-05 10:37:02,385 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:02,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:02,402 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 50 conjunts are in the unsatisfiable core [2019-08-05 10:37:02,403 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:03,450 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:37:03,450 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:03,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-08-05 10:37:03,450 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-05 10:37:03,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-05 10:37:03,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:37:03,451 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 51 states. [2019-08-05 10:37:03,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:03,519 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-08-05 10:37:03,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-05 10:37:03,519 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 51 [2019-08-05 10:37:03,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:03,520 INFO L225 Difference]: With dead ends: 53 [2019-08-05 10:37:03,520 INFO L226 Difference]: Without dead ends: 53 [2019-08-05 10:37:03,521 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:37:03,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-08-05 10:37:03,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-08-05 10:37:03,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-08-05 10:37:03,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-08-05 10:37:03,523 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2019-08-05 10:37:03,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:03,524 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-08-05 10:37:03,524 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-08-05 10:37:03,524 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-08-05 10:37:03,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-08-05 10:37:03,524 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:03,524 INFO L399 BasicCegarLoop]: trace histogram [49, 1, 1, 1] [2019-08-05 10:37:03,525 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:03,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:03,525 INFO L82 PathProgramCache]: Analyzing trace with hash -1250314874, now seen corresponding path program 49 times [2019-08-05 10:37:03,525 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:03,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:03,542 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 51 conjunts are in the unsatisfiable core [2019-08-05 10:37:03,543 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:04,849 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:37:04,849 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:04,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-05 10:37:04,850 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-05 10:37:04,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-05 10:37:04,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:37:04,850 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 52 states. [2019-08-05 10:37:04,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:04,915 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-08-05 10:37:04,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-05 10:37:04,916 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 52 [2019-08-05 10:37:04,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:04,917 INFO L225 Difference]: With dead ends: 54 [2019-08-05 10:37:04,917 INFO L226 Difference]: Without dead ends: 54 [2019-08-05 10:37:04,918 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:37:04,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-05 10:37:04,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-08-05 10:37:04,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-08-05 10:37:04,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2019-08-05 10:37:04,920 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2019-08-05 10:37:04,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:04,921 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2019-08-05 10:37:04,921 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-05 10:37:04,921 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2019-08-05 10:37:04,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-08-05 10:37:04,921 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:04,921 INFO L399 BasicCegarLoop]: trace histogram [50, 1, 1, 1] [2019-08-05 10:37:04,921 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:04,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:04,922 INFO L82 PathProgramCache]: Analyzing trace with hash -105059296, now seen corresponding path program 50 times [2019-08-05 10:37:04,922 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:04,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:04,941 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 52 conjunts are in the unsatisfiable core [2019-08-05 10:37:04,942 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:06,099 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:37:06,100 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:06,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-08-05 10:37:06,100 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-08-05 10:37:06,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-08-05 10:37:06,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:37:06,101 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 53 states. [2019-08-05 10:37:06,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:06,178 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-08-05 10:37:06,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-08-05 10:37:06,179 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 53 [2019-08-05 10:37:06,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:06,180 INFO L225 Difference]: With dead ends: 55 [2019-08-05 10:37:06,180 INFO L226 Difference]: Without dead ends: 55 [2019-08-05 10:37:06,181 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:37:06,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-08-05 10:37:06,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-08-05 10:37:06,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-08-05 10:37:06,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-08-05 10:37:06,182 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2019-08-05 10:37:06,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:06,183 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-08-05 10:37:06,183 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-08-05 10:37:06,183 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-08-05 10:37:06,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 10:37:06,183 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:06,183 INFO L399 BasicCegarLoop]: trace histogram [51, 1, 1, 1] [2019-08-05 10:37:06,184 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:06,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:06,184 INFO L82 PathProgramCache]: Analyzing trace with hash 1038125254, now seen corresponding path program 51 times [2019-08-05 10:37:06,185 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:06,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:06,200 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 53 conjunts are in the unsatisfiable core [2019-08-05 10:37:06,202 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:07,554 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:37:07,554 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:07,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-05 10:37:07,554 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-08-05 10:37:07,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-08-05 10:37:07,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:37:07,555 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 54 states. [2019-08-05 10:37:07,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:07,629 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-08-05 10:37:07,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-05 10:37:07,630 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 54 [2019-08-05 10:37:07,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:07,630 INFO L225 Difference]: With dead ends: 56 [2019-08-05 10:37:07,630 INFO L226 Difference]: Without dead ends: 56 [2019-08-05 10:37:07,631 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:37:07,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-08-05 10:37:07,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-08-05 10:37:07,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-08-05 10:37:07,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-08-05 10:37:07,634 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2019-08-05 10:37:07,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:07,634 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-08-05 10:37:07,634 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-08-05 10:37:07,634 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-08-05 10:37:07,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-08-05 10:37:07,635 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:07,635 INFO L399 BasicCegarLoop]: trace histogram [52, 1, 1, 1] [2019-08-05 10:37:07,635 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:07,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:07,636 INFO L82 PathProgramCache]: Analyzing trace with hash 2117107936, now seen corresponding path program 52 times [2019-08-05 10:37:07,636 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:07,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:07,656 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 54 conjunts are in the unsatisfiable core [2019-08-05 10:37:07,657 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:08,827 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:37:08,827 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:08,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-08-05 10:37:08,828 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-08-05 10:37:08,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-08-05 10:37:08,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:37:08,829 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 55 states. [2019-08-05 10:37:08,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:08,903 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-08-05 10:37:08,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-05 10:37:08,904 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 55 [2019-08-05 10:37:08,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:08,904 INFO L225 Difference]: With dead ends: 57 [2019-08-05 10:37:08,905 INFO L226 Difference]: Without dead ends: 57 [2019-08-05 10:37:08,905 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:37:08,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-05 10:37:08,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-08-05 10:37:08,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-08-05 10:37:08,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-08-05 10:37:08,907 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2019-08-05 10:37:08,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:08,907 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-08-05 10:37:08,907 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-08-05 10:37:08,907 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-08-05 10:37:08,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-08-05 10:37:08,908 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:08,908 INFO L399 BasicCegarLoop]: trace histogram [53, 1, 1, 1] [2019-08-05 10:37:08,908 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:08,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:08,908 INFO L82 PathProgramCache]: Analyzing trace with hash 1205832710, now seen corresponding path program 53 times [2019-08-05 10:37:08,909 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:08,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:08,922 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 55 conjunts are in the unsatisfiable core [2019-08-05 10:37:08,923 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:10,377 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:37:10,377 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:10,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-08-05 10:37:10,378 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-08-05 10:37:10,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-08-05 10:37:10,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:37:10,379 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 56 states. [2019-08-05 10:37:10,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:10,487 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-08-05 10:37:10,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-08-05 10:37:10,487 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 56 [2019-08-05 10:37:10,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:10,488 INFO L225 Difference]: With dead ends: 58 [2019-08-05 10:37:10,488 INFO L226 Difference]: Without dead ends: 58 [2019-08-05 10:37:10,489 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:37:10,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-08-05 10:37:10,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-08-05 10:37:10,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-08-05 10:37:10,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-08-05 10:37:10,491 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2019-08-05 10:37:10,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:10,491 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-08-05 10:37:10,491 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-08-05 10:37:10,492 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-08-05 10:37:10,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-08-05 10:37:10,492 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:10,492 INFO L399 BasicCegarLoop]: trace histogram [54, 1, 1, 1] [2019-08-05 10:37:10,492 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:10,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:10,493 INFO L82 PathProgramCache]: Analyzing trace with hash -1273895520, now seen corresponding path program 54 times [2019-08-05 10:37:10,493 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:10,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:10,513 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 56 conjunts are in the unsatisfiable core [2019-08-05 10:37:10,515 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:11,847 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:37:11,847 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:11,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2019-08-05 10:37:11,848 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-08-05 10:37:11,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-08-05 10:37:11,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:37:11,848 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 57 states. [2019-08-05 10:37:11,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:11,930 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-08-05 10:37:11,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-08-05 10:37:11,930 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 57 [2019-08-05 10:37:11,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:11,931 INFO L225 Difference]: With dead ends: 59 [2019-08-05 10:37:11,931 INFO L226 Difference]: Without dead ends: 59 [2019-08-05 10:37:11,932 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:37:11,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-08-05 10:37:11,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-08-05 10:37:11,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-08-05 10:37:11,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2019-08-05 10:37:11,934 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2019-08-05 10:37:11,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:11,935 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2019-08-05 10:37:11,935 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-08-05 10:37:11,935 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2019-08-05 10:37:11,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-08-05 10:37:11,935 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:11,935 INFO L399 BasicCegarLoop]: trace histogram [55, 1, 1, 1] [2019-08-05 10:37:11,936 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:11,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:11,936 INFO L82 PathProgramCache]: Analyzing trace with hash -836059322, now seen corresponding path program 55 times [2019-08-05 10:37:11,936 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:11,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:11,955 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 57 conjunts are in the unsatisfiable core [2019-08-05 10:37:11,957 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:13,234 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:37:13,235 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:13,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-08-05 10:37:13,235 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-08-05 10:37:13,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-08-05 10:37:13,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 10:37:13,236 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 58 states. [2019-08-05 10:37:13,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:13,316 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-08-05 10:37:13,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-08-05 10:37:13,316 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 58 [2019-08-05 10:37:13,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:13,317 INFO L225 Difference]: With dead ends: 60 [2019-08-05 10:37:13,317 INFO L226 Difference]: Without dead ends: 60 [2019-08-05 10:37:13,318 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 10:37:13,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-05 10:37:13,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-08-05 10:37:13,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-08-05 10:37:13,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2019-08-05 10:37:13,321 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2019-08-05 10:37:13,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:13,321 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2019-08-05 10:37:13,321 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-08-05 10:37:13,321 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2019-08-05 10:37:13,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-08-05 10:37:13,322 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:13,322 INFO L399 BasicCegarLoop]: trace histogram [56, 1, 1, 1] [2019-08-05 10:37:13,323 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:13,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:13,323 INFO L82 PathProgramCache]: Analyzing trace with hash -148039072, now seen corresponding path program 56 times [2019-08-05 10:37:13,323 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:13,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:13,343 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 58 conjunts are in the unsatisfiable core [2019-08-05 10:37:13,351 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:14,893 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:37:14,893 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:14,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2019-08-05 10:37:14,894 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-08-05 10:37:14,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-08-05 10:37:14,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:37:14,894 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 59 states. [2019-08-05 10:37:14,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:14,978 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-08-05 10:37:14,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-08-05 10:37:14,978 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 59 [2019-08-05 10:37:14,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:14,979 INFO L225 Difference]: With dead ends: 61 [2019-08-05 10:37:14,979 INFO L226 Difference]: Without dead ends: 61 [2019-08-05 10:37:14,980 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:37:14,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-08-05 10:37:14,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-08-05 10:37:14,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-08-05 10:37:14,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-08-05 10:37:14,982 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2019-08-05 10:37:14,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:14,983 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-08-05 10:37:14,983 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-08-05 10:37:14,983 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-08-05 10:37:14,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-08-05 10:37:14,983 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:14,983 INFO L399 BasicCegarLoop]: trace histogram [57, 1, 1, 1] [2019-08-05 10:37:14,983 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:14,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:14,984 INFO L82 PathProgramCache]: Analyzing trace with hash -294247802, now seen corresponding path program 57 times [2019-08-05 10:37:14,984 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:14,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:15,000 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 59 conjunts are in the unsatisfiable core [2019-08-05 10:37:15,001 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:16,410 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:37:16,411 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:16,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2019-08-05 10:37:16,411 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-08-05 10:37:16,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-08-05 10:37:16,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:37:16,412 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 60 states. [2019-08-05 10:37:16,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:16,485 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-08-05 10:37:16,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-08-05 10:37:16,485 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 60 [2019-08-05 10:37:16,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:16,486 INFO L225 Difference]: With dead ends: 62 [2019-08-05 10:37:16,486 INFO L226 Difference]: Without dead ends: 62 [2019-08-05 10:37:16,487 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:37:16,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-08-05 10:37:16,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-08-05 10:37:16,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-08-05 10:37:16,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2019-08-05 10:37:16,489 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2019-08-05 10:37:16,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:16,490 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2019-08-05 10:37:16,490 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-08-05 10:37:16,490 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-08-05 10:37:16,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 10:37:16,491 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:16,491 INFO L399 BasicCegarLoop]: trace histogram [58, 1, 1, 1] [2019-08-05 10:37:16,491 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:16,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:16,491 INFO L82 PathProgramCache]: Analyzing trace with hash -531751136, now seen corresponding path program 58 times [2019-08-05 10:37:16,492 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:16,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:16,513 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 60 conjunts are in the unsatisfiable core [2019-08-05 10:37:16,515 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:18,141 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:37:18,141 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:18,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2019-08-05 10:37:18,142 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-08-05 10:37:18,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-08-05 10:37:18,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 10:37:18,143 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 61 states. [2019-08-05 10:37:18,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:18,213 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-08-05 10:37:18,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-08-05 10:37:18,213 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 61 [2019-08-05 10:37:18,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:18,214 INFO L225 Difference]: With dead ends: 63 [2019-08-05 10:37:18,214 INFO L226 Difference]: Without dead ends: 63 [2019-08-05 10:37:18,215 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 10:37:18,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-05 10:37:18,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-08-05 10:37:18,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-08-05 10:37:18,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2019-08-05 10:37:18,217 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2019-08-05 10:37:18,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:18,217 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2019-08-05 10:37:18,218 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-08-05 10:37:18,218 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2019-08-05 10:37:18,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-08-05 10:37:18,218 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:18,218 INFO L399 BasicCegarLoop]: trace histogram [59, 1, 1, 1] [2019-08-05 10:37:18,218 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:18,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:18,218 INFO L82 PathProgramCache]: Analyzing trace with hash 695580102, now seen corresponding path program 59 times [2019-08-05 10:37:18,219 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:18,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:18,234 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 61 conjunts are in the unsatisfiable core [2019-08-05 10:37:18,236 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:20,019 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:37:20,019 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:20,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2019-08-05 10:37:20,020 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-08-05 10:37:20,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-08-05 10:37:20,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 10:37:20,020 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 62 states. [2019-08-05 10:37:20,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:20,110 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2019-08-05 10:37:20,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-08-05 10:37:20,110 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 62 [2019-08-05 10:37:20,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:20,111 INFO L225 Difference]: With dead ends: 64 [2019-08-05 10:37:20,111 INFO L226 Difference]: Without dead ends: 64 [2019-08-05 10:37:20,112 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 10:37:20,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-08-05 10:37:20,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-08-05 10:37:20,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-08-05 10:37:20,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2019-08-05 10:37:20,114 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2019-08-05 10:37:20,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:20,114 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2019-08-05 10:37:20,114 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-08-05 10:37:20,114 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2019-08-05 10:37:20,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-08-05 10:37:20,115 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:20,115 INFO L399 BasicCegarLoop]: trace histogram [60, 1, 1, 1] [2019-08-05 10:37:20,115 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:20,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:20,115 INFO L82 PathProgramCache]: Analyzing trace with hash 88142816, now seen corresponding path program 60 times [2019-08-05 10:37:20,116 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:20,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:20,138 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 62 conjunts are in the unsatisfiable core [2019-08-05 10:37:20,139 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:21,938 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:37:21,938 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:21,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2019-08-05 10:37:21,938 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-08-05 10:37:21,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-08-05 10:37:21,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 10:37:21,939 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 63 states. [2019-08-05 10:37:22,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:22,031 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-08-05 10:37:22,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-08-05 10:37:22,032 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 63 [2019-08-05 10:37:22,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:22,032 INFO L225 Difference]: With dead ends: 65 [2019-08-05 10:37:22,032 INFO L226 Difference]: Without dead ends: 65 [2019-08-05 10:37:22,033 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 10:37:22,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-08-05 10:37:22,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-08-05 10:37:22,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-08-05 10:37:22,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-08-05 10:37:22,035 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2019-08-05 10:37:22,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:22,036 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-08-05 10:37:22,036 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-08-05 10:37:22,036 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-08-05 10:37:22,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-08-05 10:37:22,036 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:22,036 INFO L399 BasicCegarLoop]: trace histogram [61, 1, 1, 1] [2019-08-05 10:37:22,036 INFO L418 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:22,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:22,037 INFO L82 PathProgramCache]: Analyzing trace with hash -1562543866, now seen corresponding path program 61 times [2019-08-05 10:37:22,037 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:22,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:22,053 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 63 conjunts are in the unsatisfiable core [2019-08-05 10:37:22,055 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:23,618 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:37:23,618 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:23,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2019-08-05 10:37:23,619 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-08-05 10:37:23,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-08-05 10:37:23,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 10:37:23,620 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 64 states. [2019-08-05 10:37:23,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:23,718 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-08-05 10:37:23,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-08-05 10:37:23,719 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 64 [2019-08-05 10:37:23,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:23,719 INFO L225 Difference]: With dead ends: 66 [2019-08-05 10:37:23,719 INFO L226 Difference]: Without dead ends: 66 [2019-08-05 10:37:23,720 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 10:37:23,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-05 10:37:23,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-08-05 10:37:23,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-08-05 10:37:23,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2019-08-05 10:37:23,722 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2019-08-05 10:37:23,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:23,722 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2019-08-05 10:37:23,723 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-08-05 10:37:23,723 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-08-05 10:37:23,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-08-05 10:37:23,723 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:23,723 INFO L399 BasicCegarLoop]: trace histogram [62, 1, 1, 1] [2019-08-05 10:37:23,724 INFO L418 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:23,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:23,724 INFO L82 PathProgramCache]: Analyzing trace with hash -1194223456, now seen corresponding path program 62 times [2019-08-05 10:37:23,724 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:23,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:23,742 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 64 conjunts are in the unsatisfiable core [2019-08-05 10:37:23,743 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:25,596 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:37:25,596 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:25,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2019-08-05 10:37:25,597 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-08-05 10:37:25,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-08-05 10:37:25,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 10:37:25,597 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 65 states. [2019-08-05 10:37:25,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:25,689 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2019-08-05 10:37:25,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-08-05 10:37:25,690 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 65 [2019-08-05 10:37:25,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:25,690 INFO L225 Difference]: With dead ends: 67 [2019-08-05 10:37:25,691 INFO L226 Difference]: Without dead ends: 67 [2019-08-05 10:37:25,691 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 10:37:25,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-08-05 10:37:25,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-08-05 10:37:25,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-08-05 10:37:25,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-08-05 10:37:25,693 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2019-08-05 10:37:25,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:25,694 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2019-08-05 10:37:25,694 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-08-05 10:37:25,694 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-08-05 10:37:25,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-08-05 10:37:25,695 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:25,695 INFO L399 BasicCegarLoop]: trace histogram [63, 1, 1, 1] [2019-08-05 10:37:25,695 INFO L418 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:25,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:25,696 INFO L82 PathProgramCache]: Analyzing trace with hash 1633774662, now seen corresponding path program 63 times [2019-08-05 10:37:25,696 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:25,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:25,715 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 65 conjunts are in the unsatisfiable core [2019-08-05 10:37:25,716 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:27,460 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:37:27,460 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:27,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2019-08-05 10:37:27,460 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-08-05 10:37:27,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-08-05 10:37:27,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 10:37:27,461 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 66 states. [2019-08-05 10:37:27,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:27,541 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-08-05 10:37:27,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-08-05 10:37:27,542 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 66 [2019-08-05 10:37:27,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:27,543 INFO L225 Difference]: With dead ends: 68 [2019-08-05 10:37:27,543 INFO L226 Difference]: Without dead ends: 68 [2019-08-05 10:37:27,543 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 10:37:27,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-08-05 10:37:27,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-08-05 10:37:27,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-08-05 10:37:27,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2019-08-05 10:37:27,546 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2019-08-05 10:37:27,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:27,546 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2019-08-05 10:37:27,546 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-08-05 10:37:27,547 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2019-08-05 10:37:27,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-08-05 10:37:27,547 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:27,547 INFO L399 BasicCegarLoop]: trace histogram [64, 1, 1, 1] [2019-08-05 10:37:27,547 INFO L418 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:27,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:27,548 INFO L82 PathProgramCache]: Analyzing trace with hash -892596896, now seen corresponding path program 64 times [2019-08-05 10:37:27,548 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:27,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:27,571 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 66 conjunts are in the unsatisfiable core [2019-08-05 10:37:27,573 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:29,284 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:37:29,284 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:29,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2019-08-05 10:37:29,284 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-08-05 10:37:29,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-08-05 10:37:29,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:37:29,285 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 67 states. [2019-08-05 10:37:29,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:29,391 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2019-08-05 10:37:29,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-08-05 10:37:29,392 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 67 [2019-08-05 10:37:29,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:29,393 INFO L225 Difference]: With dead ends: 69 [2019-08-05 10:37:29,393 INFO L226 Difference]: Without dead ends: 69 [2019-08-05 10:37:29,394 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:37:29,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-05 10:37:29,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-08-05 10:37:29,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-05 10:37:29,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2019-08-05 10:37:29,396 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2019-08-05 10:37:29,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:29,396 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2019-08-05 10:37:29,396 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-08-05 10:37:29,396 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2019-08-05 10:37:29,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 10:37:29,397 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:29,397 INFO L399 BasicCegarLoop]: trace histogram [65, 1, 1, 1] [2019-08-05 10:37:29,397 INFO L418 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:29,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:29,398 INFO L82 PathProgramCache]: Analyzing trace with hash -1900703866, now seen corresponding path program 65 times [2019-08-05 10:37:29,398 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:29,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:29,429 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 67 conjunts are in the unsatisfiable core [2019-08-05 10:37:29,431 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:31,468 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:37:31,468 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:31,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2019-08-05 10:37:31,468 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-08-05 10:37:31,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-08-05 10:37:31,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:37:31,469 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 68 states. [2019-08-05 10:37:31,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:31,558 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-08-05 10:37:31,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-08-05 10:37:31,558 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 68 [2019-08-05 10:37:31,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:31,559 INFO L225 Difference]: With dead ends: 70 [2019-08-05 10:37:31,559 INFO L226 Difference]: Without dead ends: 70 [2019-08-05 10:37:31,560 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:37:31,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-08-05 10:37:31,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-08-05 10:37:31,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-08-05 10:37:31,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2019-08-05 10:37:31,562 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2019-08-05 10:37:31,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:31,563 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2019-08-05 10:37:31,563 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-08-05 10:37:31,563 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2019-08-05 10:37:31,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-08-05 10:37:31,563 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:31,564 INFO L399 BasicCegarLoop]: trace histogram [66, 1, 1, 1] [2019-08-05 10:37:31,564 INFO L418 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:31,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:31,564 INFO L82 PathProgramCache]: Analyzing trace with hash 1207718432, now seen corresponding path program 66 times [2019-08-05 10:37:31,565 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:31,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:31,582 INFO L256 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 68 conjunts are in the unsatisfiable core [2019-08-05 10:37:31,583 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:33,821 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:37:33,821 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:33,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2019-08-05 10:37:33,821 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-08-05 10:37:33,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-08-05 10:37:33,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 10:37:33,822 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 69 states. [2019-08-05 10:37:33,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:33,937 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2019-08-05 10:37:33,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-08-05 10:37:33,938 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 69 [2019-08-05 10:37:33,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:33,938 INFO L225 Difference]: With dead ends: 71 [2019-08-05 10:37:33,939 INFO L226 Difference]: Without dead ends: 71 [2019-08-05 10:37:33,939 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 10:37:33,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-08-05 10:37:33,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-08-05 10:37:33,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-08-05 10:37:33,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2019-08-05 10:37:33,941 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2019-08-05 10:37:33,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:33,942 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2019-08-05 10:37:33,942 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-08-05 10:37:33,942 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-08-05 10:37:33,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-08-05 10:37:33,943 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:33,943 INFO L399 BasicCegarLoop]: trace histogram [67, 1, 1, 1] [2019-08-05 10:37:33,943 INFO L418 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:33,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:33,943 INFO L82 PathProgramCache]: Analyzing trace with hash -1215438138, now seen corresponding path program 67 times [2019-08-05 10:37:33,944 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:33,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:33,960 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 69 conjunts are in the unsatisfiable core [2019-08-05 10:37:33,961 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:36,047 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:37:36,048 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:36,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2019-08-05 10:37:36,048 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-08-05 10:37:36,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-08-05 10:37:36,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 10:37:36,049 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 70 states. [2019-08-05 10:37:36,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:36,147 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2019-08-05 10:37:36,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-08-05 10:37:36,148 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 70 [2019-08-05 10:37:36,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:36,148 INFO L225 Difference]: With dead ends: 72 [2019-08-05 10:37:36,149 INFO L226 Difference]: Without dead ends: 72 [2019-08-05 10:37:36,149 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 10:37:36,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-08-05 10:37:36,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-08-05 10:37:36,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-08-05 10:37:36,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2019-08-05 10:37:36,151 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2019-08-05 10:37:36,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:36,151 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2019-08-05 10:37:36,152 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-08-05 10:37:36,152 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2019-08-05 10:37:36,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-08-05 10:37:36,152 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:36,152 INFO L399 BasicCegarLoop]: trace histogram [68, 1, 1, 1] [2019-08-05 10:37:36,152 INFO L418 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:36,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:36,152 INFO L82 PathProgramCache]: Analyzing trace with hash 976119520, now seen corresponding path program 68 times [2019-08-05 10:37:36,153 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:36,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:36,177 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 70 conjunts are in the unsatisfiable core [2019-08-05 10:37:36,179 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:38,331 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:37:38,331 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:38,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2019-08-05 10:37:38,332 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-08-05 10:37:38,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-08-05 10:37:38,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 10:37:38,332 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 71 states. [2019-08-05 10:37:38,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:38,424 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2019-08-05 10:37:38,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-08-05 10:37:38,424 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 71 [2019-08-05 10:37:38,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:38,425 INFO L225 Difference]: With dead ends: 73 [2019-08-05 10:37:38,425 INFO L226 Difference]: Without dead ends: 73 [2019-08-05 10:37:38,426 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 10:37:38,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-08-05 10:37:38,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-08-05 10:37:38,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-08-05 10:37:38,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-08-05 10:37:38,428 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2019-08-05 10:37:38,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:38,428 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2019-08-05 10:37:38,428 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-08-05 10:37:38,428 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-08-05 10:37:38,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-08-05 10:37:38,429 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:38,429 INFO L399 BasicCegarLoop]: trace histogram [69, 1, 1, 1] [2019-08-05 10:37:38,429 INFO L418 AbstractCegarLoop]: === Iteration 70 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:38,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:38,429 INFO L82 PathProgramCache]: Analyzing trace with hash 194930182, now seen corresponding path program 69 times [2019-08-05 10:37:38,430 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:38,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:38,455 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 71 conjunts are in the unsatisfiable core [2019-08-05 10:37:38,456 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:41,755 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:37:41,755 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:41,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2019-08-05 10:37:41,756 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-08-05 10:37:41,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-08-05 10:37:41,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 10:37:41,757 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 72 states. [2019-08-05 10:37:41,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:41,863 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-08-05 10:37:41,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-08-05 10:37:41,863 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 72 [2019-08-05 10:37:41,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:41,864 INFO L225 Difference]: With dead ends: 74 [2019-08-05 10:37:41,864 INFO L226 Difference]: Without dead ends: 74 [2019-08-05 10:37:41,865 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 10:37:41,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-08-05 10:37:41,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-08-05 10:37:41,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-08-05 10:37:41,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2019-08-05 10:37:41,868 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2019-08-05 10:37:41,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:41,868 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2019-08-05 10:37:41,868 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-08-05 10:37:41,868 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2019-08-05 10:37:41,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-08-05 10:37:41,869 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:41,869 INFO L399 BasicCegarLoop]: trace histogram [70, 1, 1, 1] [2019-08-05 10:37:41,869 INFO L418 AbstractCegarLoop]: === Iteration 71 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:41,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:41,869 INFO L82 PathProgramCache]: Analyzing trace with hash 1747864480, now seen corresponding path program 70 times [2019-08-05 10:37:41,870 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:41,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:41,895 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 72 conjunts are in the unsatisfiable core [2019-08-05 10:37:41,897 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:43,879 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:37:43,880 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:43,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2019-08-05 10:37:43,880 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-08-05 10:37:43,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-08-05 10:37:43,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 10:37:43,881 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 73 states. [2019-08-05 10:37:44,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:44,002 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-08-05 10:37:44,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-08-05 10:37:44,002 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 73 [2019-08-05 10:37:44,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:44,003 INFO L225 Difference]: With dead ends: 75 [2019-08-05 10:37:44,003 INFO L226 Difference]: Without dead ends: 75 [2019-08-05 10:37:44,004 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 10:37:44,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-08-05 10:37:44,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-08-05 10:37:44,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-05 10:37:44,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2019-08-05 10:37:44,007 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2019-08-05 10:37:44,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:44,007 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2019-08-05 10:37:44,007 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-08-05 10:37:44,007 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2019-08-05 10:37:44,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-08-05 10:37:44,008 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:44,008 INFO L399 BasicCegarLoop]: trace histogram [71, 1, 1, 1] [2019-08-05 10:37:44,008 INFO L418 AbstractCegarLoop]: === Iteration 72 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:44,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:44,009 INFO L82 PathProgramCache]: Analyzing trace with hash -1650779834, now seen corresponding path program 71 times [2019-08-05 10:37:44,009 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:44,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:44,036 INFO L256 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 73 conjunts are in the unsatisfiable core [2019-08-05 10:37:44,037 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:46,369 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:37:46,369 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:46,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2019-08-05 10:37:46,370 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-08-05 10:37:46,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-08-05 10:37:46,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 10:37:46,371 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 74 states. [2019-08-05 10:37:46,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:46,465 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2019-08-05 10:37:46,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-08-05 10:37:46,466 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 74 [2019-08-05 10:37:46,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:46,467 INFO L225 Difference]: With dead ends: 76 [2019-08-05 10:37:46,467 INFO L226 Difference]: Without dead ends: 76 [2019-08-05 10:37:46,468 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 10:37:46,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-08-05 10:37:46,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-08-05 10:37:46,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-08-05 10:37:46,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2019-08-05 10:37:46,471 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2019-08-05 10:37:46,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:46,471 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2019-08-05 10:37:46,471 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-08-05 10:37:46,471 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2019-08-05 10:37:46,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-08-05 10:37:46,472 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:46,472 INFO L399 BasicCegarLoop]: trace histogram [72, 1, 1, 1] [2019-08-05 10:37:46,472 INFO L418 AbstractCegarLoop]: === Iteration 73 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:46,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:46,473 INFO L82 PathProgramCache]: Analyzing trace with hash 365428832, now seen corresponding path program 72 times [2019-08-05 10:37:46,473 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:46,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:46,501 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 74 conjunts are in the unsatisfiable core [2019-08-05 10:37:46,502 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:49,122 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:37:49,123 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:49,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2019-08-05 10:37:49,123 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-08-05 10:37:49,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-08-05 10:37:49,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 10:37:49,124 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 75 states. [2019-08-05 10:37:49,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:49,239 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2019-08-05 10:37:49,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-08-05 10:37:49,240 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 75 [2019-08-05 10:37:49,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:49,241 INFO L225 Difference]: With dead ends: 77 [2019-08-05 10:37:49,241 INFO L226 Difference]: Without dead ends: 77 [2019-08-05 10:37:49,241 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 10:37:49,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-08-05 10:37:49,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-08-05 10:37:49,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-05 10:37:49,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-08-05 10:37:49,244 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2019-08-05 10:37:49,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:49,244 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-08-05 10:37:49,244 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-08-05 10:37:49,244 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-08-05 10:37:49,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-08-05 10:37:49,245 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:49,245 INFO L399 BasicCegarLoop]: trace histogram [73, 1, 1, 1] [2019-08-05 10:37:49,245 INFO L418 AbstractCegarLoop]: === Iteration 74 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:49,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:49,245 INFO L82 PathProgramCache]: Analyzing trace with hash -1556611962, now seen corresponding path program 73 times [2019-08-05 10:37:49,246 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:49,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:49,273 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 75 conjunts are in the unsatisfiable core [2019-08-05 10:37:49,275 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:51,887 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:37:51,887 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:51,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2019-08-05 10:37:51,888 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-08-05 10:37:51,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-08-05 10:37:51,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 10:37:51,889 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 76 states. [2019-08-05 10:37:51,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:51,986 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2019-08-05 10:37:51,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-08-05 10:37:51,987 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 76 [2019-08-05 10:37:51,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:51,988 INFO L225 Difference]: With dead ends: 78 [2019-08-05 10:37:51,988 INFO L226 Difference]: Without dead ends: 78 [2019-08-05 10:37:51,988 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 10:37:51,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-08-05 10:37:51,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-08-05 10:37:51,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-08-05 10:37:51,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2019-08-05 10:37:51,991 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2019-08-05 10:37:51,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:51,991 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2019-08-05 10:37:51,992 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-08-05 10:37:51,992 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2019-08-05 10:37:51,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 10:37:51,993 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:51,993 INFO L399 BasicCegarLoop]: trace histogram [74, 1, 1, 1] [2019-08-05 10:37:51,993 INFO L418 AbstractCegarLoop]: === Iteration 75 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:51,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:51,993 INFO L82 PathProgramCache]: Analyzing trace with hash -1010334432, now seen corresponding path program 74 times [2019-08-05 10:37:51,994 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:52,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:52,024 INFO L256 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 76 conjunts are in the unsatisfiable core [2019-08-05 10:37:52,025 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:54,552 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:37:54,553 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:54,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2019-08-05 10:37:54,553 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-08-05 10:37:54,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-08-05 10:37:54,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 10:37:54,554 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 77 states. [2019-08-05 10:37:54,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:54,648 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2019-08-05 10:37:54,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-08-05 10:37:54,648 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 77 [2019-08-05 10:37:54,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:54,649 INFO L225 Difference]: With dead ends: 79 [2019-08-05 10:37:54,649 INFO L226 Difference]: Without dead ends: 79 [2019-08-05 10:37:54,649 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 10:37:54,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-08-05 10:37:54,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-08-05 10:37:54,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-08-05 10:37:54,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2019-08-05 10:37:54,652 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77 [2019-08-05 10:37:54,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:54,652 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2019-08-05 10:37:54,652 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-08-05 10:37:54,653 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2019-08-05 10:37:54,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-08-05 10:37:54,653 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:54,654 INFO L399 BasicCegarLoop]: trace histogram [75, 1, 1, 1] [2019-08-05 10:37:54,654 INFO L418 AbstractCegarLoop]: === Iteration 76 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:54,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:54,654 INFO L82 PathProgramCache]: Analyzing trace with hash -1255600186, now seen corresponding path program 75 times [2019-08-05 10:37:54,655 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:54,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:54,675 INFO L256 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 77 conjunts are in the unsatisfiable core [2019-08-05 10:37:54,676 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:57,275 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:37:57,275 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:57,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2019-08-05 10:37:57,276 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-08-05 10:37:57,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-08-05 10:37:57,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 10:37:57,277 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 78 states. [2019-08-05 10:37:57,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:57,385 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2019-08-05 10:37:57,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-08-05 10:37:57,386 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 78 [2019-08-05 10:37:57,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:57,386 INFO L225 Difference]: With dead ends: 80 [2019-08-05 10:37:57,386 INFO L226 Difference]: Without dead ends: 80 [2019-08-05 10:37:57,387 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 10:37:57,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-08-05 10:37:57,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-08-05 10:37:57,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-08-05 10:37:57,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2019-08-05 10:37:57,389 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 78 [2019-08-05 10:37:57,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:57,389 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2019-08-05 10:37:57,390 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-08-05 10:37:57,390 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2019-08-05 10:37:57,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-08-05 10:37:57,390 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:57,390 INFO L399 BasicCegarLoop]: trace histogram [76, 1, 1, 1] [2019-08-05 10:37:57,390 INFO L418 AbstractCegarLoop]: === Iteration 77 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:57,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:57,391 INFO L82 PathProgramCache]: Analyzing trace with hash -268903968, now seen corresponding path program 76 times [2019-08-05 10:37:57,391 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:57,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:57,413 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 78 conjunts are in the unsatisfiable core [2019-08-05 10:37:57,414 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:59,738 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:37:59,738 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:59,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2019-08-05 10:37:59,738 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-08-05 10:37:59,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-08-05 10:37:59,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 10:37:59,739 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 79 states. [2019-08-05 10:37:59,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:59,867 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2019-08-05 10:37:59,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-08-05 10:37:59,868 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 79 [2019-08-05 10:37:59,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:59,869 INFO L225 Difference]: With dead ends: 81 [2019-08-05 10:37:59,869 INFO L226 Difference]: Without dead ends: 81 [2019-08-05 10:37:59,869 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 10:37:59,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-08-05 10:37:59,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-08-05 10:37:59,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-08-05 10:37:59,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-08-05 10:37:59,871 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 79 [2019-08-05 10:37:59,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:59,872 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2019-08-05 10:37:59,872 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-08-05 10:37:59,872 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-08-05 10:37:59,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-08-05 10:37:59,873 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:59,873 INFO L399 BasicCegarLoop]: trace histogram [77, 1, 1, 1] [2019-08-05 10:37:59,873 INFO L418 AbstractCegarLoop]: === Iteration 78 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:59,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:59,873 INFO L82 PathProgramCache]: Analyzing trace with hash 253907718, now seen corresponding path program 77 times [2019-08-05 10:37:59,874 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:59,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:59,893 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 79 conjunts are in the unsatisfiable core [2019-08-05 10:37:59,894 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:02,575 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:38:02,575 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:02,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2019-08-05 10:38:02,576 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-08-05 10:38:02,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-08-05 10:38:02,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 10:38:02,577 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 80 states. [2019-08-05 10:38:02,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:02,958 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2019-08-05 10:38:02,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-08-05 10:38:02,959 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 80 [2019-08-05 10:38:02,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:02,960 INFO L225 Difference]: With dead ends: 82 [2019-08-05 10:38:02,960 INFO L226 Difference]: Without dead ends: 82 [2019-08-05 10:38:02,961 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 10:38:02,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-08-05 10:38:02,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2019-08-05 10:38:02,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-08-05 10:38:02,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2019-08-05 10:38:02,963 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 80 [2019-08-05 10:38:02,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:02,963 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2019-08-05 10:38:02,963 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-08-05 10:38:02,963 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2019-08-05 10:38:02,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-08-05 10:38:02,964 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:02,964 INFO L399 BasicCegarLoop]: trace histogram [78, 1, 1, 1] [2019-08-05 10:38:02,965 INFO L418 AbstractCegarLoop]: === Iteration 79 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:38:02,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:02,965 INFO L82 PathProgramCache]: Analyzing trace with hash -718799200, now seen corresponding path program 78 times [2019-08-05 10:38:02,965 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:02,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:02,989 INFO L256 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 80 conjunts are in the unsatisfiable core [2019-08-05 10:38:02,991 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:05,577 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:38:05,578 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:05,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2019-08-05 10:38:05,578 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-08-05 10:38:05,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-08-05 10:38:05,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 10:38:05,579 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 81 states. [2019-08-05 10:38:05,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:05,718 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2019-08-05 10:38:05,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-08-05 10:38:05,725 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 81 [2019-08-05 10:38:05,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:05,726 INFO L225 Difference]: With dead ends: 83 [2019-08-05 10:38:05,726 INFO L226 Difference]: Without dead ends: 83 [2019-08-05 10:38:05,727 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 10:38:05,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-08-05 10:38:05,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-08-05 10:38:05,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-08-05 10:38:05,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2019-08-05 10:38:05,728 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 81 [2019-08-05 10:38:05,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:05,729 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2019-08-05 10:38:05,729 INFO L476 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-08-05 10:38:05,729 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2019-08-05 10:38:05,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-08-05 10:38:05,729 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:05,729 INFO L399 BasicCegarLoop]: trace histogram [79, 1, 1, 1] [2019-08-05 10:38:05,730 INFO L418 AbstractCegarLoop]: === Iteration 80 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:38:05,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:05,730 INFO L82 PathProgramCache]: Analyzing trace with hash -807942586, now seen corresponding path program 79 times [2019-08-05 10:38:05,731 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:05,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:05,763 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 81 conjunts are in the unsatisfiable core [2019-08-05 10:38:05,765 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:08,416 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:38:08,416 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:08,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2019-08-05 10:38:08,416 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-08-05 10:38:08,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-08-05 10:38:08,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-08-05 10:38:08,417 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 82 states. [2019-08-05 10:38:08,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:08,559 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2019-08-05 10:38:08,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-08-05 10:38:08,560 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 82 [2019-08-05 10:38:08,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:08,561 INFO L225 Difference]: With dead ends: 84 [2019-08-05 10:38:08,561 INFO L226 Difference]: Without dead ends: 84 [2019-08-05 10:38:08,561 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-08-05 10:38:08,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-08-05 10:38:08,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2019-08-05 10:38:08,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-08-05 10:38:08,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2019-08-05 10:38:08,563 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 82 [2019-08-05 10:38:08,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:08,564 INFO L475 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2019-08-05 10:38:08,564 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-08-05 10:38:08,564 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2019-08-05 10:38:08,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-08-05 10:38:08,564 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:08,565 INFO L399 BasicCegarLoop]: trace histogram [80, 1, 1, 1] [2019-08-05 10:38:08,565 INFO L418 AbstractCegarLoop]: === Iteration 81 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:38:08,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:08,565 INFO L82 PathProgramCache]: Analyzing trace with hash 723579744, now seen corresponding path program 80 times [2019-08-05 10:38:08,565 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:08,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:08,588 INFO L256 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 82 conjunts are in the unsatisfiable core [2019-08-05 10:38:08,589 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:13,314 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:38:13,315 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:13,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2019-08-05 10:38:13,315 INFO L454 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-08-05 10:38:13,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-08-05 10:38:13,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 10:38:13,316 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 83 states. [2019-08-05 10:38:13,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:13,462 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2019-08-05 10:38:13,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-08-05 10:38:13,462 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 83 [2019-08-05 10:38:13,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:13,463 INFO L225 Difference]: With dead ends: 85 [2019-08-05 10:38:13,463 INFO L226 Difference]: Without dead ends: 85 [2019-08-05 10:38:13,463 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 10:38:13,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-08-05 10:38:13,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-08-05 10:38:13,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-08-05 10:38:13,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2019-08-05 10:38:13,465 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 83 [2019-08-05 10:38:13,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:13,465 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2019-08-05 10:38:13,465 INFO L476 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-08-05 10:38:13,465 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2019-08-05 10:38:13,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-08-05 10:38:13,466 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:13,466 INFO L399 BasicCegarLoop]: trace histogram [81, 1, 1, 1] [2019-08-05 10:38:13,466 INFO L418 AbstractCegarLoop]: === Iteration 82 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:38:13,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:13,466 INFO L82 PathProgramCache]: Analyzing trace with hash 956131718, now seen corresponding path program 81 times [2019-08-05 10:38:13,467 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:13,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:13,489 INFO L256 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 83 conjunts are in the unsatisfiable core [2019-08-05 10:38:13,490 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:16,412 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:38:16,413 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:16,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2019-08-05 10:38:16,413 INFO L454 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-08-05 10:38:16,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-08-05 10:38:16,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-08-05 10:38:16,414 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 84 states. [2019-08-05 10:38:16,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:16,693 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2019-08-05 10:38:16,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-08-05 10:38:16,693 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 84 [2019-08-05 10:38:16,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:16,694 INFO L225 Difference]: With dead ends: 86 [2019-08-05 10:38:16,694 INFO L226 Difference]: Without dead ends: 86 [2019-08-05 10:38:16,695 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-08-05 10:38:16,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-08-05 10:38:16,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2019-08-05 10:38:16,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-08-05 10:38:16,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2019-08-05 10:38:16,697 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 84 [2019-08-05 10:38:16,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:16,697 INFO L475 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2019-08-05 10:38:16,698 INFO L476 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-08-05 10:38:16,698 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2019-08-05 10:38:16,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 10:38:16,698 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:16,698 INFO L399 BasicCegarLoop]: trace histogram [82, 1, 1, 1] [2019-08-05 10:38:16,699 INFO L418 AbstractCegarLoop]: === Iteration 83 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:38:16,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:16,699 INFO L82 PathProgramCache]: Analyzing trace with hash -424691680, now seen corresponding path program 82 times [2019-08-05 10:38:16,699 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:16,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:16,723 INFO L256 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 84 conjunts are in the unsatisfiable core [2019-08-05 10:38:16,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:19,867 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:38:19,868 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:19,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2019-08-05 10:38:19,868 INFO L454 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-08-05 10:38:19,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-08-05 10:38:19,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2019-08-05 10:38:19,869 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 85 states. [2019-08-05 10:38:19,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:19,984 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2019-08-05 10:38:19,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-08-05 10:38:19,984 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 85 [2019-08-05 10:38:19,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:19,985 INFO L225 Difference]: With dead ends: 87 [2019-08-05 10:38:19,985 INFO L226 Difference]: Without dead ends: 87 [2019-08-05 10:38:19,986 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2019-08-05 10:38:19,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-08-05 10:38:19,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-08-05 10:38:19,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-08-05 10:38:19,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2019-08-05 10:38:19,989 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 85 [2019-08-05 10:38:19,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:19,989 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2019-08-05 10:38:19,989 INFO L476 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-08-05 10:38:19,989 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2019-08-05 10:38:19,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-08-05 10:38:19,989 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:19,989 INFO L399 BasicCegarLoop]: trace histogram [83, 1, 1, 1] [2019-08-05 10:38:19,990 INFO L418 AbstractCegarLoop]: === Iteration 84 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:38:19,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:19,990 INFO L82 PathProgramCache]: Analyzing trace with hash -280544058, now seen corresponding path program 83 times [2019-08-05 10:38:19,990 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:20,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:20,013 INFO L256 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 85 conjunts are in the unsatisfiable core [2019-08-05 10:38:20,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:23,040 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:38:23,041 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:23,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2019-08-05 10:38:23,041 INFO L454 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-08-05 10:38:23,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-08-05 10:38:23,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-08-05 10:38:23,042 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 86 states. [2019-08-05 10:38:23,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:23,230 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2019-08-05 10:38:23,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-08-05 10:38:23,231 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 86 [2019-08-05 10:38:23,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:23,231 INFO L225 Difference]: With dead ends: 88 [2019-08-05 10:38:23,232 INFO L226 Difference]: Without dead ends: 88 [2019-08-05 10:38:23,232 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-08-05 10:38:23,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-08-05 10:38:23,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2019-08-05 10:38:23,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-08-05 10:38:23,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2019-08-05 10:38:23,234 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 86 [2019-08-05 10:38:23,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:23,235 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2019-08-05 10:38:23,235 INFO L476 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-08-05 10:38:23,235 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2019-08-05 10:38:23,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-08-05 10:38:23,235 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:23,236 INFO L399 BasicCegarLoop]: trace histogram [84, 1, 1, 1] [2019-08-05 10:38:23,236 INFO L418 AbstractCegarLoop]: === Iteration 85 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:38:23,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:23,236 INFO L82 PathProgramCache]: Analyzing trace with hash -106935072, now seen corresponding path program 84 times [2019-08-05 10:38:23,237 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:23,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:23,263 INFO L256 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 86 conjunts are in the unsatisfiable core [2019-08-05 10:38:23,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:26,463 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:38:26,464 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:26,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2019-08-05 10:38:26,464 INFO L454 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-08-05 10:38:26,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-08-05 10:38:26,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2019-08-05 10:38:26,465 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 87 states. [2019-08-05 10:38:26,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:26,586 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2019-08-05 10:38:26,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-08-05 10:38:26,586 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 87 [2019-08-05 10:38:26,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:26,587 INFO L225 Difference]: With dead ends: 89 [2019-08-05 10:38:26,587 INFO L226 Difference]: Without dead ends: 89 [2019-08-05 10:38:26,588 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2019-08-05 10:38:26,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-08-05 10:38:26,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-08-05 10:38:26,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-08-05 10:38:26,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2019-08-05 10:38:26,590 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 87 [2019-08-05 10:38:26,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:26,590 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2019-08-05 10:38:26,590 INFO L476 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-08-05 10:38:26,590 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2019-08-05 10:38:26,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-08-05 10:38:26,591 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:26,591 INFO L399 BasicCegarLoop]: trace histogram [85, 1, 1, 1] [2019-08-05 10:38:26,591 INFO L418 AbstractCegarLoop]: === Iteration 86 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:38:26,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:26,592 INFO L82 PathProgramCache]: Analyzing trace with hash 979976198, now seen corresponding path program 85 times [2019-08-05 10:38:26,592 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:26,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:26,615 INFO L256 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 87 conjunts are in the unsatisfiable core [2019-08-05 10:38:26,617 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:29,513 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:38:29,514 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:29,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2019-08-05 10:38:29,514 INFO L454 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-08-05 10:38:29,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-08-05 10:38:29,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-08-05 10:38:29,515 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 88 states. [2019-08-05 10:38:29,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:29,711 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2019-08-05 10:38:29,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-08-05 10:38:29,712 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 88 [2019-08-05 10:38:29,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:29,713 INFO L225 Difference]: With dead ends: 90 [2019-08-05 10:38:29,713 INFO L226 Difference]: Without dead ends: 90 [2019-08-05 10:38:29,714 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-08-05 10:38:29,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-08-05 10:38:29,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2019-08-05 10:38:29,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-08-05 10:38:29,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2019-08-05 10:38:29,716 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 88 [2019-08-05 10:38:29,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:29,717 INFO L475 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2019-08-05 10:38:29,717 INFO L476 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-08-05 10:38:29,717 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2019-08-05 10:38:29,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-08-05 10:38:29,717 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:29,718 INFO L399 BasicCegarLoop]: trace histogram [86, 1, 1, 1] [2019-08-05 10:38:29,718 INFO L418 AbstractCegarLoop]: === Iteration 87 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:38:29,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:29,718 INFO L82 PathProgramCache]: Analyzing trace with hash 314487200, now seen corresponding path program 86 times [2019-08-05 10:38:29,719 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:29,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:29,742 INFO L256 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 88 conjunts are in the unsatisfiable core [2019-08-05 10:38:29,743 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:32,820 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:38:32,820 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:32,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2019-08-05 10:38:32,821 INFO L454 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-08-05 10:38:32,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-08-05 10:38:32,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2019-08-05 10:38:32,822 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 89 states. [2019-08-05 10:38:32,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:32,953 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2019-08-05 10:38:32,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-08-05 10:38:32,953 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 89 [2019-08-05 10:38:32,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:32,954 INFO L225 Difference]: With dead ends: 91 [2019-08-05 10:38:32,954 INFO L226 Difference]: Without dead ends: 91 [2019-08-05 10:38:32,955 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2019-08-05 10:38:32,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-08-05 10:38:32,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-08-05 10:38:32,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-08-05 10:38:32,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2019-08-05 10:38:32,957 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 89 [2019-08-05 10:38:32,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:32,957 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2019-08-05 10:38:32,957 INFO L476 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-08-05 10:38:32,957 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2019-08-05 10:38:32,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-08-05 10:38:32,958 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:32,958 INFO L399 BasicCegarLoop]: trace histogram [87, 1, 1, 1] [2019-08-05 10:38:32,958 INFO L418 AbstractCegarLoop]: === Iteration 88 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:38:32,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:32,958 INFO L82 PathProgramCache]: Analyzing trace with hash 1159164742, now seen corresponding path program 87 times [2019-08-05 10:38:32,959 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:32,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:32,983 INFO L256 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 89 conjunts are in the unsatisfiable core [2019-08-05 10:38:32,984 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:36,054 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:38:36,054 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:36,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2019-08-05 10:38:36,054 INFO L454 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-08-05 10:38:36,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-08-05 10:38:36,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-08-05 10:38:36,055 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 90 states. [2019-08-05 10:38:36,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:36,200 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2019-08-05 10:38:36,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-08-05 10:38:36,201 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 90 [2019-08-05 10:38:36,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:36,201 INFO L225 Difference]: With dead ends: 92 [2019-08-05 10:38:36,201 INFO L226 Difference]: Without dead ends: 92 [2019-08-05 10:38:36,202 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-08-05 10:38:36,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-08-05 10:38:36,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2019-08-05 10:38:36,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-08-05 10:38:36,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2019-08-05 10:38:36,203 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 90 [2019-08-05 10:38:36,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:36,203 INFO L475 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2019-08-05 10:38:36,203 INFO L476 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-08-05 10:38:36,203 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2019-08-05 10:38:36,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-08-05 10:38:36,204 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:36,204 INFO L399 BasicCegarLoop]: trace histogram [88, 1, 1, 1] [2019-08-05 10:38:36,204 INFO L418 AbstractCegarLoop]: === Iteration 89 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:38:36,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:36,204 INFO L82 PathProgramCache]: Analyzing trace with hash 1574364768, now seen corresponding path program 88 times [2019-08-05 10:38:36,205 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:36,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:36,229 INFO L256 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 90 conjunts are in the unsatisfiable core [2019-08-05 10:38:36,230 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:39,547 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:38:39,547 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:39,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2019-08-05 10:38:39,548 INFO L454 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-08-05 10:38:39,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-08-05 10:38:39,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2019-08-05 10:38:39,549 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 91 states. [2019-08-05 10:38:39,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:39,680 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2019-08-05 10:38:39,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-08-05 10:38:39,680 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 91 [2019-08-05 10:38:39,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:39,681 INFO L225 Difference]: With dead ends: 93 [2019-08-05 10:38:39,681 INFO L226 Difference]: Without dead ends: 93 [2019-08-05 10:38:39,682 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2019-08-05 10:38:39,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-08-05 10:38:39,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2019-08-05 10:38:39,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-08-05 10:38:39,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2019-08-05 10:38:39,685 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 91 [2019-08-05 10:38:39,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:39,685 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2019-08-05 10:38:39,685 INFO L476 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-08-05 10:38:39,685 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2019-08-05 10:38:39,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-08-05 10:38:39,686 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:39,686 INFO L399 BasicCegarLoop]: trace histogram [89, 1, 1, 1] [2019-08-05 10:38:39,686 INFO L418 AbstractCegarLoop]: === Iteration 90 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:38:39,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:39,686 INFO L82 PathProgramCache]: Analyzing trace with hash 1560663686, now seen corresponding path program 89 times [2019-08-05 10:38:39,687 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:39,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:39,713 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 91 conjunts are in the unsatisfiable core [2019-08-05 10:38:39,714 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:43,094 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:38:43,094 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:43,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2019-08-05 10:38:43,095 INFO L454 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-08-05 10:38:43,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-08-05 10:38:43,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-08-05 10:38:43,096 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 92 states. [2019-08-05 10:38:43,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:43,499 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2019-08-05 10:38:43,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-08-05 10:38:43,500 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 92 [2019-08-05 10:38:43,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:43,501 INFO L225 Difference]: With dead ends: 94 [2019-08-05 10:38:43,501 INFO L226 Difference]: Without dead ends: 94 [2019-08-05 10:38:43,501 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-08-05 10:38:43,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-08-05 10:38:43,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2019-08-05 10:38:43,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-08-05 10:38:43,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2019-08-05 10:38:43,503 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 92 [2019-08-05 10:38:43,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:43,504 INFO L475 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2019-08-05 10:38:43,504 INFO L476 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-08-05 10:38:43,504 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2019-08-05 10:38:43,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 10:38:43,504 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:43,505 INFO L399 BasicCegarLoop]: trace histogram [90, 1, 1, 1] [2019-08-05 10:38:43,505 INFO L418 AbstractCegarLoop]: === Iteration 91 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:38:43,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:43,505 INFO L82 PathProgramCache]: Analyzing trace with hash 1135930144, now seen corresponding path program 90 times [2019-08-05 10:38:43,506 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:43,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:43,533 INFO L256 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 92 conjunts are in the unsatisfiable core [2019-08-05 10:38:43,534 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:47,090 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:38:47,090 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:47,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2019-08-05 10:38:47,090 INFO L454 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-08-05 10:38:47,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-08-05 10:38:47,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2019-08-05 10:38:47,091 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 93 states. [2019-08-05 10:38:47,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:47,244 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2019-08-05 10:38:47,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-08-05 10:38:47,244 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 93 [2019-08-05 10:38:47,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:47,245 INFO L225 Difference]: With dead ends: 95 [2019-08-05 10:38:47,245 INFO L226 Difference]: Without dead ends: 95 [2019-08-05 10:38:47,245 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2019-08-05 10:38:47,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-08-05 10:38:47,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2019-08-05 10:38:47,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-08-05 10:38:47,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2019-08-05 10:38:47,248 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 93 [2019-08-05 10:38:47,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:47,248 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2019-08-05 10:38:47,248 INFO L476 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-08-05 10:38:47,248 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2019-08-05 10:38:47,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-08-05 10:38:47,249 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:47,249 INFO L399 BasicCegarLoop]: trace histogram [91, 1, 1, 1] [2019-08-05 10:38:47,249 INFO L418 AbstractCegarLoop]: === Iteration 92 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:38:47,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:47,249 INFO L82 PathProgramCache]: Analyzing trace with hash 854092230, now seen corresponding path program 91 times [2019-08-05 10:38:47,250 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:47,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:47,291 INFO L256 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 93 conjunts are in the unsatisfiable core [2019-08-05 10:38:47,293 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:50,533 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:38:50,533 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:50,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2019-08-05 10:38:50,534 INFO L454 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-08-05 10:38:50,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-08-05 10:38:50,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-08-05 10:38:50,535 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 94 states. [2019-08-05 10:38:50,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:50,658 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2019-08-05 10:38:50,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-08-05 10:38:50,658 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 94 [2019-08-05 10:38:50,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:50,659 INFO L225 Difference]: With dead ends: 96 [2019-08-05 10:38:50,659 INFO L226 Difference]: Without dead ends: 96 [2019-08-05 10:38:50,660 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-08-05 10:38:50,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-08-05 10:38:50,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2019-08-05 10:38:50,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-08-05 10:38:50,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2019-08-05 10:38:50,662 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 94 [2019-08-05 10:38:50,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:50,662 INFO L475 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2019-08-05 10:38:50,663 INFO L476 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-08-05 10:38:50,663 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2019-08-05 10:38:50,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-08-05 10:38:50,663 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:50,663 INFO L399 BasicCegarLoop]: trace histogram [92, 1, 1, 1] [2019-08-05 10:38:50,664 INFO L418 AbstractCegarLoop]: === Iteration 93 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:38:50,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:50,664 INFO L82 PathProgramCache]: Analyzing trace with hash 707051488, now seen corresponding path program 92 times [2019-08-05 10:38:50,664 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:50,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:50,692 INFO L256 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 94 conjunts are in the unsatisfiable core [2019-08-05 10:38:50,693 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:54,433 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:38:54,433 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:54,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2019-08-05 10:38:54,433 INFO L454 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-08-05 10:38:54,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-08-05 10:38:54,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2019-08-05 10:38:54,434 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 95 states. [2019-08-05 10:38:54,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:54,574 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2019-08-05 10:38:54,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-08-05 10:38:54,574 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 95 [2019-08-05 10:38:54,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:54,575 INFO L225 Difference]: With dead ends: 97 [2019-08-05 10:38:54,575 INFO L226 Difference]: Without dead ends: 97 [2019-08-05 10:38:54,576 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2019-08-05 10:38:54,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-08-05 10:38:54,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2019-08-05 10:38:54,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-08-05 10:38:54,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2019-08-05 10:38:54,578 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 95 [2019-08-05 10:38:54,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:54,578 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2019-08-05 10:38:54,579 INFO L476 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-08-05 10:38:54,579 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2019-08-05 10:38:54,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-08-05 10:38:54,579 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:54,579 INFO L399 BasicCegarLoop]: trace histogram [93, 1, 1, 1] [2019-08-05 10:38:54,580 INFO L418 AbstractCegarLoop]: === Iteration 94 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:38:54,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:54,580 INFO L82 PathProgramCache]: Analyzing trace with hash 443755782, now seen corresponding path program 93 times [2019-08-05 10:38:54,580 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:54,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:54,608 INFO L256 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 95 conjunts are in the unsatisfiable core [2019-08-05 10:38:54,609 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:58,396 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:38:58,396 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:58,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2019-08-05 10:38:58,396 INFO L454 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-08-05 10:38:58,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-08-05 10:38:58,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-08-05 10:38:58,397 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 96 states. [2019-08-05 10:38:58,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:58,531 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2019-08-05 10:38:58,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-08-05 10:38:58,531 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 96 [2019-08-05 10:38:58,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:58,532 INFO L225 Difference]: With dead ends: 98 [2019-08-05 10:38:58,532 INFO L226 Difference]: Without dead ends: 98 [2019-08-05 10:38:58,533 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-08-05 10:38:58,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-08-05 10:38:58,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2019-08-05 10:38:58,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-08-05 10:38:58,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2019-08-05 10:38:58,535 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 96 [2019-08-05 10:38:58,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:58,535 INFO L475 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2019-08-05 10:38:58,535 INFO L476 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-08-05 10:38:58,535 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2019-08-05 10:38:58,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-08-05 10:38:58,535 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:58,536 INFO L399 BasicCegarLoop]: trace histogram [94, 1, 1, 1] [2019-08-05 10:38:58,536 INFO L418 AbstractCegarLoop]: === Iteration 95 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:38:58,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:58,536 INFO L82 PathProgramCache]: Analyzing trace with hash 871523488, now seen corresponding path program 94 times [2019-08-05 10:38:58,536 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:58,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:58,564 INFO L256 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 96 conjunts are in the unsatisfiable core [2019-08-05 10:38:58,565 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:02,331 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:39:02,331 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:02,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2019-08-05 10:39:02,331 INFO L454 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-08-05 10:39:02,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-08-05 10:39:02,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2019-08-05 10:39:02,332 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 97 states. [2019-08-05 10:39:02,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:02,475 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2019-08-05 10:39:02,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-08-05 10:39:02,476 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 97 [2019-08-05 10:39:02,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:02,477 INFO L225 Difference]: With dead ends: 99 [2019-08-05 10:39:02,477 INFO L226 Difference]: Without dead ends: 99 [2019-08-05 10:39:02,477 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2019-08-05 10:39:02,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-08-05 10:39:02,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2019-08-05 10:39:02,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-08-05 10:39:02,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2019-08-05 10:39:02,479 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 97 [2019-08-05 10:39:02,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:02,479 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2019-08-05 10:39:02,480 INFO L476 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-08-05 10:39:02,480 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2019-08-05 10:39:02,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-08-05 10:39:02,480 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:02,480 INFO L399 BasicCegarLoop]: trace histogram [95, 1, 1, 1] [2019-08-05 10:39:02,480 INFO L418 AbstractCegarLoop]: === Iteration 96 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:02,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:02,481 INFO L82 PathProgramCache]: Analyzing trace with hash 1247420486, now seen corresponding path program 95 times [2019-08-05 10:39:02,481 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:02,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:02,508 INFO L256 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 97 conjunts are in the unsatisfiable core [2019-08-05 10:39:02,509 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:06,004 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:39:06,004 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:06,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2019-08-05 10:39:06,005 INFO L454 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-08-05 10:39:06,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-08-05 10:39:06,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-08-05 10:39:06,006 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 98 states. [2019-08-05 10:39:06,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:06,149 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2019-08-05 10:39:06,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-08-05 10:39:06,149 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 98 [2019-08-05 10:39:06,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:06,150 INFO L225 Difference]: With dead ends: 100 [2019-08-05 10:39:06,150 INFO L226 Difference]: Without dead ends: 100 [2019-08-05 10:39:06,151 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-08-05 10:39:06,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-08-05 10:39:06,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-08-05 10:39:06,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-08-05 10:39:06,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2019-08-05 10:39:06,153 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 98 [2019-08-05 10:39:06,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:06,153 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2019-08-05 10:39:06,153 INFO L476 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-08-05 10:39:06,153 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2019-08-05 10:39:06,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-08-05 10:39:06,154 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:06,154 INFO L399 BasicCegarLoop]: trace histogram [96, 1, 1, 1] [2019-08-05 10:39:06,154 INFO L418 AbstractCegarLoop]: === Iteration 97 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:06,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:06,155 INFO L82 PathProgramCache]: Analyzing trace with hash 15325536, now seen corresponding path program 96 times [2019-08-05 10:39:06,155 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:06,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:06,183 INFO L256 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 98 conjunts are in the unsatisfiable core [2019-08-05 10:39:06,184 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:10,107 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:39:10,107 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:10,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2019-08-05 10:39:10,107 INFO L454 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-08-05 10:39:10,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-08-05 10:39:10,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2019-08-05 10:39:10,108 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 99 states. [2019-08-05 10:39:10,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:10,258 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2019-08-05 10:39:10,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-08-05 10:39:10,258 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 99 [2019-08-05 10:39:10,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:10,259 INFO L225 Difference]: With dead ends: 101 [2019-08-05 10:39:10,260 INFO L226 Difference]: Without dead ends: 101 [2019-08-05 10:39:10,260 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2019-08-05 10:39:10,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-08-05 10:39:10,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2019-08-05 10:39:10,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-08-05 10:39:10,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2019-08-05 10:39:10,263 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 99 [2019-08-05 10:39:10,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:10,263 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2019-08-05 10:39:10,263 INFO L476 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-08-05 10:39:10,264 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2019-08-05 10:39:10,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-08-05 10:39:10,264 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:10,265 INFO L399 BasicCegarLoop]: trace histogram [97, 1, 1, 1] [2019-08-05 10:39:10,265 INFO L418 AbstractCegarLoop]: === Iteration 98 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:10,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:10,265 INFO L82 PathProgramCache]: Analyzing trace with hash 475087750, now seen corresponding path program 97 times [2019-08-05 10:39:10,266 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:10,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:10,296 INFO L256 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 99 conjunts are in the unsatisfiable core [2019-08-05 10:39:10,297 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:14,373 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:39:14,373 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:14,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2019-08-05 10:39:14,374 INFO L454 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-08-05 10:39:14,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-08-05 10:39:14,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-08-05 10:39:14,375 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 100 states. [2019-08-05 10:39:14,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:14,682 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2019-08-05 10:39:14,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-08-05 10:39:14,682 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 100 [2019-08-05 10:39:14,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:14,683 INFO L225 Difference]: With dead ends: 102 [2019-08-05 10:39:14,683 INFO L226 Difference]: Without dead ends: 102 [2019-08-05 10:39:14,684 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-08-05 10:39:14,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-08-05 10:39:14,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2019-08-05 10:39:14,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-08-05 10:39:14,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2019-08-05 10:39:14,686 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 100 [2019-08-05 10:39:14,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:14,686 INFO L475 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2019-08-05 10:39:14,686 INFO L476 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-08-05 10:39:14,686 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2019-08-05 10:39:14,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 10:39:14,687 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:14,687 INFO L399 BasicCegarLoop]: trace histogram [98, 1, 1, 1] [2019-08-05 10:39:14,687 INFO L418 AbstractCegarLoop]: === Iteration 99 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:14,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:14,687 INFO L82 PathProgramCache]: Analyzing trace with hash 1842814496, now seen corresponding path program 98 times [2019-08-05 10:39:14,688 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:14,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:14,717 INFO L256 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 100 conjunts are in the unsatisfiable core [2019-08-05 10:39:14,718 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:18,745 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:39:18,745 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:18,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100] total 100 [2019-08-05 10:39:18,746 INFO L454 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-08-05 10:39:18,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-08-05 10:39:18,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2019-08-05 10:39:18,747 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 101 states. [2019-08-05 10:39:18,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:18,888 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2019-08-05 10:39:18,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-08-05 10:39:18,888 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 101 [2019-08-05 10:39:18,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:18,889 INFO L225 Difference]: With dead ends: 103 [2019-08-05 10:39:18,890 INFO L226 Difference]: Without dead ends: 103 [2019-08-05 10:39:18,890 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2019-08-05 10:39:18,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-08-05 10:39:18,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2019-08-05 10:39:18,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-08-05 10:39:18,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2019-08-05 10:39:18,892 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 101 [2019-08-05 10:39:18,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:18,893 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2019-08-05 10:39:18,893 INFO L476 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-08-05 10:39:18,893 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2019-08-05 10:39:18,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-08-05 10:39:18,894 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:18,894 INFO L399 BasicCegarLoop]: trace histogram [99, 1, 1, 1] [2019-08-05 10:39:18,894 INFO L418 AbstractCegarLoop]: === Iteration 100 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:18,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:18,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1292670662, now seen corresponding path program 99 times [2019-08-05 10:39:18,895 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:18,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:18,925 INFO L256 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 101 conjunts are in the unsatisfiable core [2019-08-05 10:39:18,926 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:23,044 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:39:23,044 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:23,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2019-08-05 10:39:23,045 INFO L454 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-08-05 10:39:23,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-08-05 10:39:23,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-08-05 10:39:23,046 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 102 states. [2019-08-05 10:39:23,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:23,199 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2019-08-05 10:39:23,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-08-05 10:39:23,199 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 102 [2019-08-05 10:39:23,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:23,200 INFO L225 Difference]: With dead ends: 104 [2019-08-05 10:39:23,200 INFO L226 Difference]: Without dead ends: 104 [2019-08-05 10:39:23,201 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-08-05 10:39:23,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-08-05 10:39:23,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-08-05 10:39:23,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-08-05 10:39:23,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2019-08-05 10:39:23,204 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 102 [2019-08-05 10:39:23,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:23,204 INFO L475 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2019-08-05 10:39:23,204 INFO L476 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-08-05 10:39:23,204 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2019-08-05 10:39:23,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-08-05 10:39:23,204 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:23,205 INFO L399 BasicCegarLoop]: trace histogram [100, 1, 1, 1] [2019-08-05 10:39:23,205 INFO L418 AbstractCegarLoop]: === Iteration 101 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:23,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:23,205 INFO L82 PathProgramCache]: Analyzing trace with hash 1418080992, now seen corresponding path program 100 times [2019-08-05 10:39:23,205 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:23,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:23,252 INFO L256 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 102 conjunts are in the unsatisfiable core [2019-08-05 10:39:23,254 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:27,260 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:39:27,260 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:27,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102] total 102 [2019-08-05 10:39:27,260 INFO L454 AbstractCegarLoop]: Interpolant automaton has 103 states [2019-08-05 10:39:27,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2019-08-05 10:39:27,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2019-08-05 10:39:27,261 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 103 states. [2019-08-05 10:39:27,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:27,456 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2019-08-05 10:39:27,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-08-05 10:39:27,456 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 103 [2019-08-05 10:39:27,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:27,457 INFO L225 Difference]: With dead ends: 105 [2019-08-05 10:39:27,457 INFO L226 Difference]: Without dead ends: 105 [2019-08-05 10:39:27,457 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2019-08-05 10:39:27,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-08-05 10:39:27,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2019-08-05 10:39:27,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-08-05 10:39:27,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2019-08-05 10:39:27,459 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 103 [2019-08-05 10:39:27,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:27,459 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2019-08-05 10:39:27,460 INFO L476 AbstractCegarLoop]: Interpolant automaton has 103 states. [2019-08-05 10:39:27,460 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2019-08-05 10:39:27,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-08-05 10:39:27,460 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:27,460 INFO L399 BasicCegarLoop]: trace histogram [101, 1, 1, 1] [2019-08-05 10:39:27,461 INFO L418 AbstractCegarLoop]: === Iteration 102 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:27,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:27,461 INFO L82 PathProgramCache]: Analyzing trace with hash 1010833926, now seen corresponding path program 101 times [2019-08-05 10:39:27,461 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:27,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:27,508 INFO L256 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 103 conjunts are in the unsatisfiable core [2019-08-05 10:39:27,510 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:31,616 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:39:31,616 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:31,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2019-08-05 10:39:31,617 INFO L454 AbstractCegarLoop]: Interpolant automaton has 104 states [2019-08-05 10:39:31,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2019-08-05 10:39:31,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-08-05 10:39:31,618 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 104 states. [2019-08-05 10:39:31,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:31,814 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2019-08-05 10:39:31,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-08-05 10:39:31,814 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 104 [2019-08-05 10:39:31,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:31,817 INFO L225 Difference]: With dead ends: 106 [2019-08-05 10:39:31,818 INFO L226 Difference]: Without dead ends: 106 [2019-08-05 10:39:31,818 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-08-05 10:39:31,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-08-05 10:39:31,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2019-08-05 10:39:31,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-08-05 10:39:31,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2019-08-05 10:39:31,821 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 104 [2019-08-05 10:39:31,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:31,822 INFO L475 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2019-08-05 10:39:31,822 INFO L476 AbstractCegarLoop]: Interpolant automaton has 104 states. [2019-08-05 10:39:31,822 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2019-08-05 10:39:31,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-08-05 10:39:31,822 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:31,823 INFO L399 BasicCegarLoop]: trace histogram [102, 1, 1, 1] [2019-08-05 10:39:31,823 INFO L418 AbstractCegarLoop]: === Iteration 103 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:31,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:31,823 INFO L82 PathProgramCache]: Analyzing trace with hash 1271076768, now seen corresponding path program 102 times [2019-08-05 10:39:31,824 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:31,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:31,869 INFO L256 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 104 conjunts are in the unsatisfiable core [2019-08-05 10:39:31,870 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:36,392 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:39:36,392 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:36,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104] total 104 [2019-08-05 10:39:36,392 INFO L454 AbstractCegarLoop]: Interpolant automaton has 105 states [2019-08-05 10:39:36,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2019-08-05 10:39:36,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5460, Invalid=5460, Unknown=0, NotChecked=0, Total=10920 [2019-08-05 10:39:36,393 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 105 states. [2019-08-05 10:39:36,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:36,585 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2019-08-05 10:39:36,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-08-05 10:39:36,586 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 105 [2019-08-05 10:39:36,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:36,587 INFO L225 Difference]: With dead ends: 107 [2019-08-05 10:39:36,587 INFO L226 Difference]: Without dead ends: 107 [2019-08-05 10:39:36,588 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=5460, Invalid=5460, Unknown=0, NotChecked=0, Total=10920 [2019-08-05 10:39:36,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-08-05 10:39:36,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-08-05 10:39:36,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-08-05 10:39:36,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2019-08-05 10:39:36,590 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 105 [2019-08-05 10:39:36,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:36,590 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2019-08-05 10:39:36,590 INFO L476 AbstractCegarLoop]: Interpolant automaton has 105 states. [2019-08-05 10:39:36,590 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2019-08-05 10:39:36,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-08-05 10:39:36,591 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:36,591 INFO L399 BasicCegarLoop]: trace histogram [103, 1, 1, 1] [2019-08-05 10:39:36,591 INFO L418 AbstractCegarLoop]: === Iteration 104 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:36,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:36,592 INFO L82 PathProgramCache]: Analyzing trace with hash 748670278, now seen corresponding path program 103 times [2019-08-05 10:39:36,592 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:36,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:36,644 INFO L256 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 105 conjunts are in the unsatisfiable core [2019-08-05 10:39:36,645 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:41,077 INFO L134 CoverageAnalysis]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:39:41,078 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:41,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2019-08-05 10:39:41,078 INFO L454 AbstractCegarLoop]: Interpolant automaton has 106 states [2019-08-05 10:39:41,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2019-08-05 10:39:41,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-08-05 10:39:41,079 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 106 states. [2019-08-05 10:39:41,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:41,254 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2019-08-05 10:39:41,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2019-08-05 10:39:41,254 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 106 [2019-08-05 10:39:41,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:41,255 INFO L225 Difference]: With dead ends: 108 [2019-08-05 10:39:41,255 INFO L226 Difference]: Without dead ends: 108 [2019-08-05 10:39:41,256 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-08-05 10:39:41,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-08-05 10:39:41,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2019-08-05 10:39:41,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-08-05 10:39:41,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2019-08-05 10:39:41,258 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 106 [2019-08-05 10:39:41,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:41,258 INFO L475 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2019-08-05 10:39:41,259 INFO L476 AbstractCegarLoop]: Interpolant automaton has 106 states. [2019-08-05 10:39:41,259 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2019-08-05 10:39:41,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-08-05 10:39:41,259 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:41,259 INFO L399 BasicCegarLoop]: trace histogram [104, 1, 1, 1] [2019-08-05 10:39:41,259 INFO L418 AbstractCegarLoop]: === Iteration 105 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:41,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:41,260 INFO L82 PathProgramCache]: Analyzing trace with hash 1733938272, now seen corresponding path program 104 times [2019-08-05 10:39:41,260 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:41,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:41,296 INFO L256 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 106 conjunts are in the unsatisfiable core [2019-08-05 10:39:41,297 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:46,237 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:39:46,238 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:46,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106] total 106 [2019-08-05 10:39:46,238 INFO L454 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-08-05 10:39:46,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-08-05 10:39:46,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5671, Invalid=5671, Unknown=0, NotChecked=0, Total=11342 [2019-08-05 10:39:46,239 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand 107 states. [2019-08-05 10:39:46,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:46,436 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2019-08-05 10:39:46,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2019-08-05 10:39:46,436 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 107 [2019-08-05 10:39:46,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:46,437 INFO L225 Difference]: With dead ends: 109 [2019-08-05 10:39:46,437 INFO L226 Difference]: Without dead ends: 109 [2019-08-05 10:39:46,438 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=5671, Invalid=5671, Unknown=0, NotChecked=0, Total=11342 [2019-08-05 10:39:46,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-08-05 10:39:46,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2019-08-05 10:39:46,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-08-05 10:39:46,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2019-08-05 10:39:46,441 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 107 [2019-08-05 10:39:46,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:46,441 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2019-08-05 10:39:46,441 INFO L476 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-08-05 10:39:46,442 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2019-08-05 10:39:46,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-08-05 10:39:46,442 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:46,442 INFO L399 BasicCegarLoop]: trace histogram [105, 1, 1, 1] [2019-08-05 10:39:46,442 INFO L418 AbstractCegarLoop]: === Iteration 106 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:46,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:46,443 INFO L82 PathProgramCache]: Analyzing trace with hash -2082492282, now seen corresponding path program 105 times [2019-08-05 10:39:46,443 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:46,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:46,474 INFO L256 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 107 conjunts are in the unsatisfiable core [2019-08-05 10:39:46,475 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:51,026 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:39:51,027 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:51,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107] total 107 [2019-08-05 10:39:51,027 INFO L454 AbstractCegarLoop]: Interpolant automaton has 108 states [2019-08-05 10:39:51,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2019-08-05 10:39:51,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-08-05 10:39:51,028 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 108 states. [2019-08-05 10:39:51,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:51,198 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2019-08-05 10:39:51,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2019-08-05 10:39:51,198 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 108 [2019-08-05 10:39:51,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:51,199 INFO L225 Difference]: With dead ends: 110 [2019-08-05 10:39:51,199 INFO L226 Difference]: Without dead ends: 110 [2019-08-05 10:39:51,199 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-08-05 10:39:51,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-08-05 10:39:51,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2019-08-05 10:39:51,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-08-05 10:39:51,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2019-08-05 10:39:51,201 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 108 [2019-08-05 10:39:51,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:51,202 INFO L475 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2019-08-05 10:39:51,202 INFO L476 AbstractCegarLoop]: Interpolant automaton has 108 states. [2019-08-05 10:39:51,202 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2019-08-05 10:39:51,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-08-05 10:39:51,202 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:51,203 INFO L399 BasicCegarLoop]: trace histogram [106, 1, 1, 1] [2019-08-05 10:39:51,203 INFO L418 AbstractCegarLoop]: === Iteration 107 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:51,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:51,203 INFO L82 PathProgramCache]: Analyzing trace with hash -132755168, now seen corresponding path program 106 times [2019-08-05 10:39:51,204 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:51,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:51,238 INFO L256 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 108 conjunts are in the unsatisfiable core [2019-08-05 10:39:51,240 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:55,875 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:39:55,875 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:55,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108] total 108 [2019-08-05 10:39:55,876 INFO L454 AbstractCegarLoop]: Interpolant automaton has 109 states [2019-08-05 10:39:55,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2019-08-05 10:39:55,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5886, Invalid=5886, Unknown=0, NotChecked=0, Total=11772 [2019-08-05 10:39:55,877 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand 109 states. [2019-08-05 10:39:56,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:56,056 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2019-08-05 10:39:56,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2019-08-05 10:39:56,057 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 109 [2019-08-05 10:39:56,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:56,057 INFO L225 Difference]: With dead ends: 111 [2019-08-05 10:39:56,057 INFO L226 Difference]: Without dead ends: 111 [2019-08-05 10:39:56,058 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=5886, Invalid=5886, Unknown=0, NotChecked=0, Total=11772 [2019-08-05 10:39:56,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-08-05 10:39:56,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-08-05 10:39:56,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-08-05 10:39:56,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2019-08-05 10:39:56,059 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 109 [2019-08-05 10:39:56,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:56,060 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2019-08-05 10:39:56,060 INFO L476 AbstractCegarLoop]: Interpolant automaton has 109 states. [2019-08-05 10:39:56,060 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2019-08-05 10:39:56,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-08-05 10:39:56,061 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:56,061 INFO L399 BasicCegarLoop]: trace histogram [107, 1, 1, 1] [2019-08-05 10:39:56,061 INFO L418 AbstractCegarLoop]: === Iteration 108 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:56,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:56,061 INFO L82 PathProgramCache]: Analyzing trace with hash 179553222, now seen corresponding path program 107 times [2019-08-05 10:39:56,062 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:56,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:56,094 INFO L256 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 109 conjunts are in the unsatisfiable core [2019-08-05 10:39:56,096 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:01,077 INFO L134 CoverageAnalysis]: Checked inductivity of 5778 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:40:01,078 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:01,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109] total 109 [2019-08-05 10:40:01,078 INFO L454 AbstractCegarLoop]: Interpolant automaton has 110 states [2019-08-05 10:40:01,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2019-08-05 10:40:01,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-08-05 10:40:01,080 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 110 states. [2019-08-05 10:40:01,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:01,304 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2019-08-05 10:40:01,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2019-08-05 10:40:01,304 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 110 [2019-08-05 10:40:01,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:01,305 INFO L225 Difference]: With dead ends: 112 [2019-08-05 10:40:01,305 INFO L226 Difference]: Without dead ends: 112 [2019-08-05 10:40:01,306 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-08-05 10:40:01,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-08-05 10:40:01,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2019-08-05 10:40:01,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-08-05 10:40:01,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2019-08-05 10:40:01,309 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 110 [2019-08-05 10:40:01,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:01,309 INFO L475 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2019-08-05 10:40:01,309 INFO L476 AbstractCegarLoop]: Interpolant automaton has 110 states. [2019-08-05 10:40:01,309 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2019-08-05 10:40:01,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-08-05 10:40:01,310 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:01,310 INFO L399 BasicCegarLoop]: trace histogram [108, 1, 1, 1] [2019-08-05 10:40:01,311 INFO L418 AbstractCegarLoop]: === Iteration 109 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:01,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:01,311 INFO L82 PathProgramCache]: Analyzing trace with hash 1271178720, now seen corresponding path program 108 times [2019-08-05 10:40:01,311 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:01,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:01,349 INFO L256 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 110 conjunts are in the unsatisfiable core [2019-08-05 10:40:01,351 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:06,600 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:40:06,600 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:06,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110] total 110 [2019-08-05 10:40:06,601 INFO L454 AbstractCegarLoop]: Interpolant automaton has 111 states [2019-08-05 10:40:06,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2019-08-05 10:40:06,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6105, Invalid=6105, Unknown=0, NotChecked=0, Total=12210 [2019-08-05 10:40:06,603 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 111 states. [2019-08-05 10:40:06,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:06,788 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2019-08-05 10:40:06,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2019-08-05 10:40:06,788 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 111 [2019-08-05 10:40:06,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:06,789 INFO L225 Difference]: With dead ends: 113 [2019-08-05 10:40:06,789 INFO L226 Difference]: Without dead ends: 113 [2019-08-05 10:40:06,790 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=6105, Invalid=6105, Unknown=0, NotChecked=0, Total=12210 [2019-08-05 10:40:06,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-08-05 10:40:06,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2019-08-05 10:40:06,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-08-05 10:40:06,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2019-08-05 10:40:06,792 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 111 [2019-08-05 10:40:06,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:06,792 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2019-08-05 10:40:06,792 INFO L476 AbstractCegarLoop]: Interpolant automaton has 111 states. [2019-08-05 10:40:06,792 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2019-08-05 10:40:06,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-08-05 10:40:06,793 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:06,793 INFO L399 BasicCegarLoop]: trace histogram [109, 1, 1, 1] [2019-08-05 10:40:06,794 INFO L418 AbstractCegarLoop]: === Iteration 110 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:06,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:06,794 INFO L82 PathProgramCache]: Analyzing trace with hash 751830790, now seen corresponding path program 109 times [2019-08-05 10:40:06,794 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:06,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:06,828 INFO L256 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 111 conjunts are in the unsatisfiable core [2019-08-05 10:40:06,830 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:11,824 INFO L134 CoverageAnalysis]: Checked inductivity of 5995 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:40:11,825 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:11,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111] total 111 [2019-08-05 10:40:11,825 INFO L454 AbstractCegarLoop]: Interpolant automaton has 112 states [2019-08-05 10:40:11,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2019-08-05 10:40:11,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-08-05 10:40:11,826 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 112 states. [2019-08-05 10:40:12,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:12,058 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2019-08-05 10:40:12,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2019-08-05 10:40:12,058 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 112 [2019-08-05 10:40:12,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:12,059 INFO L225 Difference]: With dead ends: 114 [2019-08-05 10:40:12,059 INFO L226 Difference]: Without dead ends: 114 [2019-08-05 10:40:12,060 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-08-05 10:40:12,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-08-05 10:40:12,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2019-08-05 10:40:12,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-08-05 10:40:12,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 114 transitions. [2019-08-05 10:40:12,062 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 114 transitions. Word has length 112 [2019-08-05 10:40:12,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:12,063 INFO L475 AbstractCegarLoop]: Abstraction has 114 states and 114 transitions. [2019-08-05 10:40:12,063 INFO L476 AbstractCegarLoop]: Interpolant automaton has 112 states. [2019-08-05 10:40:12,063 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 114 transitions. [2019-08-05 10:40:12,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-08-05 10:40:12,064 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:12,064 INFO L399 BasicCegarLoop]: trace histogram [110, 1, 1, 1] [2019-08-05 10:40:12,065 INFO L418 AbstractCegarLoop]: === Iteration 111 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:12,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:12,065 INFO L82 PathProgramCache]: Analyzing trace with hash 1831914144, now seen corresponding path program 110 times [2019-08-05 10:40:12,066 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:12,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:12,105 INFO L256 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 112 conjunts are in the unsatisfiable core [2019-08-05 10:40:12,106 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:17,146 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:40:17,147 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:17,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [112] total 112 [2019-08-05 10:40:17,147 INFO L454 AbstractCegarLoop]: Interpolant automaton has 113 states [2019-08-05 10:40:17,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2019-08-05 10:40:17,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6328, Invalid=6328, Unknown=0, NotChecked=0, Total=12656 [2019-08-05 10:40:17,149 INFO L87 Difference]: Start difference. First operand 114 states and 114 transitions. Second operand 113 states. [2019-08-05 10:40:17,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:17,332 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2019-08-05 10:40:17,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2019-08-05 10:40:17,333 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 113 [2019-08-05 10:40:17,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:17,333 INFO L225 Difference]: With dead ends: 115 [2019-08-05 10:40:17,334 INFO L226 Difference]: Without dead ends: 115 [2019-08-05 10:40:17,335 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=6328, Invalid=6328, Unknown=0, NotChecked=0, Total=12656 [2019-08-05 10:40:17,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-08-05 10:40:17,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2019-08-05 10:40:17,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-08-05 10:40:17,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2019-08-05 10:40:17,337 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 113 [2019-08-05 10:40:17,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:17,338 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2019-08-05 10:40:17,338 INFO L476 AbstractCegarLoop]: Interpolant automaton has 113 states. [2019-08-05 10:40:17,338 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2019-08-05 10:40:17,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-08-05 10:40:17,338 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:17,338 INFO L399 BasicCegarLoop]: trace histogram [111, 1, 1, 1] [2019-08-05 10:40:17,339 INFO L418 AbstractCegarLoop]: === Iteration 112 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:17,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:17,339 INFO L82 PathProgramCache]: Analyzing trace with hash 954759750, now seen corresponding path program 111 times [2019-08-05 10:40:17,340 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:17,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:17,375 INFO L256 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 113 conjunts are in the unsatisfiable core [2019-08-05 10:40:17,376 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:22,501 INFO L134 CoverageAnalysis]: Checked inductivity of 6216 backedges. 0 proven. 6216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:40:22,501 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:22,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113] total 113 [2019-08-05 10:40:22,501 INFO L454 AbstractCegarLoop]: Interpolant automaton has 114 states [2019-08-05 10:40:22,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2019-08-05 10:40:22,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-08-05 10:40:22,503 INFO L87 Difference]: Start difference. First operand 115 states and 115 transitions. Second operand 114 states. [2019-08-05 10:40:22,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:22,686 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2019-08-05 10:40:22,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2019-08-05 10:40:22,686 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 114 [2019-08-05 10:40:22,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:22,687 INFO L225 Difference]: With dead ends: 116 [2019-08-05 10:40:22,687 INFO L226 Difference]: Without dead ends: 116 [2019-08-05 10:40:22,688 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-08-05 10:40:22,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-08-05 10:40:22,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2019-08-05 10:40:22,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-08-05 10:40:22,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 116 transitions. [2019-08-05 10:40:22,690 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 116 transitions. Word has length 114 [2019-08-05 10:40:22,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:22,690 INFO L475 AbstractCegarLoop]: Abstraction has 116 states and 116 transitions. [2019-08-05 10:40:22,690 INFO L476 AbstractCegarLoop]: Interpolant automaton has 114 states. [2019-08-05 10:40:22,690 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2019-08-05 10:40:22,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-08-05 10:40:22,691 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:22,691 INFO L399 BasicCegarLoop]: trace histogram [112, 1, 1, 1] [2019-08-05 10:40:22,691 INFO L418 AbstractCegarLoop]: === Iteration 113 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:22,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:22,692 INFO L82 PathProgramCache]: Analyzing trace with hash -467222688, now seen corresponding path program 112 times [2019-08-05 10:40:22,692 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:22,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:22,732 INFO L256 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 114 conjunts are in the unsatisfiable core [2019-08-05 10:40:22,734 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:27,933 INFO L134 CoverageAnalysis]: Checked inductivity of 6328 backedges. 0 proven. 6328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:40:27,933 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:27,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [114] total 114 [2019-08-05 10:40:27,934 INFO L454 AbstractCegarLoop]: Interpolant automaton has 115 states [2019-08-05 10:40:27,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2019-08-05 10:40:27,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6555, Invalid=6555, Unknown=0, NotChecked=0, Total=13110 [2019-08-05 10:40:27,935 INFO L87 Difference]: Start difference. First operand 116 states and 116 transitions. Second operand 115 states. [2019-08-05 10:40:28,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:28,159 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2019-08-05 10:40:28,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2019-08-05 10:40:28,159 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 115 [2019-08-05 10:40:28,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:28,160 INFO L225 Difference]: With dead ends: 117 [2019-08-05 10:40:28,160 INFO L226 Difference]: Without dead ends: 117 [2019-08-05 10:40:28,160 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=6555, Invalid=6555, Unknown=0, NotChecked=0, Total=13110 [2019-08-05 10:40:28,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-08-05 10:40:28,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2019-08-05 10:40:28,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-08-05 10:40:28,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2019-08-05 10:40:28,162 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 115 [2019-08-05 10:40:28,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:28,163 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2019-08-05 10:40:28,163 INFO L476 AbstractCegarLoop]: Interpolant automaton has 115 states. [2019-08-05 10:40:28,163 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2019-08-05 10:40:28,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-08-05 10:40:28,164 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:28,164 INFO L399 BasicCegarLoop]: trace histogram [113, 1, 1, 1] [2019-08-05 10:40:28,164 INFO L418 AbstractCegarLoop]: === Iteration 114 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:28,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:28,164 INFO L82 PathProgramCache]: Analyzing trace with hash -1599005306, now seen corresponding path program 113 times [2019-08-05 10:40:28,165 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:28,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:28,202 INFO L256 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 115 conjunts are in the unsatisfiable core [2019-08-05 10:40:28,203 INFO L279 TraceCheckSpWp]: Computing forward predicates... Received shutdown request... [2019-08-05 10:40:33,102 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2019-08-05 10:40:33,102 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-05 10:40:33,108 WARN L223 ceAbstractionStarter]: Timeout [2019-08-05 10:40:33,108 INFO L202 PluginConnector]: Adding new model LuxembourgOctopus.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:40:33 BoogieIcfgContainer [2019-08-05 10:40:33,108 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:40:33,111 INFO L168 Benchmark]: Toolchain (without parser) took 242877.46 ms. Allocated memory was 137.9 MB in the beginning and 810.0 MB in the end (delta: 672.1 MB). Free memory was 111.1 MB in the beginning and 678.1 MB in the end (delta: -567.0 MB). Peak memory consumption was 105.1 MB. Max. memory is 7.1 GB. [2019-08-05 10:40:33,111 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 137.9 MB. Free memory is still 112.0 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-08-05 10:40:33,112 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.63 ms. Allocated memory is still 137.9 MB. Free memory was 111.1 MB in the beginning and 109.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:40:33,112 INFO L168 Benchmark]: Boogie Preprocessor took 17.72 ms. Allocated memory is still 137.9 MB. Free memory was 109.0 MB in the beginning and 108.2 MB in the end (delta: 857.5 kB). Peak memory consumption was 857.5 kB. Max. memory is 7.1 GB. [2019-08-05 10:40:33,113 INFO L168 Benchmark]: RCFGBuilder took 317.86 ms. Allocated memory is still 137.9 MB. Free memory was 107.8 MB in the beginning and 99.2 MB in the end (delta: 8.6 MB). Peak memory consumption was 8.6 MB. Max. memory is 7.1 GB. [2019-08-05 10:40:33,114 INFO L168 Benchmark]: TraceAbstraction took 242502.66 ms. Allocated memory was 137.9 MB in the beginning and 810.0 MB in the end (delta: 672.1 MB). Free memory was 98.8 MB in the beginning and 678.1 MB in the end (delta: -579.4 MB). Peak memory consumption was 92.8 MB. Max. memory is 7.1 GB. [2019-08-05 10:40:33,116 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.23 ms. Allocated memory is still 137.9 MB. Free memory is still 112.0 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 34.63 ms. Allocated memory is still 137.9 MB. Free memory was 111.1 MB in the beginning and 109.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 17.72 ms. Allocated memory is still 137.9 MB. Free memory was 109.0 MB in the beginning and 108.2 MB in the end (delta: 857.5 kB). Peak memory consumption was 857.5 kB. Max. memory is 7.1 GB. * RCFGBuilder took 317.86 ms. Allocated memory is still 137.9 MB. Free memory was 107.8 MB in the beginning and 99.2 MB in the end (delta: 8.6 MB). Peak memory consumption was 8.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 242502.66 ms. Allocated memory was 137.9 MB in the beginning and 810.0 MB in the end (delta: 672.1 MB). Free memory was 98.8 MB in the beginning and 678.1 MB in the end (delta: -579.4 MB). Peak memory consumption was 92.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 25]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 25). Cancelled while BasicCegarLoop was analyzing trace of length 117 with TraceHistMax 113,while TraceCheckSpWp was constructing forward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 111 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 6 locations, 1 error locations. TIMEOUT Result, 242.4s OverallTime, 114 OverallIterations, 113 TraceHistogramMax, 13.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 341 SDtfs, 2 SDslu, 1825 SDs, 0 SdLazy, 8379 SolverSat, 206 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6554 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 6441 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 218.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=117occurred in iteration=113, 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, 113 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.9s SatisfiabilityAnalysisTime, 221.4s InterpolantComputationTime, 6667 NumberOfCodeBlocks, 6667 NumberOfCodeBlocksAsserted, 113 NumberOfCheckSat, 6554 ConstructedInterpolants, 0 QuantifiedInterpolants, 2462496 SizeOfPredicates, 226 NumberOfNonLiveVariables, 26329 ConjunctsInSsa, 6554 ConjunctsInUnsatCore, 113 InterpolantComputations, 1 PerfectInterpolantSequences, 0/240464 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown