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/loopAcceleration/loopAccelerationWerner/oneLoopArray.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 11:18:35,201 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 11:18:35,205 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 11:18:35,216 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 11:18:35,217 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 11:18:35,218 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 11:18:35,219 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 11:18:35,221 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 11:18:35,222 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 11:18:35,223 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 11:18:35,224 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 11:18:35,225 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 11:18:35,225 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 11:18:35,226 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 11:18:35,227 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 11:18:35,231 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 11:18:35,231 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 11:18:35,236 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 11:18:35,238 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 11:18:35,244 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 11:18:35,250 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 11:18:35,251 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 11:18:35,252 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 11:18:35,253 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 11:18:35,259 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 11:18:35,259 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 11:18:35,259 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 11:18:35,260 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 11:18:35,261 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 11:18:35,263 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 11:18:35,263 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 11:18:35,264 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 11:18:35,265 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 11:18:35,265 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 11:18:35,267 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 11:18:35,267 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 11:18:35,268 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 11:18:35,268 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 11:18:35,269 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 11:18:35,271 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 11:18:35,271 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 11:18:35,304 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 11:18:35,314 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 11:18:35,318 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 11:18:35,319 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 11:18:35,320 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 11:18:35,320 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/loopAcceleration/loopAccelerationWerner/oneLoopArray.bpl [2019-08-05 11:18:35,321 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/loopAcceleration/loopAccelerationWerner/oneLoopArray.bpl' [2019-08-05 11:18:35,353 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 11:18:35,355 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 11:18:35,356 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 11:18:35,356 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 11:18:35,356 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 11:18:35,373 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "oneLoopArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:18:35" (1/1) ... [2019-08-05 11:18:35,384 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "oneLoopArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:18:35" (1/1) ... [2019-08-05 11:18:35,393 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 11:18:35,393 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 11:18:35,393 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 11:18:35,395 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 11:18:35,396 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 11:18:35,396 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 11:18:35,396 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 11:18:35,408 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "oneLoopArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:18:35" (1/1) ... [2019-08-05 11:18:35,409 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "oneLoopArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:18:35" (1/1) ... [2019-08-05 11:18:35,409 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "oneLoopArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:18:35" (1/1) ... [2019-08-05 11:18:35,409 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "oneLoopArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:18:35" (1/1) ... [2019-08-05 11:18:35,415 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "oneLoopArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:18:35" (1/1) ... [2019-08-05 11:18:35,421 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "oneLoopArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:18:35" (1/1) ... [2019-08-05 11:18:35,422 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "oneLoopArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:18:35" (1/1) ... [2019-08-05 11:18:35,423 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 11:18:35,424 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 11:18:35,424 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 11:18:35,424 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 11:18:35,425 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "oneLoopArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:18:35" (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 11:18:35,494 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2019-08-05 11:18:35,494 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-08-05 11:18:35,495 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-08-05 11:18:35,721 INFO L275 CfgBuilder]: Using library mode [2019-08-05 11:18:35,721 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 11:18:35,722 INFO L202 PluginConnector]: Adding new model oneLoopArray.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:18:35 BoogieIcfgContainer [2019-08-05 11:18:35,722 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 11:18:35,724 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 11:18:35,724 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 11:18:35,727 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 11:18:35,727 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "oneLoopArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:18:35" (1/2) ... [2019-08-05 11:18:35,728 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2204561f and model type oneLoopArray.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 11:18:35, skipping insertion in model container [2019-08-05 11:18:35,728 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "oneLoopArray.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:18:35" (2/2) ... [2019-08-05 11:18:35,730 INFO L109 eAbstractionObserver]: Analyzing ICFG oneLoopArray.bpl [2019-08-05 11:18:35,739 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 11:18:35,745 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-08-05 11:18:35,759 INFO L252 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-08-05 11:18:35,784 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 11:18:35,785 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 11:18:35,785 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 11:18:35,785 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 11:18:35,785 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 11:18:35,785 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 11:18:35,786 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 11:18:35,786 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 11:18:35,786 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 11:18:35,805 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2019-08-05 11:18:35,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 11:18:35,822 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:35,823 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 11:18:35,825 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:35,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:35,831 INFO L82 PathProgramCache]: Analyzing trace with hash 29984, now seen corresponding path program 1 times [2019-08-05 11:18:35,876 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:35,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:35,906 INFO L256 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 11:18:35,910 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:35,959 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 11:18:35,962 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:18:35,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 11:18:35,966 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:18:35,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:18:35,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:18:35,980 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2019-08-05 11:18:36,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:36,029 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-05 11:18:36,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:18:36,032 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-05 11:18:36,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:36,052 INFO L225 Difference]: With dead ends: 8 [2019-08-05 11:18:36,053 INFO L226 Difference]: Without dead ends: 7 [2019-08-05 11:18:36,057 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 11:18:36,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-05 11:18:36,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-05 11:18:36,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 11:18:36,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-08-05 11:18:36,136 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 3 [2019-08-05 11:18:36,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:36,137 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-08-05 11:18:36,137 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:18:36,137 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-08-05 11:18:36,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 11:18:36,138 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:36,138 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 11:18:36,138 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:36,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:36,139 INFO L82 PathProgramCache]: Analyzing trace with hash 927558, now seen corresponding path program 1 times [2019-08-05 11:18:36,140 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:36,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:36,156 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 11:18:36,160 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:36,258 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 11:18:36,259 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:36,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 11:18:36,261 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:18:36,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:18:36,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:18:36,262 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 4 states. [2019-08-05 11:18:36,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:36,322 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-05 11:18:36,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 11:18:36,323 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-08-05 11:18:36,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:36,324 INFO L225 Difference]: With dead ends: 8 [2019-08-05 11:18:36,324 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 11:18:36,325 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:18:36,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 11:18:36,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-05 11:18:36,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 11:18:36,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-08-05 11:18:36,328 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2019-08-05 11:18:36,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:36,328 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-08-05 11:18:36,329 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:18:36,329 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-08-05 11:18:36,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 11:18:36,329 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:36,330 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-08-05 11:18:36,330 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:36,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:36,330 INFO L82 PathProgramCache]: Analyzing trace with hash 28752352, now seen corresponding path program 2 times [2019-08-05 11:18:36,331 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:36,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:36,341 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 11:18:36,342 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:36,413 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:18:36,414 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:18:36,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 11:18:36,414 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:18:36,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:18:36,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:18:36,416 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 4 states. [2019-08-05 11:18:36,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:36,462 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-08-05 11:18:36,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 11:18:36,463 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-08-05 11:18:36,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:36,464 INFO L225 Difference]: With dead ends: 7 [2019-08-05 11:18:36,464 INFO L226 Difference]: Without dead ends: 7 [2019-08-05 11:18:36,464 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:18:36,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-05 11:18:36,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-05 11:18:36,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 11:18:36,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-08-05 11:18:36,467 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-08-05 11:18:36,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:36,468 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-08-05 11:18:36,468 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:18:36,468 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-08-05 11:18:36,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 11:18:36,469 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:36,469 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-08-05 11:18:36,469 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:36,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:36,473 INFO L82 PathProgramCache]: Analyzing trace with hash 891322952, now seen corresponding path program 1 times [2019-08-05 11:18:36,474 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:36,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:36,498 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 11:18:36,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:36,561 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 11:18:36,562 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:36,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 11:18:36,562 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 11:18:36,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 11:18:36,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:18:36,563 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 5 states. [2019-08-05 11:18:36,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:36,586 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-05 11:18:36,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:18:36,587 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2019-08-05 11:18:36,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:36,588 INFO L225 Difference]: With dead ends: 8 [2019-08-05 11:18:36,588 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 11:18:36,590 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:18:36,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 11:18:36,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-05 11:18:36,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 11:18:36,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-08-05 11:18:36,592 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-08-05 11:18:36,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:36,593 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-08-05 11:18:36,593 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 11:18:36,593 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-08-05 11:18:36,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 11:18:36,594 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:36,594 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1] [2019-08-05 11:18:36,595 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:36,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:36,595 INFO L82 PathProgramCache]: Analyzing trace with hash 1861146210, now seen corresponding path program 2 times [2019-08-05 11:18:36,596 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:36,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:36,609 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 11:18:36,610 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:36,701 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 11:18:36,702 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:36,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 11:18:36,702 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 11:18:36,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 11:18:36,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:18:36,703 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 6 states. [2019-08-05 11:18:36,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:36,764 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-08-05 11:18:36,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 11:18:36,764 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2019-08-05 11:18:36,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:36,765 INFO L225 Difference]: With dead ends: 9 [2019-08-05 11:18:36,765 INFO L226 Difference]: Without dead ends: 9 [2019-08-05 11:18:36,766 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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 11:18:36,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-05 11:18:36,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-08-05 11:18:36,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 11:18:36,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-08-05 11:18:36,768 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-08-05 11:18:36,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:36,768 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-08-05 11:18:36,768 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 11:18:36,768 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-08-05 11:18:36,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 11:18:36,769 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:36,769 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1] [2019-08-05 11:18:36,769 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:36,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:36,770 INFO L82 PathProgramCache]: Analyzing trace with hash 1860896136, now seen corresponding path program 3 times [2019-08-05 11:18:36,771 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:36,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:36,784 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 11:18:36,785 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:36,984 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 11:18:36,985 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:36,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 11:18:36,985 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 11:18:36,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 11:18:36,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:18:36,986 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 7 states. [2019-08-05 11:18:37,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:37,051 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-08-05 11:18:37,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 11:18:37,051 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2019-08-05 11:18:37,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:37,052 INFO L225 Difference]: With dead ends: 10 [2019-08-05 11:18:37,052 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 11:18:37,052 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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 11:18:37,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 11:18:37,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-08-05 11:18:37,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 11:18:37,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-08-05 11:18:37,055 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2019-08-05 11:18:37,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:37,055 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-08-05 11:18:37,055 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 11:18:37,055 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-08-05 11:18:37,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 11:18:37,056 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:37,056 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1] [2019-08-05 11:18:37,056 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:37,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:37,057 INFO L82 PathProgramCache]: Analyzing trace with hash 1853143842, now seen corresponding path program 4 times [2019-08-05 11:18:37,058 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:37,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:37,072 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 11:18:37,073 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:37,235 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 11:18:37,235 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:37,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 11:18:37,236 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 11:18:37,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 11:18:37,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:18:37,237 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 8 states. [2019-08-05 11:18:37,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:37,295 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-08-05 11:18:37,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 11:18:37,296 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2019-08-05 11:18:37,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:37,297 INFO L225 Difference]: With dead ends: 11 [2019-08-05 11:18:37,297 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 11:18:37,297 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:18:37,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 11:18:37,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-05 11:18:37,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 11:18:37,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-08-05 11:18:37,300 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2019-08-05 11:18:37,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:37,300 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-08-05 11:18:37,300 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 11:18:37,300 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-08-05 11:18:37,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 11:18:37,301 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:37,301 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1] [2019-08-05 11:18:37,301 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:37,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:37,301 INFO L82 PathProgramCache]: Analyzing trace with hash 1612822728, now seen corresponding path program 5 times [2019-08-05 11:18:37,302 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:37,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:37,320 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 11:18:37,323 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:37,498 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 11:18:37,498 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:37,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 11:18:37,499 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 11:18:37,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 11:18:37,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:18:37,500 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 9 states. [2019-08-05 11:18:37,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:37,542 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-08-05 11:18:37,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 11:18:37,543 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 10 [2019-08-05 11:18:37,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:37,543 INFO L225 Difference]: With dead ends: 12 [2019-08-05 11:18:37,544 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 11:18:37,544 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:18:37,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 11:18:37,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-08-05 11:18:37,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 11:18:37,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-08-05 11:18:37,546 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-08-05 11:18:37,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:37,547 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-08-05 11:18:37,547 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 11:18:37,547 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-08-05 11:18:37,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 11:18:37,547 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:37,548 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1] [2019-08-05 11:18:37,548 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:37,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:37,548 INFO L82 PathProgramCache]: Analyzing trace with hash -1542164510, now seen corresponding path program 6 times [2019-08-05 11:18:37,549 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:37,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:37,566 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 11:18:37,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:37,703 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 11:18:37,704 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:37,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 11:18:37,704 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 11:18:37,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 11:18:37,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:18:37,706 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 10 states. [2019-08-05 11:18:37,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:37,828 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-08-05 11:18:37,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 11:18:37,829 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 11 [2019-08-05 11:18:37,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:37,830 INFO L225 Difference]: With dead ends: 13 [2019-08-05 11:18:37,830 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 11:18:37,830 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 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 11:18:37,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 11:18:37,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-08-05 11:18:37,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 11:18:37,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-08-05 11:18:37,834 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2019-08-05 11:18:37,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:37,835 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-08-05 11:18:37,835 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 11:18:37,835 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-08-05 11:18:37,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 11:18:37,835 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:37,836 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1] [2019-08-05 11:18:37,836 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:37,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:37,836 INFO L82 PathProgramCache]: Analyzing trace with hash -562521080, now seen corresponding path program 7 times [2019-08-05 11:18:37,839 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:37,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:37,874 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 11:18:37,876 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:38,105 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 11:18:38,105 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:38,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 11:18:38,106 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 11:18:38,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 11:18:38,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:18:38,107 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 11 states. [2019-08-05 11:18:38,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:38,136 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-08-05 11:18:38,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 11:18:38,136 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 12 [2019-08-05 11:18:38,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:38,138 INFO L225 Difference]: With dead ends: 14 [2019-08-05 11:18:38,138 INFO L226 Difference]: Without dead ends: 14 [2019-08-05 11:18:38,139 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:18:38,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-05 11:18:38,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-08-05 11:18:38,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-05 11:18:38,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-08-05 11:18:38,141 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2019-08-05 11:18:38,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:38,141 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-08-05 11:18:38,142 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 11:18:38,142 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-08-05 11:18:38,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 11:18:38,142 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:38,142 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1, 1, 1] [2019-08-05 11:18:38,142 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:38,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:38,143 INFO L82 PathProgramCache]: Analyzing trace with hash -258345822, now seen corresponding path program 8 times [2019-08-05 11:18:38,143 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:38,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:38,161 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 11:18:38,162 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:38,395 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 11:18:38,395 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:38,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 11:18:38,396 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 11:18:38,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 11:18:38,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 11:18:38,398 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 12 states. [2019-08-05 11:18:38,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:38,460 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-08-05 11:18:38,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 11:18:38,460 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 13 [2019-08-05 11:18:38,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:38,462 INFO L225 Difference]: With dead ends: 15 [2019-08-05 11:18:38,462 INFO L226 Difference]: Without dead ends: 15 [2019-08-05 11:18:38,463 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 11:18:38,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-05 11:18:38,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-08-05 11:18:38,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 11:18:38,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-08-05 11:18:38,465 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2019-08-05 11:18:38,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:38,466 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-08-05 11:18:38,466 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 11:18:38,466 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-08-05 11:18:38,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 11:18:38,467 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:38,467 INFO L399 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1] [2019-08-05 11:18:38,467 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:38,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:38,467 INFO L82 PathProgramCache]: Analyzing trace with hash 581152584, now seen corresponding path program 9 times [2019-08-05 11:18:38,468 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:38,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:38,484 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 11:18:38,485 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:38,752 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 11:18:38,753 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:38,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 11:18:38,753 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 11:18:38,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 11:18:38,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:18:38,754 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 13 states. [2019-08-05 11:18:38,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:38,807 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-08-05 11:18:38,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 11:18:38,808 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 14 [2019-08-05 11:18:38,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:38,809 INFO L225 Difference]: With dead ends: 16 [2019-08-05 11:18:38,809 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 11:18:38,810 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 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 11:18:38,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 11:18:38,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-08-05 11:18:38,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 11:18:38,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-08-05 11:18:38,814 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2019-08-05 11:18:38,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:38,814 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-08-05 11:18:38,814 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 11:18:38,815 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-08-05 11:18:38,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 11:18:38,815 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:38,815 INFO L399 BasicCegarLoop]: trace histogram [11, 1, 1, 1, 1] [2019-08-05 11:18:38,816 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:38,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:38,816 INFO L82 PathProgramCache]: Analyzing trace with hash 835799394, now seen corresponding path program 10 times [2019-08-05 11:18:38,817 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:38,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:38,833 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 11:18:38,834 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:39,047 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 11:18:39,048 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:39,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 11:18:39,049 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 11:18:39,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 11:18:39,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-08-05 11:18:39,050 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 14 states. [2019-08-05 11:18:39,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:39,082 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-08-05 11:18:39,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 11:18:39,083 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 15 [2019-08-05 11:18:39,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:39,084 INFO L225 Difference]: With dead ends: 17 [2019-08-05 11:18:39,084 INFO L226 Difference]: Without dead ends: 17 [2019-08-05 11:18:39,085 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-08-05 11:18:39,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-05 11:18:39,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-08-05 11:18:39,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 11:18:39,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-08-05 11:18:39,088 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2019-08-05 11:18:39,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:39,088 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-08-05 11:18:39,088 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 11:18:39,088 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-08-05 11:18:39,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 11:18:39,089 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:39,089 INFO L399 BasicCegarLoop]: trace histogram [12, 1, 1, 1, 1] [2019-08-05 11:18:39,089 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:39,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:39,090 INFO L82 PathProgramCache]: Analyzing trace with hash 139915912, now seen corresponding path program 11 times [2019-08-05 11:18:39,090 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:39,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:39,109 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 11:18:39,110 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:39,313 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 11:18:39,313 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:39,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 11:18:39,314 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 11:18:39,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 11:18:39,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:18:39,315 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 15 states. [2019-08-05 11:18:39,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:39,346 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-08-05 11:18:39,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 11:18:39,347 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 16 [2019-08-05 11:18:39,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:39,347 INFO L225 Difference]: With dead ends: 18 [2019-08-05 11:18:39,348 INFO L226 Difference]: Without dead ends: 18 [2019-08-05 11:18:39,348 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 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 11:18:39,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-05 11:18:39,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-08-05 11:18:39,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-05 11:18:39,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-08-05 11:18:39,351 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2019-08-05 11:18:39,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:39,352 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-08-05 11:18:39,352 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 11:18:39,352 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-08-05 11:18:39,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 11:18:39,352 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:39,352 INFO L399 BasicCegarLoop]: trace histogram [13, 1, 1, 1, 1] [2019-08-05 11:18:39,353 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:39,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:39,353 INFO L82 PathProgramCache]: Analyzing trace with hash 42364450, now seen corresponding path program 12 times [2019-08-05 11:18:39,354 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:39,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:39,370 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 11:18:39,371 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:39,704 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 11:18:39,704 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:39,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 11:18:39,705 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 11:18:39,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 11:18:39,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-08-05 11:18:39,705 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 16 states. [2019-08-05 11:18:39,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:39,733 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-08-05 11:18:39,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 11:18:39,733 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 17 [2019-08-05 11:18:39,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:39,734 INFO L225 Difference]: With dead ends: 19 [2019-08-05 11:18:39,734 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 11:18:39,735 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-08-05 11:18:39,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 11:18:39,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-08-05 11:18:39,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 11:18:39,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-08-05 11:18:39,737 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2019-08-05 11:18:39,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:39,738 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-08-05 11:18:39,738 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 11:18:39,738 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-08-05 11:18:39,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 11:18:39,738 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:39,739 INFO L399 BasicCegarLoop]: trace histogram [14, 1, 1, 1, 1] [2019-08-05 11:18:39,739 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:39,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:39,739 INFO L82 PathProgramCache]: Analyzing trace with hash 1313236424, now seen corresponding path program 13 times [2019-08-05 11:18:39,740 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:39,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:39,756 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:18:39,757 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:39,967 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 11:18:39,968 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:39,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 11:18:39,968 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:18:39,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:18:39,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:18:39,969 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 17 states. [2019-08-05 11:18:40,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:40,217 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-08-05 11:18:40,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:18:40,220 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 18 [2019-08-05 11:18:40,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:40,220 INFO L225 Difference]: With dead ends: 20 [2019-08-05 11:18:40,221 INFO L226 Difference]: Without dead ends: 20 [2019-08-05 11:18:40,221 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 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 11:18:40,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-05 11:18:40,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-08-05 11:18:40,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 11:18:40,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-08-05 11:18:40,228 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2019-08-05 11:18:40,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:40,228 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-08-05 11:18:40,229 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:18:40,229 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-08-05 11:18:40,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 11:18:40,229 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:40,229 INFO L399 BasicCegarLoop]: trace histogram [15, 1, 1, 1, 1] [2019-08-05 11:18:40,230 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:40,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:40,233 INFO L82 PathProgramCache]: Analyzing trace with hash 2055561954, now seen corresponding path program 14 times [2019-08-05 11:18:40,234 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:40,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:40,257 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 11:18:40,259 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:40,455 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 11:18:40,455 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:40,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:18:40,456 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 11:18:40,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 11:18:40,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-08-05 11:18:40,457 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 18 states. [2019-08-05 11:18:40,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:40,505 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-08-05 11:18:40,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 11:18:40,505 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 19 [2019-08-05 11:18:40,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:40,506 INFO L225 Difference]: With dead ends: 21 [2019-08-05 11:18:40,506 INFO L226 Difference]: Without dead ends: 21 [2019-08-05 11:18:40,507 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-08-05 11:18:40,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-05 11:18:40,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-08-05 11:18:40,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-05 11:18:40,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-08-05 11:18:40,510 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2019-08-05 11:18:40,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:40,510 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-08-05 11:18:40,510 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 11:18:40,510 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-08-05 11:18:40,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 11:18:40,511 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:40,511 INFO L399 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1] [2019-08-05 11:18:40,511 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:40,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:40,511 INFO L82 PathProgramCache]: Analyzing trace with hash -702150392, now seen corresponding path program 15 times [2019-08-05 11:18:40,512 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:40,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:40,533 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:18:40,534 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:40,714 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 11:18:40,715 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:40,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 11:18:40,715 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:18:40,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:18:40,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:18:40,716 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 19 states. [2019-08-05 11:18:40,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:40,772 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-08-05 11:18:40,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:18:40,772 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 20 [2019-08-05 11:18:40,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:40,773 INFO L225 Difference]: With dead ends: 22 [2019-08-05 11:18:40,773 INFO L226 Difference]: Without dead ends: 22 [2019-08-05 11:18:40,774 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:18:40,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-05 11:18:40,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-08-05 11:18:40,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-05 11:18:40,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-08-05 11:18:40,778 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2019-08-05 11:18:40,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:40,778 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-08-05 11:18:40,778 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:18:40,778 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-08-05 11:18:40,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 11:18:40,779 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:40,779 INFO L399 BasicCegarLoop]: trace histogram [17, 1, 1, 1, 1] [2019-08-05 11:18:40,779 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:40,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:40,780 INFO L82 PathProgramCache]: Analyzing trace with hash -291887198, now seen corresponding path program 16 times [2019-08-05 11:18:40,781 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:40,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:40,796 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 11:18:40,797 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:41,320 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 11:18:41,321 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:41,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:18:41,321 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 11:18:41,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 11:18:41,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-08-05 11:18:41,322 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 20 states. [2019-08-05 11:18:41,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:41,380 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-08-05 11:18:41,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 11:18:41,380 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 21 [2019-08-05 11:18:41,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:41,381 INFO L225 Difference]: With dead ends: 23 [2019-08-05 11:18:41,382 INFO L226 Difference]: Without dead ends: 23 [2019-08-05 11:18:41,383 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 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 11:18:41,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-08-05 11:18:41,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-08-05 11:18:41,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-05 11:18:41,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-08-05 11:18:41,386 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2019-08-05 11:18:41,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:41,386 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-08-05 11:18:41,386 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 11:18:41,387 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-08-05 11:18:41,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 11:18:41,387 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:41,387 INFO L399 BasicCegarLoop]: trace histogram [18, 1, 1, 1, 1] [2019-08-05 11:18:41,388 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:41,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:41,388 INFO L82 PathProgramCache]: Analyzing trace with hash -458630072, now seen corresponding path program 17 times [2019-08-05 11:18:41,389 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:41,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:41,404 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:18:41,405 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:41,867 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 11:18:41,868 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:41,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 11:18:41,868 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:18:41,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:18:41,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:18:41,869 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 21 states. [2019-08-05 11:18:41,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:41,906 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-08-05 11:18:41,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:18:41,906 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 22 [2019-08-05 11:18:41,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:41,907 INFO L225 Difference]: With dead ends: 24 [2019-08-05 11:18:41,908 INFO L226 Difference]: Without dead ends: 24 [2019-08-05 11:18:41,908 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:18:41,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-08-05 11:18:41,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-08-05 11:18:41,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-05 11:18:41,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-08-05 11:18:41,911 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2019-08-05 11:18:41,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:41,912 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-08-05 11:18:41,912 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:18:41,912 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-08-05 11:18:41,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 11:18:41,913 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:41,913 INFO L399 BasicCegarLoop]: trace histogram [19, 1, 1, 1, 1] [2019-08-05 11:18:41,913 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:41,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:41,913 INFO L82 PathProgramCache]: Analyzing trace with hash -1332691870, now seen corresponding path program 18 times [2019-08-05 11:18:41,914 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:41,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:41,928 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 11:18:41,930 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:42,234 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 11:18:42,235 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:42,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:18:42,235 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 11:18:42,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 11:18:42,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-08-05 11:18:42,236 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 22 states. [2019-08-05 11:18:42,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:42,265 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-08-05 11:18:42,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 11:18:42,266 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 23 [2019-08-05 11:18:42,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:42,266 INFO L225 Difference]: With dead ends: 25 [2019-08-05 11:18:42,266 INFO L226 Difference]: Without dead ends: 25 [2019-08-05 11:18:42,267 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 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 11:18:42,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-05 11:18:42,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-08-05 11:18:42,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-05 11:18:42,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-08-05 11:18:42,271 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2019-08-05 11:18:42,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:42,271 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-08-05 11:18:42,271 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 11:18:42,272 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-08-05 11:18:42,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 11:18:42,272 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:42,272 INFO L399 BasicCegarLoop]: trace histogram [20, 1, 1, 1, 1] [2019-08-05 11:18:42,273 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:42,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:42,273 INFO L82 PathProgramCache]: Analyzing trace with hash 1636163464, now seen corresponding path program 19 times [2019-08-05 11:18:42,274 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:42,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:42,288 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 11:18:42,290 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:42,620 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 11:18:42,621 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:42,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 11:18:42,622 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 11:18:42,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 11:18:42,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:18:42,623 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 23 states. [2019-08-05 11:18:42,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:42,815 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-08-05 11:18:42,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 11:18:42,817 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 24 [2019-08-05 11:18:42,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:42,817 INFO L225 Difference]: With dead ends: 26 [2019-08-05 11:18:42,818 INFO L226 Difference]: Without dead ends: 26 [2019-08-05 11:18:42,818 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:18:42,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-08-05 11:18:42,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-08-05 11:18:42,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-08-05 11:18:42,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-08-05 11:18:42,820 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2019-08-05 11:18:42,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:42,821 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-08-05 11:18:42,821 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 11:18:42,821 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-08-05 11:18:42,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 11:18:42,821 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:42,821 INFO L399 BasicCegarLoop]: trace histogram [21, 1, 1, 1, 1] [2019-08-05 11:18:42,822 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:42,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:42,822 INFO L82 PathProgramCache]: Analyzing trace with hash -818601694, now seen corresponding path program 20 times [2019-08-05 11:18:42,822 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:42,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:42,837 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 11:18:42,838 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:43,169 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 11:18:43,169 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:43,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 11:18:43,170 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 11:18:43,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 11:18:43,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-08-05 11:18:43,171 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 24 states. [2019-08-05 11:18:43,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:43,238 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-08-05 11:18:43,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 11:18:43,239 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 25 [2019-08-05 11:18:43,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:43,239 INFO L225 Difference]: With dead ends: 27 [2019-08-05 11:18:43,239 INFO L226 Difference]: Without dead ends: 27 [2019-08-05 11:18:43,240 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 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 11:18:43,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-08-05 11:18:43,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-08-05 11:18:43,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-05 11:18:43,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-08-05 11:18:43,244 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2019-08-05 11:18:43,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:43,245 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-08-05 11:18:43,245 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 11:18:43,245 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-08-05 11:18:43,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 11:18:43,245 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:43,245 INFO L399 BasicCegarLoop]: trace histogram [22, 1, 1, 1, 1] [2019-08-05 11:18:43,246 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:43,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:43,246 INFO L82 PathProgramCache]: Analyzing trace with hash 393089736, now seen corresponding path program 21 times [2019-08-05 11:18:43,247 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:43,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:43,260 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 24 conjunts are in the unsatisfiable core [2019-08-05 11:18:43,262 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:43,952 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 11:18:43,953 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:43,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 11:18:43,953 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 11:18:43,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 11:18:43,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:18:43,954 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 25 states. [2019-08-05 11:18:44,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:44,027 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-08-05 11:18:44,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 11:18:44,028 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 26 [2019-08-05 11:18:44,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:44,029 INFO L225 Difference]: With dead ends: 28 [2019-08-05 11:18:44,029 INFO L226 Difference]: Without dead ends: 28 [2019-08-05 11:18:44,029 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:18:44,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-08-05 11:18:44,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-08-05 11:18:44,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-05 11:18:44,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-08-05 11:18:44,032 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2019-08-05 11:18:44,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:44,032 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-08-05 11:18:44,032 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 11:18:44,032 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-08-05 11:18:44,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 11:18:44,033 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:44,033 INFO L399 BasicCegarLoop]: trace histogram [23, 1, 1, 1, 1] [2019-08-05 11:18:44,033 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:44,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:44,034 INFO L82 PathProgramCache]: Analyzing trace with hash -699181598, now seen corresponding path program 22 times [2019-08-05 11:18:44,034 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:44,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:44,047 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 11:18:44,049 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:44,330 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 11:18:44,330 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:44,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 11:18:44,330 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 11:18:44,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 11:18:44,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-08-05 11:18:44,331 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 26 states. [2019-08-05 11:18:44,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:44,390 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-08-05 11:18:44,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 11:18:44,392 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 27 [2019-08-05 11:18:44,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:44,392 INFO L225 Difference]: With dead ends: 29 [2019-08-05 11:18:44,392 INFO L226 Difference]: Without dead ends: 29 [2019-08-05 11:18:44,393 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-08-05 11:18:44,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-08-05 11:18:44,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-08-05 11:18:44,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-08-05 11:18:44,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-08-05 11:18:44,395 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2019-08-05 11:18:44,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:44,396 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-08-05 11:18:44,396 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 11:18:44,396 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-08-05 11:18:44,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 11:18:44,396 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:44,397 INFO L399 BasicCegarLoop]: trace histogram [24, 1, 1, 1, 1] [2019-08-05 11:18:44,397 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:44,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:44,397 INFO L82 PathProgramCache]: Analyzing trace with hash -199854584, now seen corresponding path program 23 times [2019-08-05 11:18:44,398 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:44,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:44,410 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 26 conjunts are in the unsatisfiable core [2019-08-05 11:18:44,412 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:45,105 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 11:18:45,106 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:45,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 11:18:45,107 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:18:45,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:18:45,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:18:45,108 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 27 states. [2019-08-05 11:18:45,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:45,223 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-08-05 11:18:45,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:18:45,223 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 28 [2019-08-05 11:18:45,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:45,224 INFO L225 Difference]: With dead ends: 30 [2019-08-05 11:18:45,224 INFO L226 Difference]: Without dead ends: 30 [2019-08-05 11:18:45,224 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 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 11:18:45,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-08-05 11:18:45,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-08-05 11:18:45,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-05 11:18:45,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-08-05 11:18:45,227 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2019-08-05 11:18:45,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:45,227 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-08-05 11:18:45,228 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:18:45,228 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-08-05 11:18:45,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 11:18:45,228 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:45,228 INFO L399 BasicCegarLoop]: trace histogram [25, 1, 1, 1, 1] [2019-08-05 11:18:45,228 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:45,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:45,229 INFO L82 PathProgramCache]: Analyzing trace with hash -1900586334, now seen corresponding path program 24 times [2019-08-05 11:18:45,229 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:45,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:45,241 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:18:45,242 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:45,844 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 11:18:45,844 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:45,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:18:45,845 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 11:18:45,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 11:18:45,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-08-05 11:18:45,847 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 28 states. [2019-08-05 11:18:46,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:46,002 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-08-05 11:18:46,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 11:18:46,003 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 29 [2019-08-05 11:18:46,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:46,003 INFO L225 Difference]: With dead ends: 31 [2019-08-05 11:18:46,003 INFO L226 Difference]: Without dead ends: 31 [2019-08-05 11:18:46,004 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-08-05 11:18:46,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-08-05 11:18:46,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-08-05 11:18:46,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-08-05 11:18:46,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-08-05 11:18:46,006 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2019-08-05 11:18:46,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:46,007 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-08-05 11:18:46,007 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 11:18:46,007 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-08-05 11:18:46,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 11:18:46,007 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:46,007 INFO L399 BasicCegarLoop]: trace histogram [26, 1, 1, 1, 1] [2019-08-05 11:18:46,008 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:46,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:46,008 INFO L82 PathProgramCache]: Analyzing trace with hash 1211304264, now seen corresponding path program 25 times [2019-08-05 11:18:46,008 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:46,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:46,021 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 28 conjunts are in the unsatisfiable core [2019-08-05 11:18:46,022 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:46,874 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 11:18:46,874 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:46,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 11:18:46,875 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:18:46,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:18:46,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:18:46,876 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 29 states. [2019-08-05 11:18:46,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:46,920 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-08-05 11:18:46,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:18:46,921 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 30 [2019-08-05 11:18:46,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:46,921 INFO L225 Difference]: With dead ends: 32 [2019-08-05 11:18:46,921 INFO L226 Difference]: Without dead ends: 32 [2019-08-05 11:18:46,922 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 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 11:18:46,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-08-05 11:18:46,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-08-05 11:18:46,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-05 11:18:46,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-08-05 11:18:46,925 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2019-08-05 11:18:46,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:46,926 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-08-05 11:18:46,926 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:18:46,926 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-08-05 11:18:46,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-05 11:18:46,926 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:46,927 INFO L399 BasicCegarLoop]: trace histogram [27, 1, 1, 1, 1] [2019-08-05 11:18:46,927 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:46,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:46,927 INFO L82 PathProgramCache]: Analyzing trace with hash -1104335006, now seen corresponding path program 26 times [2019-08-05 11:18:46,928 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:46,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:46,940 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:18:46,942 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:47,410 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 11:18:47,411 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:47,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:18:47,411 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 11:18:47,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 11:18:47,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-08-05 11:18:47,412 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 30 states. [2019-08-05 11:18:47,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:47,479 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-08-05 11:18:47,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 11:18:47,479 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 31 [2019-08-05 11:18:47,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:47,480 INFO L225 Difference]: With dead ends: 33 [2019-08-05 11:18:47,480 INFO L226 Difference]: Without dead ends: 33 [2019-08-05 11:18:47,481 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-08-05 11:18:47,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-08-05 11:18:47,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-08-05 11:18:47,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-05 11:18:47,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-08-05 11:18:47,484 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2019-08-05 11:18:47,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:47,485 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-08-05 11:18:47,485 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 11:18:47,485 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-08-05 11:18:47,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 11:18:47,486 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:47,486 INFO L399 BasicCegarLoop]: trace histogram [28, 1, 1, 1, 1] [2019-08-05 11:18:47,486 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:47,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:47,486 INFO L82 PathProgramCache]: Analyzing trace with hash 125291656, now seen corresponding path program 27 times [2019-08-05 11:18:47,487 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:47,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:47,499 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 30 conjunts are in the unsatisfiable core [2019-08-05 11:18:47,501 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:47,919 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 11:18:47,920 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:47,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-05 11:18:47,920 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-05 11:18:47,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-05 11:18:47,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-08-05 11:18:47,922 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 31 states. [2019-08-05 11:18:47,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:47,973 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-08-05 11:18:47,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 11:18:47,974 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 32 [2019-08-05 11:18:47,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:47,974 INFO L225 Difference]: With dead ends: 34 [2019-08-05 11:18:47,975 INFO L226 Difference]: Without dead ends: 34 [2019-08-05 11:18:47,976 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 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 11:18:47,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-08-05 11:18:47,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-08-05 11:18:47,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-05 11:18:47,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-08-05 11:18:47,978 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2019-08-05 11:18:47,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:47,978 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-08-05 11:18:47,978 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-05 11:18:47,979 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-08-05 11:18:47,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-05 11:18:47,979 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:47,979 INFO L399 BasicCegarLoop]: trace histogram [29, 1, 1, 1, 1] [2019-08-05 11:18:47,980 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:47,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:47,980 INFO L82 PathProgramCache]: Analyzing trace with hash -410987486, now seen corresponding path program 28 times [2019-08-05 11:18:47,980 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:47,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:47,992 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 11:18:47,994 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:48,426 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 11:18:48,427 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:48,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-05 11:18:48,427 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 11:18:48,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 11:18:48,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-08-05 11:18:48,428 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 32 states. [2019-08-05 11:18:48,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:48,633 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-08-05 11:18:48,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-05 11:18:48,634 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 33 [2019-08-05 11:18:48,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:48,634 INFO L225 Difference]: With dead ends: 35 [2019-08-05 11:18:48,634 INFO L226 Difference]: Without dead ends: 35 [2019-08-05 11:18:48,635 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-08-05 11:18:48,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-08-05 11:18:48,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-08-05 11:18:48,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-05 11:18:48,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-08-05 11:18:48,638 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2019-08-05 11:18:48,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:48,638 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-08-05 11:18:48,638 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 11:18:48,638 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-08-05 11:18:48,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-05 11:18:48,639 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:48,639 INFO L399 BasicCegarLoop]: trace histogram [30, 1, 1, 1, 1] [2019-08-05 11:18:48,639 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:48,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:48,639 INFO L82 PathProgramCache]: Analyzing trace with hash 144228296, now seen corresponding path program 29 times [2019-08-05 11:18:48,640 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:48,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:48,652 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 32 conjunts are in the unsatisfiable core [2019-08-05 11:18:48,653 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:49,416 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 11:18:49,417 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:49,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-05 11:18:49,417 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-05 11:18:49,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-05 11:18:49,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 11:18:49,418 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 33 states. [2019-08-05 11:18:49,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:49,471 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-08-05 11:18:49,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-05 11:18:49,472 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 34 [2019-08-05 11:18:49,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:49,472 INFO L225 Difference]: With dead ends: 36 [2019-08-05 11:18:49,472 INFO L226 Difference]: Without dead ends: 36 [2019-08-05 11:18:49,473 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 11:18:49,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-08-05 11:18:49,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-08-05 11:18:49,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-05 11:18:49,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-08-05 11:18:49,477 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2019-08-05 11:18:49,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:49,477 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-08-05 11:18:49,477 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-05 11:18:49,477 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-08-05 11:18:49,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-05 11:18:49,478 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:49,478 INFO L399 BasicCegarLoop]: trace histogram [31, 1, 1, 1, 1] [2019-08-05 11:18:49,478 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:49,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:49,478 INFO L82 PathProgramCache]: Analyzing trace with hash 176048354, now seen corresponding path program 30 times [2019-08-05 11:18:49,479 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:49,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:49,491 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 33 conjunts are in the unsatisfiable core [2019-08-05 11:18:49,493 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:49,928 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 11:18:49,929 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:49,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 11:18:49,929 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 11:18:49,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 11:18:49,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 11:18:49,930 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 34 states. [2019-08-05 11:18:49,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:49,988 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-08-05 11:18:49,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-05 11:18:49,988 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 35 [2019-08-05 11:18:49,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:49,989 INFO L225 Difference]: With dead ends: 37 [2019-08-05 11:18:49,989 INFO L226 Difference]: Without dead ends: 37 [2019-08-05 11:18:49,990 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 11:18:49,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-08-05 11:18:49,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-08-05 11:18:49,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-05 11:18:49,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-08-05 11:18:49,992 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2019-08-05 11:18:49,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:49,992 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-08-05 11:18:49,992 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 11:18:49,993 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-08-05 11:18:49,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-05 11:18:49,993 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:49,993 INFO L399 BasicCegarLoop]: trace histogram [32, 1, 1, 1, 1] [2019-08-05 11:18:49,993 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:49,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:49,994 INFO L82 PathProgramCache]: Analyzing trace with hash 1162470152, now seen corresponding path program 31 times [2019-08-05 11:18:49,994 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:50,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:50,007 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 34 conjunts are in the unsatisfiable core [2019-08-05 11:18:50,008 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:50,453 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 11:18:50,453 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:50,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-05 11:18:50,454 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 11:18:50,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 11:18:50,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 11:18:50,454 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 35 states. [2019-08-05 11:18:50,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:50,497 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-08-05 11:18:50,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 11:18:50,497 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 36 [2019-08-05 11:18:50,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:50,498 INFO L225 Difference]: With dead ends: 38 [2019-08-05 11:18:50,498 INFO L226 Difference]: Without dead ends: 38 [2019-08-05 11:18:50,499 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 11:18:50,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-08-05 11:18:50,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-08-05 11:18:50,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-05 11:18:50,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-08-05 11:18:50,501 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2019-08-05 11:18:50,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:50,502 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-08-05 11:18:50,502 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 11:18:50,502 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-08-05 11:18:50,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-08-05 11:18:50,502 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:50,503 INFO L399 BasicCegarLoop]: trace histogram [33, 1, 1, 1, 1] [2019-08-05 11:18:50,503 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:50,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:50,503 INFO L82 PathProgramCache]: Analyzing trace with hash 1676774818, now seen corresponding path program 32 times [2019-08-05 11:18:50,504 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:50,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:50,515 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 35 conjunts are in the unsatisfiable core [2019-08-05 11:18:50,517 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:50,965 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 11:18:50,965 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:50,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-05 11:18:50,966 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-05 11:18:50,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-05 11:18:50,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 11:18:50,967 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 36 states. [2019-08-05 11:18:51,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:51,038 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-08-05 11:18:51,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-05 11:18:51,038 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 37 [2019-08-05 11:18:51,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:51,039 INFO L225 Difference]: With dead ends: 39 [2019-08-05 11:18:51,039 INFO L226 Difference]: Without dead ends: 39 [2019-08-05 11:18:51,040 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 11:18:51,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-08-05 11:18:51,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-08-05 11:18:51,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-05 11:18:51,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-08-05 11:18:51,043 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2019-08-05 11:18:51,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:51,043 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-08-05 11:18:51,043 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-05 11:18:51,043 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-08-05 11:18:51,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-05 11:18:51,044 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:51,044 INFO L399 BasicCegarLoop]: trace histogram [34, 1, 1, 1, 1] [2019-08-05 11:18:51,044 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:51,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:51,045 INFO L82 PathProgramCache]: Analyzing trace with hash 440350280, now seen corresponding path program 33 times [2019-08-05 11:18:51,045 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:51,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:51,058 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 36 conjunts are in the unsatisfiable core [2019-08-05 11:18:51,059 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:51,769 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 11:18:51,770 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:51,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-05 11:18:51,770 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-05 11:18:51,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-05 11:18:51,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 11:18:51,771 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 37 states. [2019-08-05 11:18:51,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:51,816 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-08-05 11:18:51,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-05 11:18:51,817 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 38 [2019-08-05 11:18:51,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:51,818 INFO L225 Difference]: With dead ends: 40 [2019-08-05 11:18:51,818 INFO L226 Difference]: Without dead ends: 40 [2019-08-05 11:18:51,819 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 11:18:51,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-08-05 11:18:51,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-08-05 11:18:51,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-05 11:18:51,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-08-05 11:18:51,821 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2019-08-05 11:18:51,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:51,821 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-08-05 11:18:51,822 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-05 11:18:51,822 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-08-05 11:18:51,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-08-05 11:18:51,822 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:51,822 INFO L399 BasicCegarLoop]: trace histogram [35, 1, 1, 1, 1] [2019-08-05 11:18:51,822 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:51,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:51,823 INFO L82 PathProgramCache]: Analyzing trace with hash 765895266, now seen corresponding path program 34 times [2019-08-05 11:18:51,823 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:51,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:51,835 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-05 11:18:51,837 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:52,404 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 11:18:52,404 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:52,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-05 11:18:52,405 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-05 11:18:52,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-05 11:18:52,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 11:18:52,406 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 38 states. [2019-08-05 11:18:52,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:52,480 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-08-05 11:18:52,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-05 11:18:52,480 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 39 [2019-08-05 11:18:52,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:52,481 INFO L225 Difference]: With dead ends: 41 [2019-08-05 11:18:52,481 INFO L226 Difference]: Without dead ends: 41 [2019-08-05 11:18:52,482 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 11:18:52,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-08-05 11:18:52,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-08-05 11:18:52,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-05 11:18:52,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-08-05 11:18:52,484 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2019-08-05 11:18:52,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:52,485 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-08-05 11:18:52,485 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-05 11:18:52,485 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-08-05 11:18:52,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 11:18:52,485 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:52,485 INFO L399 BasicCegarLoop]: trace histogram [36, 1, 1, 1, 1] [2019-08-05 11:18:52,486 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:52,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:52,486 INFO L82 PathProgramCache]: Analyzing trace with hash -2027112056, now seen corresponding path program 35 times [2019-08-05 11:18:52,487 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:52,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:52,499 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 38 conjunts are in the unsatisfiable core [2019-08-05 11:18:52,500 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:55,266 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 11:18:55,267 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:55,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-05 11:18:55,267 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-05 11:18:55,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-05 11:18:55,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 11:18:55,268 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 39 states. [2019-08-05 11:18:55,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:55,321 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-08-05 11:18:55,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-05 11:18:55,322 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 40 [2019-08-05 11:18:55,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:55,322 INFO L225 Difference]: With dead ends: 42 [2019-08-05 11:18:55,323 INFO L226 Difference]: Without dead ends: 42 [2019-08-05 11:18:55,324 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 11:18:55,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-08-05 11:18:55,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-08-05 11:18:55,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-05 11:18:55,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-08-05 11:18:55,326 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2019-08-05 11:18:55,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:55,326 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-08-05 11:18:55,327 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-05 11:18:55,327 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-08-05 11:18:55,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-08-05 11:18:55,327 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:55,327 INFO L399 BasicCegarLoop]: trace histogram [37, 1, 1, 1, 1] [2019-08-05 11:18:55,328 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:55,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:55,328 INFO L82 PathProgramCache]: Analyzing trace with hash 1583974178, now seen corresponding path program 36 times [2019-08-05 11:18:55,329 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:55,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:55,341 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 39 conjunts are in the unsatisfiable core [2019-08-05 11:18:55,342 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:55,952 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 11:18:55,952 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:55,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-05 11:18:55,953 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-05 11:18:55,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-05 11:18:55,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 11:18:55,954 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 40 states. [2019-08-05 11:18:56,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:56,005 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-08-05 11:18:56,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-05 11:18:56,006 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 41 [2019-08-05 11:18:56,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:56,006 INFO L225 Difference]: With dead ends: 43 [2019-08-05 11:18:56,006 INFO L226 Difference]: Without dead ends: 43 [2019-08-05 11:18:56,007 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 11:18:56,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-08-05 11:18:56,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-08-05 11:18:56,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-05 11:18:56,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-08-05 11:18:56,010 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2019-08-05 11:18:56,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:56,010 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-08-05 11:18:56,010 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-05 11:18:56,010 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-08-05 11:18:56,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-05 11:18:56,010 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:56,010 INFO L399 BasicCegarLoop]: trace histogram [38, 1, 1, 1, 1] [2019-08-05 11:18:56,011 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:56,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:56,011 INFO L82 PathProgramCache]: Analyzing trace with hash 1858497736, now seen corresponding path program 37 times [2019-08-05 11:18:56,011 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:56,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:56,024 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 40 conjunts are in the unsatisfiable core [2019-08-05 11:18:56,025 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:56,647 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 11:18:56,647 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:56,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-05 11:18:56,647 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-05 11:18:56,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-05 11:18:56,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:18:56,648 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 41 states. [2019-08-05 11:18:56,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:56,697 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-08-05 11:18:56,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-05 11:18:56,697 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 42 [2019-08-05 11:18:56,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:56,698 INFO L225 Difference]: With dead ends: 44 [2019-08-05 11:18:56,698 INFO L226 Difference]: Without dead ends: 44 [2019-08-05 11:18:56,699 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:18:56,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-08-05 11:18:56,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-08-05 11:18:56,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-05 11:18:56,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-08-05 11:18:56,701 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2019-08-05 11:18:56,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:56,701 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-08-05 11:18:56,701 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-05 11:18:56,701 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-08-05 11:18:56,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-08-05 11:18:56,702 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:56,702 INFO L399 BasicCegarLoop]: trace histogram [39, 1, 1, 1, 1] [2019-08-05 11:18:56,702 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:56,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:56,702 INFO L82 PathProgramCache]: Analyzing trace with hash 1778793442, now seen corresponding path program 38 times [2019-08-05 11:18:56,703 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:56,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:56,715 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 41 conjunts are in the unsatisfiable core [2019-08-05 11:18:56,716 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:57,377 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 11:18:57,378 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:57,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-05 11:18:57,378 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-05 11:18:57,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-05 11:18:57,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 11:18:57,379 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 42 states. [2019-08-05 11:18:57,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:57,455 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-08-05 11:18:57,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-05 11:18:57,456 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 43 [2019-08-05 11:18:57,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:57,457 INFO L225 Difference]: With dead ends: 45 [2019-08-05 11:18:57,457 INFO L226 Difference]: Without dead ends: 45 [2019-08-05 11:18:57,458 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 11:18:57,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-05 11:18:57,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-08-05 11:18:57,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-05 11:18:57,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-08-05 11:18:57,460 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2019-08-05 11:18:57,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:57,460 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-08-05 11:18:57,460 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-05 11:18:57,460 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-08-05 11:18:57,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-08-05 11:18:57,460 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:57,461 INFO L399 BasicCegarLoop]: trace histogram [40, 1, 1, 1, 1] [2019-08-05 11:18:57,461 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:57,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:57,461 INFO L82 PathProgramCache]: Analyzing trace with hash -692039672, now seen corresponding path program 39 times [2019-08-05 11:18:57,462 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:57,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:57,475 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 42 conjunts are in the unsatisfiable core [2019-08-05 11:18:57,476 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:58,242 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 11:18:58,242 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:58,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-05 11:18:58,243 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-05 11:18:58,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-05 11:18:58,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 11:18:58,244 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 43 states. [2019-08-05 11:18:58,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:58,301 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-08-05 11:18:58,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-05 11:18:58,301 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 44 [2019-08-05 11:18:58,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:58,302 INFO L225 Difference]: With dead ends: 46 [2019-08-05 11:18:58,302 INFO L226 Difference]: Without dead ends: 46 [2019-08-05 11:18:58,303 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 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 11:18:58,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-08-05 11:18:58,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-08-05 11:18:58,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-05 11:18:58,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-08-05 11:18:58,305 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2019-08-05 11:18:58,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:58,305 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-08-05 11:18:58,305 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-05 11:18:58,305 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-08-05 11:18:58,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-08-05 11:18:58,305 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:58,306 INFO L399 BasicCegarLoop]: trace histogram [41, 1, 1, 1, 1] [2019-08-05 11:18:58,306 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:58,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:58,306 INFO L82 PathProgramCache]: Analyzing trace with hash 21545122, now seen corresponding path program 40 times [2019-08-05 11:18:58,307 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:58,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:58,319 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 43 conjunts are in the unsatisfiable core [2019-08-05 11:18:58,321 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:59,393 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 11:18:59,394 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:59,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-05 11:18:59,394 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-05 11:18:59,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-05 11:18:59,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 11:18:59,396 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 44 states. [2019-08-05 11:18:59,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:59,491 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-08-05 11:18:59,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-05 11:18:59,491 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 45 [2019-08-05 11:18:59,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:59,492 INFO L225 Difference]: With dead ends: 47 [2019-08-05 11:18:59,492 INFO L226 Difference]: Without dead ends: 47 [2019-08-05 11:18:59,494 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 11:18:59,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-08-05 11:18:59,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-08-05 11:18:59,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-08-05 11:18:59,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-08-05 11:18:59,496 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2019-08-05 11:18:59,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:59,496 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-08-05 11:18:59,496 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-05 11:18:59,496 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-08-05 11:18:59,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-08-05 11:18:59,496 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:59,496 INFO L399 BasicCegarLoop]: trace histogram [42, 1, 1, 1, 1] [2019-08-05 11:18:59,497 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:59,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:59,497 INFO L82 PathProgramCache]: Analyzing trace with hash 667837256, now seen corresponding path program 41 times [2019-08-05 11:18:59,497 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:59,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:59,508 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 44 conjunts are in the unsatisfiable core [2019-08-05 11:18:59,509 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:19:00,354 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 11:19:00,354 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:19:00,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-05 11:19:00,354 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-05 11:19:00,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-05 11:19:00,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 11:19:00,356 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 45 states. [2019-08-05 11:19:00,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:19:00,443 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-08-05 11:19:00,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-05 11:19:00,443 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 46 [2019-08-05 11:19:00,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:19:00,444 INFO L225 Difference]: With dead ends: 48 [2019-08-05 11:19:00,444 INFO L226 Difference]: Without dead ends: 48 [2019-08-05 11:19:00,445 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 11:19:00,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-08-05 11:19:00,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-08-05 11:19:00,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-05 11:19:00,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-08-05 11:19:00,449 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2019-08-05 11:19:00,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:19:00,449 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-08-05 11:19:00,449 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-05 11:19:00,449 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-08-05 11:19:00,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 11:19:00,450 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:19:00,450 INFO L399 BasicCegarLoop]: trace histogram [43, 1, 1, 1, 1] [2019-08-05 11:19:00,450 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:19:00,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:19:00,450 INFO L82 PathProgramCache]: Analyzing trace with hash -771943070, now seen corresponding path program 42 times [2019-08-05 11:19:00,451 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:19:00,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:19:00,465 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 45 conjunts are in the unsatisfiable core [2019-08-05 11:19:00,466 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:19:01,245 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 11:19:01,246 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:19:01,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-05 11:19:01,246 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-05 11:19:01,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-05 11:19:01,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 11:19:01,247 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 46 states. [2019-08-05 11:19:01,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:19:01,325 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-08-05 11:19:01,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-05 11:19:01,326 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 47 [2019-08-05 11:19:01,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:19:01,327 INFO L225 Difference]: With dead ends: 49 [2019-08-05 11:19:01,327 INFO L226 Difference]: Without dead ends: 49 [2019-08-05 11:19:01,328 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 11:19:01,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-08-05 11:19:01,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-08-05 11:19:01,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-08-05 11:19:01,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-08-05 11:19:01,330 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2019-08-05 11:19:01,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:19:01,330 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-08-05 11:19:01,330 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-05 11:19:01,331 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-08-05 11:19:01,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-08-05 11:19:01,331 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:19:01,331 INFO L399 BasicCegarLoop]: trace histogram [44, 1, 1, 1, 1] [2019-08-05 11:19:01,331 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:19:01,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:19:01,332 INFO L82 PathProgramCache]: Analyzing trace with hash 1839507080, now seen corresponding path program 43 times [2019-08-05 11:19:01,332 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:19:01,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:19:01,345 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 46 conjunts are in the unsatisfiable core [2019-08-05 11:19:01,346 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:19:02,164 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 11:19:02,164 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:19:02,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-05 11:19:02,164 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-05 11:19:02,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-05 11:19:02,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 11:19:02,165 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 47 states. [2019-08-05 11:19:02,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:19:02,291 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-08-05 11:19:02,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-05 11:19:02,292 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 48 [2019-08-05 11:19:02,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:19:02,292 INFO L225 Difference]: With dead ends: 50 [2019-08-05 11:19:02,293 INFO L226 Difference]: Without dead ends: 50 [2019-08-05 11:19:02,293 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 2 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 11:19:02,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-08-05 11:19:02,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-08-05 11:19:02,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-08-05 11:19:02,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-08-05 11:19:02,294 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2019-08-05 11:19:02,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:19:02,295 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2019-08-05 11:19:02,295 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-05 11:19:02,295 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-08-05 11:19:02,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-08-05 11:19:02,295 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:19:02,295 INFO L399 BasicCegarLoop]: trace histogram [45, 1, 1, 1, 1] [2019-08-05 11:19:02,296 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:19:02,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:19:02,296 INFO L82 PathProgramCache]: Analyzing trace with hash 1190083106, now seen corresponding path program 44 times [2019-08-05 11:19:02,296 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:19:02,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:19:02,309 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 47 conjunts are in the unsatisfiable core [2019-08-05 11:19:02,310 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:19:03,325 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 11:19:03,325 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:19:03,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-05 11:19:03,326 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-05 11:19:03,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-05 11:19:03,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 11:19:03,326 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 48 states. [2019-08-05 11:19:03,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:19:03,578 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-08-05 11:19:03,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-05 11:19:03,578 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 49 [2019-08-05 11:19:03,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:19:03,579 INFO L225 Difference]: With dead ends: 51 [2019-08-05 11:19:03,579 INFO L226 Difference]: Without dead ends: 51 [2019-08-05 11:19:03,580 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 2 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 11:19:03,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-05 11:19:03,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-08-05 11:19:03,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-08-05 11:19:03,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-08-05 11:19:03,583 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2019-08-05 11:19:03,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:19:03,583 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-08-05 11:19:03,583 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-05 11:19:03,583 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-08-05 11:19:03,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-08-05 11:19:03,584 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:19:03,584 INFO L399 BasicCegarLoop]: trace histogram [46, 1, 1, 1, 1] [2019-08-05 11:19:03,584 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:19:03,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:19:03,584 INFO L82 PathProgramCache]: Analyzing trace with hash -1762190904, now seen corresponding path program 45 times [2019-08-05 11:19:03,585 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:19:03,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:19:03,598 INFO L256 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 48 conjunts are in the unsatisfiable core [2019-08-05 11:19:03,599 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:19:04,745 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 11:19:04,745 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:19:04,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-08-05 11:19:04,745 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-05 11:19:04,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-05 11:19:04,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 11:19:04,746 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 49 states. [2019-08-05 11:19:04,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:19:04,817 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-08-05 11:19:04,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-08-05 11:19:04,819 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 50 [2019-08-05 11:19:04,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:19:04,819 INFO L225 Difference]: With dead ends: 52 [2019-08-05 11:19:04,819 INFO L226 Difference]: Without dead ends: 52 [2019-08-05 11:19:04,820 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 11:19:04,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-08-05 11:19:04,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-08-05 11:19:04,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-05 11:19:04,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-08-05 11:19:04,822 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2019-08-05 11:19:04,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:19:04,822 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-08-05 11:19:04,822 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-05 11:19:04,822 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-08-05 11:19:04,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-08-05 11:19:04,822 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:19:04,823 INFO L399 BasicCegarLoop]: trace histogram [47, 1, 1, 1, 1] [2019-08-05 11:19:04,823 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:19:04,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:19:04,823 INFO L82 PathProgramCache]: Analyzing trace with hash 1206595298, now seen corresponding path program 46 times [2019-08-05 11:19:04,824 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:19:04,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:19:04,837 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 49 conjunts are in the unsatisfiable core [2019-08-05 11:19:04,838 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:19:05,854 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 11:19:05,854 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:19:05,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-05 11:19:05,855 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-05 11:19:05,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-05 11:19:05,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 11:19:05,855 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 50 states. [2019-08-05 11:19:05,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:19:05,929 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-08-05 11:19:05,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-05 11:19:05,930 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 51 [2019-08-05 11:19:05,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:19:05,931 INFO L225 Difference]: With dead ends: 53 [2019-08-05 11:19:05,931 INFO L226 Difference]: Without dead ends: 53 [2019-08-05 11:19:05,932 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 11:19:05,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-08-05 11:19:05,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-08-05 11:19:05,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-08-05 11:19:05,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-08-05 11:19:05,935 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2019-08-05 11:19:05,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:19:05,935 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-08-05 11:19:05,935 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-05 11:19:05,935 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-08-05 11:19:05,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-08-05 11:19:05,936 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:19:05,936 INFO L399 BasicCegarLoop]: trace histogram [48, 1, 1, 1, 1] [2019-08-05 11:19:05,936 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:19:05,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:19:05,936 INFO L82 PathProgramCache]: Analyzing trace with hash -1250312952, now seen corresponding path program 47 times [2019-08-05 11:19:05,937 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:19:05,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:19:05,951 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 50 conjunts are in the unsatisfiable core [2019-08-05 11:19:05,952 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:19:07,103 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 11:19:07,103 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:19:07,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-08-05 11:19:07,103 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-05 11:19:07,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-05 11:19:07,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 11:19:07,104 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 51 states. [2019-08-05 11:19:07,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:19:07,188 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-08-05 11:19:07,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-05 11:19:07,189 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 52 [2019-08-05 11:19:07,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:19:07,190 INFO L225 Difference]: With dead ends: 54 [2019-08-05 11:19:07,190 INFO L226 Difference]: Without dead ends: 54 [2019-08-05 11:19:07,190 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 11:19:07,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-05 11:19:07,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-08-05 11:19:07,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-08-05 11:19:07,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2019-08-05 11:19:07,193 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2019-08-05 11:19:07,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:19:07,193 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2019-08-05 11:19:07,193 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-08-05 11:19:07,193 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2019-08-05 11:19:07,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-08-05 11:19:07,194 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:19:07,194 INFO L399 BasicCegarLoop]: trace histogram [49, 1, 1, 1, 1] [2019-08-05 11:19:07,194 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:19:07,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:19:07,195 INFO L82 PathProgramCache]: Analyzing trace with hash -105057374, now seen corresponding path program 48 times [2019-08-05 11:19:07,195 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:19:07,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:19:07,209 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 51 conjunts are in the unsatisfiable core [2019-08-05 11:19:07,211 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:19:08,175 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 11:19:08,175 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:19:08,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-05 11:19:08,175 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-05 11:19:08,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-05 11:19:08,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 11:19:08,176 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 52 states. [2019-08-05 11:19:08,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:19:08,254 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-08-05 11:19:08,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-05 11:19:08,255 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 53 [2019-08-05 11:19:08,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:19:08,256 INFO L225 Difference]: With dead ends: 55 [2019-08-05 11:19:08,256 INFO L226 Difference]: Without dead ends: 55 [2019-08-05 11:19:08,257 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 11:19:08,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-08-05 11:19:08,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-08-05 11:19:08,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-08-05 11:19:08,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-08-05 11:19:08,258 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2019-08-05 11:19:08,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:19:08,258 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-08-05 11:19:08,259 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-05 11:19:08,259 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-08-05 11:19:08,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:19:08,259 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:19:08,259 INFO L399 BasicCegarLoop]: trace histogram [50, 1, 1, 1, 1] [2019-08-05 11:19:08,259 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:19:08,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:19:08,260 INFO L82 PathProgramCache]: Analyzing trace with hash 1038127176, now seen corresponding path program 49 times [2019-08-05 11:19:08,260 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:19:08,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:19:08,274 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 52 conjunts are in the unsatisfiable core [2019-08-05 11:19:08,276 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:19:09,644 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 11:19:09,644 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:19:09,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-08-05 11:19:09,645 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-08-05 11:19:09,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-08-05 11:19:09,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 11:19:09,645 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 53 states. [2019-08-05 11:19:09,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:19:09,739 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-08-05 11:19:09,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-08-05 11:19:09,739 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 54 [2019-08-05 11:19:09,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:19:09,740 INFO L225 Difference]: With dead ends: 56 [2019-08-05 11:19:09,740 INFO L226 Difference]: Without dead ends: 56 [2019-08-05 11:19:09,741 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 11:19:09,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-08-05 11:19:09,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-08-05 11:19:09,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-08-05 11:19:09,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-08-05 11:19:09,743 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2019-08-05 11:19:09,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:19:09,743 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-08-05 11:19:09,744 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-08-05 11:19:09,744 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-08-05 11:19:09,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-08-05 11:19:09,744 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:19:09,744 INFO L399 BasicCegarLoop]: trace histogram [51, 1, 1, 1, 1] [2019-08-05 11:19:09,744 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:19:09,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:19:09,744 INFO L82 PathProgramCache]: Analyzing trace with hash 2117109858, now seen corresponding path program 50 times [2019-08-05 11:19:09,745 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:19:09,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:19:09,760 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 53 conjunts are in the unsatisfiable core [2019-08-05 11:19:09,761 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:19:11,295 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 11:19:11,296 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:19:11,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-05 11:19:11,296 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-08-05 11:19:11,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-08-05 11:19:11,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 11:19:11,297 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 54 states. [2019-08-05 11:19:11,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:19:11,407 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-08-05 11:19:11,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-05 11:19:11,408 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 55 [2019-08-05 11:19:11,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:19:11,409 INFO L225 Difference]: With dead ends: 57 [2019-08-05 11:19:11,409 INFO L226 Difference]: Without dead ends: 57 [2019-08-05 11:19:11,410 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 11:19:11,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-05 11:19:11,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-08-05 11:19:11,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-08-05 11:19:11,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-08-05 11:19:11,412 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2019-08-05 11:19:11,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:19:11,412 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-08-05 11:19:11,412 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-08-05 11:19:11,412 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-08-05 11:19:11,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-08-05 11:19:11,413 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:19:11,413 INFO L399 BasicCegarLoop]: trace histogram [52, 1, 1, 1, 1] [2019-08-05 11:19:11,413 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:19:11,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:19:11,413 INFO L82 PathProgramCache]: Analyzing trace with hash 1205834632, now seen corresponding path program 51 times [2019-08-05 11:19:11,414 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:19:11,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:19:11,428 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 54 conjunts are in the unsatisfiable core [2019-08-05 11:19:11,429 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:19:12,489 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 11:19:12,489 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:19:12,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-08-05 11:19:12,490 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-08-05 11:19:12,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-08-05 11:19:12,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 11:19:12,491 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 55 states. [2019-08-05 11:19:12,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:19:12,590 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-08-05 11:19:12,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-05 11:19:12,590 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 56 [2019-08-05 11:19:12,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:19:12,591 INFO L225 Difference]: With dead ends: 58 [2019-08-05 11:19:12,591 INFO L226 Difference]: Without dead ends: 58 [2019-08-05 11:19:12,592 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 11:19:12,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-08-05 11:19:12,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-08-05 11:19:12,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-08-05 11:19:12,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-08-05 11:19:12,595 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2019-08-05 11:19:12,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:19:12,595 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-08-05 11:19:12,595 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-08-05 11:19:12,596 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-08-05 11:19:12,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-08-05 11:19:12,596 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:19:12,596 INFO L399 BasicCegarLoop]: trace histogram [53, 1, 1, 1, 1] [2019-08-05 11:19:12,596 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:19:12,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:19:12,597 INFO L82 PathProgramCache]: Analyzing trace with hash -1273893598, now seen corresponding path program 52 times [2019-08-05 11:19:12,597 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:19:12,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:19:12,611 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 55 conjunts are in the unsatisfiable core [2019-08-05 11:19:12,612 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:19:13,725 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 11:19:13,725 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:19:13,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-08-05 11:19:13,726 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-08-05 11:19:13,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-08-05 11:19:13,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 11:19:13,726 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 56 states. [2019-08-05 11:19:13,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:19:13,812 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-08-05 11:19:13,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-08-05 11:19:13,813 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 57 [2019-08-05 11:19:13,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:19:13,814 INFO L225 Difference]: With dead ends: 59 [2019-08-05 11:19:13,814 INFO L226 Difference]: Without dead ends: 59 [2019-08-05 11:19:13,814 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 11:19:13,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-08-05 11:19:13,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-08-05 11:19:13,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-08-05 11:19:13,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2019-08-05 11:19:13,817 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2019-08-05 11:19:13,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:19:13,817 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2019-08-05 11:19:13,817 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-08-05 11:19:13,817 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2019-08-05 11:19:13,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-08-05 11:19:13,818 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:19:13,818 INFO L399 BasicCegarLoop]: trace histogram [54, 1, 1, 1, 1] [2019-08-05 11:19:13,818 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:19:13,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:19:13,818 INFO L82 PathProgramCache]: Analyzing trace with hash -836057400, now seen corresponding path program 53 times [2019-08-05 11:19:13,818 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:19:13,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:19:13,833 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 56 conjunts are in the unsatisfiable core [2019-08-05 11:19:13,834 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:19:15,236 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 11:19:15,236 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:19:15,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2019-08-05 11:19:15,236 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-08-05 11:19:15,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-08-05 11:19:15,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 11:19:15,237 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 57 states. [2019-08-05 11:19:15,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:19:15,310 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-08-05 11:19:15,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-08-05 11:19:15,311 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 58 [2019-08-05 11:19:15,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:19:15,312 INFO L225 Difference]: With dead ends: 60 [2019-08-05 11:19:15,312 INFO L226 Difference]: Without dead ends: 60 [2019-08-05 11:19:15,313 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 2 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 11:19:15,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-05 11:19:15,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-08-05 11:19:15,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-08-05 11:19:15,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2019-08-05 11:19:15,315 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2019-08-05 11:19:15,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:19:15,316 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2019-08-05 11:19:15,316 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-08-05 11:19:15,316 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2019-08-05 11:19:15,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-08-05 11:19:15,316 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:19:15,316 INFO L399 BasicCegarLoop]: trace histogram [55, 1, 1, 1, 1] [2019-08-05 11:19:15,317 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:19:15,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:19:15,317 INFO L82 PathProgramCache]: Analyzing trace with hash -148037150, now seen corresponding path program 54 times [2019-08-05 11:19:15,317 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:19:15,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:19:15,331 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 57 conjunts are in the unsatisfiable core [2019-08-05 11:19:15,333 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:19:16,490 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 11:19:16,490 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:19:16,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-08-05 11:19:16,490 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-08-05 11:19:16,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-08-05 11:19:16,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 11:19:16,491 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 58 states. [2019-08-05 11:19:16,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:19:16,596 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-08-05 11:19:16,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-08-05 11:19:16,597 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 59 [2019-08-05 11:19:16,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:19:16,598 INFO L225 Difference]: With dead ends: 61 [2019-08-05 11:19:16,598 INFO L226 Difference]: Without dead ends: 61 [2019-08-05 11:19:16,598 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 11:19:16,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-08-05 11:19:16,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-08-05 11:19:16,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-08-05 11:19:16,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-08-05 11:19:16,601 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2019-08-05 11:19:16,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:19:16,602 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-08-05 11:19:16,602 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-08-05 11:19:16,602 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-08-05 11:19:16,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-08-05 11:19:16,602 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:19:16,602 INFO L399 BasicCegarLoop]: trace histogram [56, 1, 1, 1, 1] [2019-08-05 11:19:16,603 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:19:16,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:19:16,603 INFO L82 PathProgramCache]: Analyzing trace with hash -294245880, now seen corresponding path program 55 times [2019-08-05 11:19:16,603 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:19:16,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:19:16,618 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 58 conjunts are in the unsatisfiable core [2019-08-05 11:19:16,619 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:19:17,950 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 11:19:17,950 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:19:17,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2019-08-05 11:19:17,950 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-08-05 11:19:17,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-08-05 11:19:17,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 11:19:17,951 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 59 states. [2019-08-05 11:19:18,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:19:18,047 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-08-05 11:19:18,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-08-05 11:19:18,047 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 60 [2019-08-05 11:19:18,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:19:18,048 INFO L225 Difference]: With dead ends: 62 [2019-08-05 11:19:18,048 INFO L226 Difference]: Without dead ends: 62 [2019-08-05 11:19:18,049 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 11:19:18,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-08-05 11:19:18,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-08-05 11:19:18,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-08-05 11:19:18,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2019-08-05 11:19:18,051 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2019-08-05 11:19:18,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:19:18,052 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2019-08-05 11:19:18,052 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-08-05 11:19:18,052 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-08-05 11:19:18,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:19:18,052 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:19:18,052 INFO L399 BasicCegarLoop]: trace histogram [57, 1, 1, 1, 1] [2019-08-05 11:19:18,053 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:19:18,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:19:18,053 INFO L82 PathProgramCache]: Analyzing trace with hash -531749214, now seen corresponding path program 56 times [2019-08-05 11:19:18,054 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:19:18,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:19:18,071 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 59 conjunts are in the unsatisfiable core [2019-08-05 11:19:18,072 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:19:19,615 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 11:19:19,616 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:19:19,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2019-08-05 11:19:19,616 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-08-05 11:19:19,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-08-05 11:19:19,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 11:19:19,617 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 60 states. [2019-08-05 11:19:19,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:19:19,779 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-08-05 11:19:19,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-08-05 11:19:19,780 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 61 [2019-08-05 11:19:19,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:19:19,780 INFO L225 Difference]: With dead ends: 63 [2019-08-05 11:19:19,780 INFO L226 Difference]: Without dead ends: 63 [2019-08-05 11:19:19,781 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 11:19:19,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-05 11:19:19,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-08-05 11:19:19,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-08-05 11:19:19,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2019-08-05 11:19:19,782 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2019-08-05 11:19:19,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:19:19,783 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2019-08-05 11:19:19,783 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-08-05 11:19:19,783 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2019-08-05 11:19:19,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-08-05 11:19:19,783 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:19:19,783 INFO L399 BasicCegarLoop]: trace histogram [58, 1, 1, 1, 1] [2019-08-05 11:19:19,784 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:19:19,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:19:19,784 INFO L82 PathProgramCache]: Analyzing trace with hash 695582024, now seen corresponding path program 57 times [2019-08-05 11:19:19,784 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:19:19,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:19:19,797 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 60 conjunts are in the unsatisfiable core [2019-08-05 11:19:19,799 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:19:21,185 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 11:19:21,185 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:19:21,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2019-08-05 11:19:21,186 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-08-05 11:19:21,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-08-05 11:19:21,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 11:19:21,186 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 61 states. [2019-08-05 11:19:21,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:19:21,275 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2019-08-05 11:19:21,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-08-05 11:19:21,275 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 62 [2019-08-05 11:19:21,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:19:21,276 INFO L225 Difference]: With dead ends: 64 [2019-08-05 11:19:21,276 INFO L226 Difference]: Without dead ends: 64 [2019-08-05 11:19:21,277 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 11:19:21,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-08-05 11:19:21,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-08-05 11:19:21,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-08-05 11:19:21,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2019-08-05 11:19:21,279 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2019-08-05 11:19:21,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:19:21,279 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2019-08-05 11:19:21,279 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-08-05 11:19:21,279 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2019-08-05 11:19:21,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-08-05 11:19:21,280 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:19:21,280 INFO L399 BasicCegarLoop]: trace histogram [59, 1, 1, 1, 1] [2019-08-05 11:19:21,280 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:19:21,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:19:21,280 INFO L82 PathProgramCache]: Analyzing trace with hash 88144738, now seen corresponding path program 58 times [2019-08-05 11:19:21,281 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:19:21,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:19:21,296 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 61 conjunts are in the unsatisfiable core [2019-08-05 11:19:21,298 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:19:22,683 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 11:19:22,684 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:19:22,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2019-08-05 11:19:22,684 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-08-05 11:19:22,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-08-05 11:19:22,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 11:19:22,685 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 62 states. [2019-08-05 11:19:22,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:19:22,774 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-08-05 11:19:22,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-08-05 11:19:22,774 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 63 [2019-08-05 11:19:22,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:19:22,775 INFO L225 Difference]: With dead ends: 65 [2019-08-05 11:19:22,775 INFO L226 Difference]: Without dead ends: 65 [2019-08-05 11:19:22,776 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 11:19:22,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-08-05 11:19:22,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-08-05 11:19:22,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-08-05 11:19:22,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-08-05 11:19:22,778 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2019-08-05 11:19:22,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:19:22,778 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-08-05 11:19:22,778 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-08-05 11:19:22,779 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-08-05 11:19:22,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-08-05 11:19:22,779 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:19:22,779 INFO L399 BasicCegarLoop]: trace histogram [60, 1, 1, 1, 1] [2019-08-05 11:19:22,779 INFO L418 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:19:22,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:19:22,779 INFO L82 PathProgramCache]: Analyzing trace with hash -1562541944, now seen corresponding path program 59 times [2019-08-05 11:19:22,780 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:19:22,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:19:22,795 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 62 conjunts are in the unsatisfiable core [2019-08-05 11:19:22,797 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:19:24,152 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 11:19:24,153 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:19:24,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2019-08-05 11:19:24,153 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-08-05 11:19:24,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-08-05 11:19:24,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 11:19:24,154 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 63 states. [2019-08-05 11:19:24,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:19:24,246 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-08-05 11:19:24,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-08-05 11:19:24,247 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 64 [2019-08-05 11:19:24,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:19:24,248 INFO L225 Difference]: With dead ends: 66 [2019-08-05 11:19:24,248 INFO L226 Difference]: Without dead ends: 66 [2019-08-05 11:19:24,248 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 11:19:24,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-05 11:19:24,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-08-05 11:19:24,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-08-05 11:19:24,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2019-08-05 11:19:24,251 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2019-08-05 11:19:24,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:19:24,251 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2019-08-05 11:19:24,251 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-08-05 11:19:24,251 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-08-05 11:19:24,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-08-05 11:19:24,252 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:19:24,252 INFO L399 BasicCegarLoop]: trace histogram [61, 1, 1, 1, 1] [2019-08-05 11:19:24,252 INFO L418 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:19:24,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:19:24,253 INFO L82 PathProgramCache]: Analyzing trace with hash -1194221534, now seen corresponding path program 60 times [2019-08-05 11:19:24,253 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:19:24,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:19:24,268 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 63 conjunts are in the unsatisfiable core [2019-08-05 11:19:24,270 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:19:26,168 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 11:19:26,168 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:19:26,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2019-08-05 11:19:26,168 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-08-05 11:19:26,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-08-05 11:19:26,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 11:19:26,169 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 64 states. [2019-08-05 11:19:26,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:19:26,259 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2019-08-05 11:19:26,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-08-05 11:19:26,259 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 65 [2019-08-05 11:19:26,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:19:26,260 INFO L225 Difference]: With dead ends: 67 [2019-08-05 11:19:26,260 INFO L226 Difference]: Without dead ends: 67 [2019-08-05 11:19:26,261 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 11:19:26,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-08-05 11:19:26,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-08-05 11:19:26,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-08-05 11:19:26,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-08-05 11:19:26,263 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2019-08-05 11:19:26,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:19:26,263 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2019-08-05 11:19:26,263 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-08-05 11:19:26,263 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-08-05 11:19:26,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-08-05 11:19:26,263 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:19:26,264 INFO L399 BasicCegarLoop]: trace histogram [62, 1, 1, 1, 1] [2019-08-05 11:19:26,264 INFO L418 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:19:26,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:19:26,264 INFO L82 PathProgramCache]: Analyzing trace with hash 1633776584, now seen corresponding path program 61 times [2019-08-05 11:19:26,265 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:19:26,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:19:26,277 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 64 conjunts are in the unsatisfiable core [2019-08-05 11:19:26,279 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:19:27,700 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 11:19:27,701 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:19:27,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2019-08-05 11:19:27,701 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-08-05 11:19:27,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-08-05 11:19:27,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 11:19:27,702 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 65 states. [2019-08-05 11:19:27,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:19:27,802 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-08-05 11:19:27,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-08-05 11:19:27,802 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 66 [2019-08-05 11:19:27,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:19:27,803 INFO L225 Difference]: With dead ends: 68 [2019-08-05 11:19:27,804 INFO L226 Difference]: Without dead ends: 68 [2019-08-05 11:19:27,804 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 11:19:27,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-08-05 11:19:27,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-08-05 11:19:27,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-08-05 11:19:27,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2019-08-05 11:19:27,807 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2019-08-05 11:19:27,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:19:27,807 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2019-08-05 11:19:27,807 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-08-05 11:19:27,807 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2019-08-05 11:19:27,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-08-05 11:19:27,808 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:19:27,808 INFO L399 BasicCegarLoop]: trace histogram [63, 1, 1, 1, 1] [2019-08-05 11:19:27,808 INFO L418 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:19:27,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:19:27,809 INFO L82 PathProgramCache]: Analyzing trace with hash -892594974, now seen corresponding path program 62 times [2019-08-05 11:19:27,809 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:19:27,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:19:27,834 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 65 conjunts are in the unsatisfiable core [2019-08-05 11:19:27,836 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:19:29,370 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 11:19:29,370 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:19:29,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2019-08-05 11:19:29,370 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-08-05 11:19:29,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-08-05 11:19:29,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 11:19:29,371 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 66 states. [2019-08-05 11:19:29,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:19:29,474 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2019-08-05 11:19:29,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-08-05 11:19:29,475 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 67 [2019-08-05 11:19:29,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:19:29,476 INFO L225 Difference]: With dead ends: 69 [2019-08-05 11:19:29,476 INFO L226 Difference]: Without dead ends: 69 [2019-08-05 11:19:29,476 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 11:19:29,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-05 11:19:29,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-08-05 11:19:29,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-05 11:19:29,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2019-08-05 11:19:29,479 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2019-08-05 11:19:29,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:19:29,480 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2019-08-05 11:19:29,480 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-08-05 11:19:29,480 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2019-08-05 11:19:29,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:19:29,480 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:19:29,480 INFO L399 BasicCegarLoop]: trace histogram [64, 1, 1, 1, 1] [2019-08-05 11:19:29,481 INFO L418 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:19:29,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:19:29,481 INFO L82 PathProgramCache]: Analyzing trace with hash -1900701944, now seen corresponding path program 63 times [2019-08-05 11:19:29,481 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:19:29,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:19:29,496 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 66 conjunts are in the unsatisfiable core [2019-08-05 11:19:29,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:19:31,280 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 11:19:31,280 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:19:31,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2019-08-05 11:19:31,281 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-08-05 11:19:31,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-08-05 11:19:31,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 11:19:31,282 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 67 states. [2019-08-05 11:19:31,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:19:31,410 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-08-05 11:19:31,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-08-05 11:19:31,411 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 68 [2019-08-05 11:19:31,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:19:31,412 INFO L225 Difference]: With dead ends: 70 [2019-08-05 11:19:31,412 INFO L226 Difference]: Without dead ends: 70 [2019-08-05 11:19:31,413 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 11:19:31,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-08-05 11:19:31,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-08-05 11:19:31,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-08-05 11:19:31,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2019-08-05 11:19:31,415 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2019-08-05 11:19:31,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:19:31,415 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2019-08-05 11:19:31,415 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-08-05 11:19:31,415 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2019-08-05 11:19:31,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-08-05 11:19:31,416 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:19:31,416 INFO L399 BasicCegarLoop]: trace histogram [65, 1, 1, 1, 1] [2019-08-05 11:19:31,416 INFO L418 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:19:31,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:19:31,416 INFO L82 PathProgramCache]: Analyzing trace with hash 1207720354, now seen corresponding path program 64 times [2019-08-05 11:19:31,417 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:19:31,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:19:31,432 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 67 conjunts are in the unsatisfiable core [2019-08-05 11:19:31,434 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:19:33,041 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 11:19:33,042 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:19:33,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2019-08-05 11:19:33,042 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-08-05 11:19:33,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-08-05 11:19:33,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 11:19:33,043 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 68 states. [2019-08-05 11:19:33,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:19:33,149 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2019-08-05 11:19:33,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-08-05 11:19:33,150 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 69 [2019-08-05 11:19:33,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:19:33,150 INFO L225 Difference]: With dead ends: 71 [2019-08-05 11:19:33,151 INFO L226 Difference]: Without dead ends: 71 [2019-08-05 11:19:33,151 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 11:19:33,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-08-05 11:19:33,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-08-05 11:19:33,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-08-05 11:19:33,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2019-08-05 11:19:33,153 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2019-08-05 11:19:33,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:19:33,153 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2019-08-05 11:19:33,153 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-08-05 11:19:33,153 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-08-05 11:19:33,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-08-05 11:19:33,154 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:19:33,154 INFO L399 BasicCegarLoop]: trace histogram [66, 1, 1, 1, 1] [2019-08-05 11:19:33,154 INFO L418 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:19:33,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:19:33,155 INFO L82 PathProgramCache]: Analyzing trace with hash -1215436216, now seen corresponding path program 65 times [2019-08-05 11:19:33,155 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:19:33,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:19:33,171 INFO L256 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 68 conjunts are in the unsatisfiable core [2019-08-05 11:19:33,173 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:19:34,913 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 11:19:34,914 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:19:34,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2019-08-05 11:19:34,914 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-08-05 11:19:34,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-08-05 11:19:34,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 11:19:34,915 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 69 states. [2019-08-05 11:19:35,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:19:35,044 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2019-08-05 11:19:35,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-08-05 11:19:35,044 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 70 [2019-08-05 11:19:35,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:19:35,045 INFO L225 Difference]: With dead ends: 72 [2019-08-05 11:19:35,045 INFO L226 Difference]: Without dead ends: 72 [2019-08-05 11:19:35,045 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 11:19:35,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-08-05 11:19:35,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-08-05 11:19:35,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-08-05 11:19:35,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2019-08-05 11:19:35,046 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2019-08-05 11:19:35,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:19:35,047 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2019-08-05 11:19:35,047 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-08-05 11:19:35,047 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2019-08-05 11:19:35,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-08-05 11:19:35,047 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:19:35,047 INFO L399 BasicCegarLoop]: trace histogram [67, 1, 1, 1, 1] [2019-08-05 11:19:35,047 INFO L418 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:19:35,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:19:35,048 INFO L82 PathProgramCache]: Analyzing trace with hash 976121442, now seen corresponding path program 66 times [2019-08-05 11:19:35,048 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:19:35,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:19:35,062 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 69 conjunts are in the unsatisfiable core [2019-08-05 11:19:35,064 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:19:36,719 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 11:19:36,719 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:19:36,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2019-08-05 11:19:36,719 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-08-05 11:19:36,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-08-05 11:19:36,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 11:19:36,720 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 70 states. [2019-08-05 11:19:36,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:19:36,827 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2019-08-05 11:19:36,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-08-05 11:19:36,828 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 71 [2019-08-05 11:19:36,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:19:36,828 INFO L225 Difference]: With dead ends: 73 [2019-08-05 11:19:36,828 INFO L226 Difference]: Without dead ends: 73 [2019-08-05 11:19:36,829 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 11:19:36,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-08-05 11:19:36,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-08-05 11:19:36,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-08-05 11:19:36,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-08-05 11:19:36,832 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2019-08-05 11:19:36,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:19:36,832 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2019-08-05 11:19:36,832 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-08-05 11:19:36,832 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-08-05 11:19:36,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-08-05 11:19:36,833 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:19:36,833 INFO L399 BasicCegarLoop]: trace histogram [68, 1, 1, 1, 1] [2019-08-05 11:19:36,833 INFO L418 AbstractCegarLoop]: === Iteration 70 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:19:36,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:19:36,833 INFO L82 PathProgramCache]: Analyzing trace with hash 194932104, now seen corresponding path program 67 times [2019-08-05 11:19:36,834 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:19:36,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:19:36,849 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 70 conjunts are in the unsatisfiable core [2019-08-05 11:19:36,851 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:19:38,550 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 11:19:38,550 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:19:38,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2019-08-05 11:19:38,551 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-08-05 11:19:38,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-08-05 11:19:38,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 11:19:38,551 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 71 states. [2019-08-05 11:19:38,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:19:38,639 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-08-05 11:19:38,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-08-05 11:19:38,640 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 72 [2019-08-05 11:19:38,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:19:38,641 INFO L225 Difference]: With dead ends: 74 [2019-08-05 11:19:38,641 INFO L226 Difference]: Without dead ends: 74 [2019-08-05 11:19:38,642 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 11:19:38,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-08-05 11:19:38,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-08-05 11:19:38,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-08-05 11:19:38,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2019-08-05 11:19:38,644 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2019-08-05 11:19:38,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:19:38,645 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2019-08-05 11:19:38,645 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-08-05 11:19:38,645 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2019-08-05 11:19:38,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-08-05 11:19:38,645 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:19:38,645 INFO L399 BasicCegarLoop]: trace histogram [69, 1, 1, 1, 1] [2019-08-05 11:19:38,646 INFO L418 AbstractCegarLoop]: === Iteration 71 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:19:38,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:19:38,646 INFO L82 PathProgramCache]: Analyzing trace with hash 1747866402, now seen corresponding path program 68 times [2019-08-05 11:19:38,646 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:19:38,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:19:38,663 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 71 conjunts are in the unsatisfiable core [2019-08-05 11:19:38,665 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:19:41,310 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 11:19:41,310 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:19:41,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2019-08-05 11:19:41,310 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-08-05 11:19:41,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-08-05 11:19:41,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 11:19:41,311 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 72 states. [2019-08-05 11:19:41,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:19:41,444 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-08-05 11:19:41,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-08-05 11:19:41,444 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 73 [2019-08-05 11:19:41,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:19:41,445 INFO L225 Difference]: With dead ends: 75 [2019-08-05 11:19:41,446 INFO L226 Difference]: Without dead ends: 75 [2019-08-05 11:19:41,446 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 11:19:41,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-08-05 11:19:41,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-08-05 11:19:41,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-05 11:19:41,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2019-08-05 11:19:41,449 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2019-08-05 11:19:41,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:19:41,449 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2019-08-05 11:19:41,449 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-08-05 11:19:41,449 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2019-08-05 11:19:41,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-08-05 11:19:41,449 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:19:41,450 INFO L399 BasicCegarLoop]: trace histogram [70, 1, 1, 1, 1] [2019-08-05 11:19:41,450 INFO L418 AbstractCegarLoop]: === Iteration 72 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:19:41,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:19:41,450 INFO L82 PathProgramCache]: Analyzing trace with hash -1650777912, now seen corresponding path program 69 times [2019-08-05 11:19:41,451 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:19:41,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:19:41,472 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 72 conjunts are in the unsatisfiable core [2019-08-05 11:19:41,474 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:19:43,286 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 11:19:43,286 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:19:43,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2019-08-05 11:19:43,287 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-08-05 11:19:43,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-08-05 11:19:43,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 11:19:43,288 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 73 states. [2019-08-05 11:19:43,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:19:43,421 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2019-08-05 11:19:43,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-08-05 11:19:43,421 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 74 [2019-08-05 11:19:43,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:19:43,422 INFO L225 Difference]: With dead ends: 76 [2019-08-05 11:19:43,422 INFO L226 Difference]: Without dead ends: 76 [2019-08-05 11:19:43,423 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 11:19:43,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-08-05 11:19:43,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-08-05 11:19:43,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-08-05 11:19:43,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2019-08-05 11:19:43,425 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2019-08-05 11:19:43,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:19:43,426 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2019-08-05 11:19:43,426 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-08-05 11:19:43,426 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2019-08-05 11:19:43,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-08-05 11:19:43,427 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:19:43,427 INFO L399 BasicCegarLoop]: trace histogram [71, 1, 1, 1, 1] [2019-08-05 11:19:43,427 INFO L418 AbstractCegarLoop]: === Iteration 73 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:19:43,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:19:43,428 INFO L82 PathProgramCache]: Analyzing trace with hash 365430754, now seen corresponding path program 70 times [2019-08-05 11:19:43,428 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:19:43,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:19:43,445 INFO L256 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 73 conjunts are in the unsatisfiable core [2019-08-05 11:19:43,446 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:19:45,693 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 11:19:45,694 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:19:45,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2019-08-05 11:19:45,694 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-08-05 11:19:45,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-08-05 11:19:45,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 11:19:45,695 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 74 states. [2019-08-05 11:19:45,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:19:45,884 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2019-08-05 11:19:45,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-08-05 11:19:45,884 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 75 [2019-08-05 11:19:45,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:19:45,885 INFO L225 Difference]: With dead ends: 77 [2019-08-05 11:19:45,885 INFO L226 Difference]: Without dead ends: 77 [2019-08-05 11:19:45,886 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 11:19:45,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-08-05 11:19:45,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-08-05 11:19:45,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-05 11:19:45,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-08-05 11:19:45,889 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2019-08-05 11:19:45,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:19:45,889 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-08-05 11:19:45,889 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-08-05 11:19:45,889 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-08-05 11:19:45,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-08-05 11:19:45,890 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:19:45,890 INFO L399 BasicCegarLoop]: trace histogram [72, 1, 1, 1, 1] [2019-08-05 11:19:45,890 INFO L418 AbstractCegarLoop]: === Iteration 74 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:19:45,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:19:45,890 INFO L82 PathProgramCache]: Analyzing trace with hash -1556610040, now seen corresponding path program 71 times [2019-08-05 11:19:45,891 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:19:45,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:19:45,906 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 74 conjunts are in the unsatisfiable core [2019-08-05 11:19:45,908 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:19:47,907 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 11:19:47,907 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:19:47,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2019-08-05 11:19:47,908 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-08-05 11:19:47,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-08-05 11:19:47,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 11:19:47,909 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 75 states. [2019-08-05 11:19:48,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:19:48,027 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2019-08-05 11:19:48,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-08-05 11:19:48,027 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 76 [2019-08-05 11:19:48,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:19:48,028 INFO L225 Difference]: With dead ends: 78 [2019-08-05 11:19:48,028 INFO L226 Difference]: Without dead ends: 78 [2019-08-05 11:19:48,029 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 11:19:48,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-08-05 11:19:48,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-08-05 11:19:48,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-08-05 11:19:48,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2019-08-05 11:19:48,031 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2019-08-05 11:19:48,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:19:48,032 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2019-08-05 11:19:48,032 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-08-05 11:19:48,032 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2019-08-05 11:19:48,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 11:19:48,032 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:19:48,032 INFO L399 BasicCegarLoop]: trace histogram [73, 1, 1, 1, 1] [2019-08-05 11:19:48,032 INFO L418 AbstractCegarLoop]: === Iteration 75 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:19:48,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:19:48,033 INFO L82 PathProgramCache]: Analyzing trace with hash -1010332510, now seen corresponding path program 72 times [2019-08-05 11:19:48,033 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:19:48,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:19:48,048 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 75 conjunts are in the unsatisfiable core [2019-08-05 11:19:48,050 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:19:50,013 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 11:19:50,014 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:19:50,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2019-08-05 11:19:50,014 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-08-05 11:19:50,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-08-05 11:19:50,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 11:19:50,015 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 76 states. [2019-08-05 11:19:50,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:19:50,315 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2019-08-05 11:19:50,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-08-05 11:19:50,316 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 77 [2019-08-05 11:19:50,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:19:50,316 INFO L225 Difference]: With dead ends: 79 [2019-08-05 11:19:50,316 INFO L226 Difference]: Without dead ends: 79 [2019-08-05 11:19:50,317 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 11:19:50,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-08-05 11:19:50,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-08-05 11:19:50,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-08-05 11:19:50,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2019-08-05 11:19:50,318 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77 [2019-08-05 11:19:50,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:19:50,318 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2019-08-05 11:19:50,319 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-08-05 11:19:50,319 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2019-08-05 11:19:50,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-08-05 11:19:50,319 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:19:50,319 INFO L399 BasicCegarLoop]: trace histogram [74, 1, 1, 1, 1] [2019-08-05 11:19:50,320 INFO L418 AbstractCegarLoop]: === Iteration 76 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:19:50,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:19:50,320 INFO L82 PathProgramCache]: Analyzing trace with hash -1255598264, now seen corresponding path program 73 times [2019-08-05 11:19:50,321 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:19:50,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:19:50,337 INFO L256 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 76 conjunts are in the unsatisfiable core [2019-08-05 11:19:50,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:19:52,391 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 11:19:52,391 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:19:52,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2019-08-05 11:19:52,392 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-08-05 11:19:52,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-08-05 11:19:52,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 11:19:52,392 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 77 states. [2019-08-05 11:19:52,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:19:52,495 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2019-08-05 11:19:52,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-08-05 11:19:52,495 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 78 [2019-08-05 11:19:52,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:19:52,496 INFO L225 Difference]: With dead ends: 80 [2019-08-05 11:19:52,496 INFO L226 Difference]: Without dead ends: 80 [2019-08-05 11:19:52,497 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 11:19:52,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-08-05 11:19:52,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-08-05 11:19:52,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-08-05 11:19:52,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2019-08-05 11:19:52,499 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 78 [2019-08-05 11:19:52,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:19:52,501 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2019-08-05 11:19:52,501 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-08-05 11:19:52,501 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2019-08-05 11:19:52,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-08-05 11:19:52,502 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:19:52,502 INFO L399 BasicCegarLoop]: trace histogram [75, 1, 1, 1, 1] [2019-08-05 11:19:52,502 INFO L418 AbstractCegarLoop]: === Iteration 77 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:19:52,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:19:52,502 INFO L82 PathProgramCache]: Analyzing trace with hash -268902046, now seen corresponding path program 74 times [2019-08-05 11:19:52,503 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:19:52,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:19:52,518 INFO L256 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 77 conjunts are in the unsatisfiable core [2019-08-05 11:19:52,520 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:19:54,531 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 11:19:54,531 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:19:54,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2019-08-05 11:19:54,532 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-08-05 11:19:54,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-08-05 11:19:54,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 11:19:54,533 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 78 states. [2019-08-05 11:19:55,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:19:55,173 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2019-08-05 11:19:55,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-08-05 11:19:55,174 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 79 [2019-08-05 11:19:55,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:19:55,175 INFO L225 Difference]: With dead ends: 81 [2019-08-05 11:19:55,175 INFO L226 Difference]: Without dead ends: 81 [2019-08-05 11:19:55,175 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 11:19:55,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-08-05 11:19:55,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-08-05 11:19:55,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-08-05 11:19:55,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-08-05 11:19:55,178 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 79 [2019-08-05 11:19:55,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:19:55,178 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2019-08-05 11:19:55,178 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-08-05 11:19:55,178 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-08-05 11:19:55,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-08-05 11:19:55,178 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:19:55,179 INFO L399 BasicCegarLoop]: trace histogram [76, 1, 1, 1, 1] [2019-08-05 11:19:55,179 INFO L418 AbstractCegarLoop]: === Iteration 78 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:19:55,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:19:55,179 INFO L82 PathProgramCache]: Analyzing trace with hash 253909640, now seen corresponding path program 75 times [2019-08-05 11:19:55,180 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:19:55,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:19:55,196 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 78 conjunts are in the unsatisfiable core [2019-08-05 11:19:55,198 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:19:57,399 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 11:19:57,399 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:19:57,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2019-08-05 11:19:57,400 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-08-05 11:19:57,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-08-05 11:19:57,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 11:19:57,401 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 79 states. [2019-08-05 11:19:57,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:19:57,517 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2019-08-05 11:19:57,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-08-05 11:19:57,518 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 80 [2019-08-05 11:19:57,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:19:57,519 INFO L225 Difference]: With dead ends: 82 [2019-08-05 11:19:57,519 INFO L226 Difference]: Without dead ends: 82 [2019-08-05 11:19:57,520 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 11:19:57,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-08-05 11:19:57,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2019-08-05 11:19:57,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-08-05 11:19:57,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2019-08-05 11:19:57,522 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 80 [2019-08-05 11:19:57,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:19:57,522 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2019-08-05 11:19:57,523 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-08-05 11:19:57,523 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2019-08-05 11:19:57,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-08-05 11:19:57,523 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:19:57,523 INFO L399 BasicCegarLoop]: trace histogram [77, 1, 1, 1, 1] [2019-08-05 11:19:57,523 INFO L418 AbstractCegarLoop]: === Iteration 79 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:19:57,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:19:57,524 INFO L82 PathProgramCache]: Analyzing trace with hash -718797278, now seen corresponding path program 76 times [2019-08-05 11:19:57,524 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:19:57,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:19:57,541 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 79 conjunts are in the unsatisfiable core [2019-08-05 11:19:57,543 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:19:59,776 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 11:19:59,777 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:19:59,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2019-08-05 11:19:59,777 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-08-05 11:19:59,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-08-05 11:19:59,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 11:19:59,778 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 80 states. [2019-08-05 11:19:59,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:19:59,891 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2019-08-05 11:19:59,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-08-05 11:19:59,892 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 81 [2019-08-05 11:19:59,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:19:59,893 INFO L225 Difference]: With dead ends: 83 [2019-08-05 11:19:59,893 INFO L226 Difference]: Without dead ends: 83 [2019-08-05 11:19:59,894 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 11:19:59,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-08-05 11:19:59,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-08-05 11:19:59,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-08-05 11:19:59,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2019-08-05 11:19:59,896 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 81 [2019-08-05 11:19:59,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:19:59,896 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2019-08-05 11:19:59,897 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-08-05 11:19:59,897 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2019-08-05 11:19:59,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-08-05 11:19:59,897 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:19:59,897 INFO L399 BasicCegarLoop]: trace histogram [78, 1, 1, 1, 1] [2019-08-05 11:19:59,898 INFO L418 AbstractCegarLoop]: === Iteration 80 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:19:59,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:19:59,898 INFO L82 PathProgramCache]: Analyzing trace with hash -807940664, now seen corresponding path program 77 times [2019-08-05 11:19:59,898 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:19:59,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:19:59,915 INFO L256 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 80 conjunts are in the unsatisfiable core [2019-08-05 11:19:59,917 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:20:02,226 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 11:20:02,226 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:20:02,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2019-08-05 11:20:02,226 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-08-05 11:20:02,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-08-05 11:20:02,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 11:20:02,227 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 81 states. [2019-08-05 11:20:02,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:20:02,334 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2019-08-05 11:20:02,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-08-05 11:20:02,335 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 82 [2019-08-05 11:20:02,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:20:02,335 INFO L225 Difference]: With dead ends: 84 [2019-08-05 11:20:02,335 INFO L226 Difference]: Without dead ends: 84 [2019-08-05 11:20:02,336 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 11:20:02,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-08-05 11:20:02,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2019-08-05 11:20:02,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-08-05 11:20:02,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2019-08-05 11:20:02,338 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 82 [2019-08-05 11:20:02,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:20:02,338 INFO L475 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2019-08-05 11:20:02,338 INFO L476 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-08-05 11:20:02,338 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2019-08-05 11:20:02,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-08-05 11:20:02,339 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:20:02,339 INFO L399 BasicCegarLoop]: trace histogram [79, 1, 1, 1, 1] [2019-08-05 11:20:02,339 INFO L418 AbstractCegarLoop]: === Iteration 81 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:20:02,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:20:02,339 INFO L82 PathProgramCache]: Analyzing trace with hash 723581666, now seen corresponding path program 78 times [2019-08-05 11:20:02,340 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:20:02,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:20:02,355 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 81 conjunts are in the unsatisfiable core [2019-08-05 11:20:02,357 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:20:06,517 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 11:20:06,517 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:20:06,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2019-08-05 11:20:06,518 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-08-05 11:20:06,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-08-05 11:20:06,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-08-05 11:20:06,519 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 82 states. [2019-08-05 11:20:06,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:20:06,621 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2019-08-05 11:20:06,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-08-05 11:20:06,622 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 83 [2019-08-05 11:20:06,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:20:06,622 INFO L225 Difference]: With dead ends: 85 [2019-08-05 11:20:06,623 INFO L226 Difference]: Without dead ends: 85 [2019-08-05 11:20:06,623 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-08-05 11:20:06,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-08-05 11:20:06,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-08-05 11:20:06,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-08-05 11:20:06,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2019-08-05 11:20:06,625 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 83 [2019-08-05 11:20:06,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:20:06,625 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2019-08-05 11:20:06,625 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-08-05 11:20:06,625 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2019-08-05 11:20:06,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-08-05 11:20:06,626 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:20:06,626 INFO L399 BasicCegarLoop]: trace histogram [80, 1, 1, 1, 1] [2019-08-05 11:20:06,626 INFO L418 AbstractCegarLoop]: === Iteration 82 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:20:06,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:20:06,626 INFO L82 PathProgramCache]: Analyzing trace with hash 956133640, now seen corresponding path program 79 times [2019-08-05 11:20:06,627 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:20:06,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:20:06,640 INFO L256 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 82 conjunts are in the unsatisfiable core [2019-08-05 11:20:06,642 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:20:08,911 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 11:20:08,911 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:20:08,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2019-08-05 11:20:08,912 INFO L454 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-08-05 11:20:08,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-08-05 11:20:08,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 11:20:08,913 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 83 states. [2019-08-05 11:20:09,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:20:09,724 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2019-08-05 11:20:09,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-08-05 11:20:09,725 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 84 [2019-08-05 11:20:09,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:20:09,726 INFO L225 Difference]: With dead ends: 86 [2019-08-05 11:20:09,726 INFO L226 Difference]: Without dead ends: 86 [2019-08-05 11:20:09,726 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 11:20:09,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-08-05 11:20:09,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2019-08-05 11:20:09,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-08-05 11:20:09,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2019-08-05 11:20:09,729 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 84 [2019-08-05 11:20:09,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:20:09,729 INFO L475 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2019-08-05 11:20:09,729 INFO L476 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-08-05 11:20:09,730 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2019-08-05 11:20:09,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 11:20:09,730 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:20:09,731 INFO L399 BasicCegarLoop]: trace histogram [81, 1, 1, 1, 1] [2019-08-05 11:20:09,731 INFO L418 AbstractCegarLoop]: === Iteration 83 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:20:09,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:20:09,731 INFO L82 PathProgramCache]: Analyzing trace with hash -424689758, now seen corresponding path program 80 times [2019-08-05 11:20:09,732 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:20:09,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:20:09,759 INFO L256 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 83 conjunts are in the unsatisfiable core [2019-08-05 11:20:09,762 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:20:13,354 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 11:20:13,355 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:20:13,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2019-08-05 11:20:13,355 INFO L454 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-08-05 11:20:13,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-08-05 11:20:13,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-08-05 11:20:13,356 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 84 states. [2019-08-05 11:20:13,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:20:13,528 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2019-08-05 11:20:13,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-08-05 11:20:13,529 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 85 [2019-08-05 11:20:13,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:20:13,529 INFO L225 Difference]: With dead ends: 87 [2019-08-05 11:20:13,530 INFO L226 Difference]: Without dead ends: 87 [2019-08-05 11:20:13,530 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-08-05 11:20:13,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-08-05 11:20:13,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-08-05 11:20:13,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-08-05 11:20:13,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2019-08-05 11:20:13,532 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 85 [2019-08-05 11:20:13,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:20:13,533 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2019-08-05 11:20:13,533 INFO L476 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-08-05 11:20:13,533 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2019-08-05 11:20:13,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-08-05 11:20:13,534 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:20:13,534 INFO L399 BasicCegarLoop]: trace histogram [82, 1, 1, 1, 1] [2019-08-05 11:20:13,534 INFO L418 AbstractCegarLoop]: === Iteration 84 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:20:13,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:20:13,534 INFO L82 PathProgramCache]: Analyzing trace with hash -280542136, now seen corresponding path program 81 times [2019-08-05 11:20:13,535 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:20:13,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:20:13,553 INFO L256 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 84 conjunts are in the unsatisfiable core [2019-08-05 11:20:13,555 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:20:16,251 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 11:20:16,251 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:20:16,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2019-08-05 11:20:16,251 INFO L454 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-08-05 11:20:16,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-08-05 11:20:16,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2019-08-05 11:20:16,252 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 85 states. [2019-08-05 11:20:16,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:20:16,390 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2019-08-05 11:20:16,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-08-05 11:20:16,390 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 86 [2019-08-05 11:20:16,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:20:16,391 INFO L225 Difference]: With dead ends: 88 [2019-08-05 11:20:16,391 INFO L226 Difference]: Without dead ends: 88 [2019-08-05 11:20:16,392 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2019-08-05 11:20:16,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-08-05 11:20:16,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2019-08-05 11:20:16,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-08-05 11:20:16,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2019-08-05 11:20:16,394 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 86 [2019-08-05 11:20:16,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:20:16,394 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2019-08-05 11:20:16,394 INFO L476 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-08-05 11:20:16,394 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2019-08-05 11:20:16,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-08-05 11:20:16,395 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:20:16,395 INFO L399 BasicCegarLoop]: trace histogram [83, 1, 1, 1, 1] [2019-08-05 11:20:16,395 INFO L418 AbstractCegarLoop]: === Iteration 85 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:20:16,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:20:16,395 INFO L82 PathProgramCache]: Analyzing trace with hash -106933150, now seen corresponding path program 82 times [2019-08-05 11:20:16,396 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:20:16,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:20:16,410 INFO L256 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 85 conjunts are in the unsatisfiable core [2019-08-05 11:20:16,411 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:20:18,848 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 11:20:18,848 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:20:18,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2019-08-05 11:20:18,849 INFO L454 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-08-05 11:20:18,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-08-05 11:20:18,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-08-05 11:20:18,850 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 86 states. [2019-08-05 11:20:19,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:20:19,042 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2019-08-05 11:20:19,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-08-05 11:20:19,043 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 87 [2019-08-05 11:20:19,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:20:19,043 INFO L225 Difference]: With dead ends: 89 [2019-08-05 11:20:19,043 INFO L226 Difference]: Without dead ends: 89 [2019-08-05 11:20:19,044 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-08-05 11:20:19,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-08-05 11:20:19,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-08-05 11:20:19,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-08-05 11:20:19,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2019-08-05 11:20:19,046 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 87 [2019-08-05 11:20:19,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:20:19,046 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2019-08-05 11:20:19,047 INFO L476 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-08-05 11:20:19,047 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2019-08-05 11:20:19,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-08-05 11:20:19,047 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:20:19,047 INFO L399 BasicCegarLoop]: trace histogram [84, 1, 1, 1, 1] [2019-08-05 11:20:19,048 INFO L418 AbstractCegarLoop]: === Iteration 86 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:20:19,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:20:19,048 INFO L82 PathProgramCache]: Analyzing trace with hash 979978120, now seen corresponding path program 83 times [2019-08-05 11:20:19,049 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:20:19,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:20:19,065 INFO L256 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 86 conjunts are in the unsatisfiable core [2019-08-05 11:20:19,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:20:21,863 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 11:20:21,864 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:20:21,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2019-08-05 11:20:21,864 INFO L454 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-08-05 11:20:21,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-08-05 11:20:21,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2019-08-05 11:20:21,866 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 87 states. [2019-08-05 11:20:21,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:20:21,980 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2019-08-05 11:20:21,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-08-05 11:20:21,980 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 88 [2019-08-05 11:20:21,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:20:21,981 INFO L225 Difference]: With dead ends: 90 [2019-08-05 11:20:21,981 INFO L226 Difference]: Without dead ends: 90 [2019-08-05 11:20:21,982 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2019-08-05 11:20:21,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-08-05 11:20:21,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2019-08-05 11:20:21,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-08-05 11:20:21,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2019-08-05 11:20:21,985 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 88 [2019-08-05 11:20:21,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:20:21,985 INFO L475 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2019-08-05 11:20:21,985 INFO L476 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-08-05 11:20:21,985 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2019-08-05 11:20:21,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-08-05 11:20:21,986 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:20:21,986 INFO L399 BasicCegarLoop]: trace histogram [85, 1, 1, 1, 1] [2019-08-05 11:20:21,986 INFO L418 AbstractCegarLoop]: === Iteration 87 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:20:21,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:20:21,986 INFO L82 PathProgramCache]: Analyzing trace with hash 314489122, now seen corresponding path program 84 times [2019-08-05 11:20:21,987 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:20:22,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:20:22,005 INFO L256 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 87 conjunts are in the unsatisfiable core [2019-08-05 11:20:22,006 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:20:24,664 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 11:20:24,665 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:20:24,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2019-08-05 11:20:24,665 INFO L454 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-08-05 11:20:24,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-08-05 11:20:24,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-08-05 11:20:24,666 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 88 states. [2019-08-05 11:20:24,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:20:24,849 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2019-08-05 11:20:24,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-08-05 11:20:24,849 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 89 [2019-08-05 11:20:24,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:20:24,850 INFO L225 Difference]: With dead ends: 91 [2019-08-05 11:20:24,850 INFO L226 Difference]: Without dead ends: 91 [2019-08-05 11:20:24,851 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-08-05 11:20:24,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-08-05 11:20:24,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-08-05 11:20:24,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-08-05 11:20:24,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2019-08-05 11:20:24,853 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 89 [2019-08-05 11:20:24,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:20:24,853 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2019-08-05 11:20:24,853 INFO L476 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-08-05 11:20:24,853 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2019-08-05 11:20:24,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-08-05 11:20:24,854 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:20:24,854 INFO L399 BasicCegarLoop]: trace histogram [86, 1, 1, 1, 1] [2019-08-05 11:20:24,854 INFO L418 AbstractCegarLoop]: === Iteration 88 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:20:24,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:20:24,854 INFO L82 PathProgramCache]: Analyzing trace with hash 1159166664, now seen corresponding path program 85 times [2019-08-05 11:20:24,855 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:20:24,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:20:24,869 INFO L256 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 88 conjunts are in the unsatisfiable core [2019-08-05 11:20:24,871 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:20:27,623 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 11:20:27,623 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:20:27,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2019-08-05 11:20:27,624 INFO L454 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-08-05 11:20:27,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-08-05 11:20:27,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2019-08-05 11:20:27,635 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 89 states. [2019-08-05 11:20:27,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:20:27,764 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2019-08-05 11:20:27,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-08-05 11:20:27,765 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 90 [2019-08-05 11:20:27,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:20:27,766 INFO L225 Difference]: With dead ends: 92 [2019-08-05 11:20:27,766 INFO L226 Difference]: Without dead ends: 92 [2019-08-05 11:20:27,766 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2019-08-05 11:20:27,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-08-05 11:20:27,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2019-08-05 11:20:27,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-08-05 11:20:27,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2019-08-05 11:20:27,769 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 90 [2019-08-05 11:20:27,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:20:27,769 INFO L475 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2019-08-05 11:20:27,769 INFO L476 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-08-05 11:20:27,770 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2019-08-05 11:20:27,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-08-05 11:20:27,770 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:20:27,770 INFO L399 BasicCegarLoop]: trace histogram [87, 1, 1, 1, 1] [2019-08-05 11:20:27,770 INFO L418 AbstractCegarLoop]: === Iteration 89 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:20:27,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:20:27,771 INFO L82 PathProgramCache]: Analyzing trace with hash 1574366690, now seen corresponding path program 86 times [2019-08-05 11:20:27,771 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:20:27,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:20:27,788 INFO L256 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 89 conjunts are in the unsatisfiable core [2019-08-05 11:20:27,789 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:20:30,487 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 11:20:30,487 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:20:30,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2019-08-05 11:20:30,488 INFO L454 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-08-05 11:20:30,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-08-05 11:20:30,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-08-05 11:20:30,489 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 90 states. [2019-08-05 11:20:30,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:20:30,631 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2019-08-05 11:20:30,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-08-05 11:20:30,632 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 91 [2019-08-05 11:20:30,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:20:30,633 INFO L225 Difference]: With dead ends: 93 [2019-08-05 11:20:30,633 INFO L226 Difference]: Without dead ends: 93 [2019-08-05 11:20:30,633 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-08-05 11:20:30,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-08-05 11:20:30,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2019-08-05 11:20:30,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-08-05 11:20:30,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2019-08-05 11:20:30,636 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 91 [2019-08-05 11:20:30,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:20:30,636 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2019-08-05 11:20:30,636 INFO L476 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-08-05 11:20:30,636 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2019-08-05 11:20:30,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-08-05 11:20:30,637 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:20:30,637 INFO L399 BasicCegarLoop]: trace histogram [88, 1, 1, 1, 1] [2019-08-05 11:20:30,637 INFO L418 AbstractCegarLoop]: === Iteration 90 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:20:30,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:20:30,637 INFO L82 PathProgramCache]: Analyzing trace with hash 1560665608, now seen corresponding path program 87 times [2019-08-05 11:20:30,638 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:20:30,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:20:30,653 INFO L256 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 90 conjunts are in the unsatisfiable core [2019-08-05 11:20:30,654 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:20:33,562 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 11:20:33,562 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:20:33,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2019-08-05 11:20:33,562 INFO L454 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-08-05 11:20:33,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-08-05 11:20:33,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2019-08-05 11:20:33,563 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 91 states. [2019-08-05 11:20:33,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:20:33,828 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2019-08-05 11:20:33,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-08-05 11:20:33,828 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 92 [2019-08-05 11:20:33,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:20:33,829 INFO L225 Difference]: With dead ends: 94 [2019-08-05 11:20:33,829 INFO L226 Difference]: Without dead ends: 94 [2019-08-05 11:20:33,829 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2019-08-05 11:20:33,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-08-05 11:20:33,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2019-08-05 11:20:33,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-08-05 11:20:33,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2019-08-05 11:20:33,830 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 92 [2019-08-05 11:20:33,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:20:33,831 INFO L475 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2019-08-05 11:20:33,831 INFO L476 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-08-05 11:20:33,831 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2019-08-05 11:20:33,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:20:33,831 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:20:33,831 INFO L399 BasicCegarLoop]: trace histogram [89, 1, 1, 1, 1] [2019-08-05 11:20:33,831 INFO L418 AbstractCegarLoop]: === Iteration 91 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:20:33,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:20:33,832 INFO L82 PathProgramCache]: Analyzing trace with hash 1135932066, now seen corresponding path program 88 times [2019-08-05 11:20:33,832 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:20:33,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:20:33,853 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 91 conjunts are in the unsatisfiable core [2019-08-05 11:20:33,854 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:20:36,896 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 11:20:36,896 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:20:36,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2019-08-05 11:20:36,896 INFO L454 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-08-05 11:20:36,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-08-05 11:20:36,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-08-05 11:20:36,897 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 92 states. [2019-08-05 11:20:37,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:20:37,028 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2019-08-05 11:20:37,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-08-05 11:20:37,029 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 93 [2019-08-05 11:20:37,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:20:37,030 INFO L225 Difference]: With dead ends: 95 [2019-08-05 11:20:37,030 INFO L226 Difference]: Without dead ends: 95 [2019-08-05 11:20:37,031 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-08-05 11:20:37,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-08-05 11:20:37,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2019-08-05 11:20:37,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-08-05 11:20:37,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2019-08-05 11:20:37,033 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 93 [2019-08-05 11:20:37,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:20:37,033 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2019-08-05 11:20:37,033 INFO L476 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-08-05 11:20:37,033 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2019-08-05 11:20:37,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-08-05 11:20:37,034 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:20:37,034 INFO L399 BasicCegarLoop]: trace histogram [90, 1, 1, 1, 1] [2019-08-05 11:20:37,034 INFO L418 AbstractCegarLoop]: === Iteration 92 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:20:37,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:20:37,034 INFO L82 PathProgramCache]: Analyzing trace with hash 854094152, now seen corresponding path program 89 times [2019-08-05 11:20:37,035 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:20:37,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:20:37,055 INFO L256 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 92 conjunts are in the unsatisfiable core [2019-08-05 11:20:37,057 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:20:40,045 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 11:20:40,045 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:20:40,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2019-08-05 11:20:40,046 INFO L454 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-08-05 11:20:40,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-08-05 11:20:40,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2019-08-05 11:20:40,047 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 93 states. [2019-08-05 11:20:40,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:20:40,192 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2019-08-05 11:20:40,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-08-05 11:20:40,192 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 94 [2019-08-05 11:20:40,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:20:40,193 INFO L225 Difference]: With dead ends: 96 [2019-08-05 11:20:40,193 INFO L226 Difference]: Without dead ends: 96 [2019-08-05 11:20:40,194 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2019-08-05 11:20:40,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-08-05 11:20:40,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2019-08-05 11:20:40,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-08-05 11:20:40,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2019-08-05 11:20:40,196 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 94 [2019-08-05 11:20:40,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:20:40,197 INFO L475 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2019-08-05 11:20:40,197 INFO L476 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-08-05 11:20:40,197 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2019-08-05 11:20:40,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-08-05 11:20:40,197 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:20:40,197 INFO L399 BasicCegarLoop]: trace histogram [91, 1, 1, 1, 1] [2019-08-05 11:20:40,197 INFO L418 AbstractCegarLoop]: === Iteration 93 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:20:40,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:20:40,198 INFO L82 PathProgramCache]: Analyzing trace with hash 707053410, now seen corresponding path program 90 times [2019-08-05 11:20:40,198 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:20:40,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:20:40,214 INFO L256 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 93 conjunts are in the unsatisfiable core [2019-08-05 11:20:40,215 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:20:43,385 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 11:20:43,385 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:20:43,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2019-08-05 11:20:43,385 INFO L454 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-08-05 11:20:43,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-08-05 11:20:43,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-08-05 11:20:43,387 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 94 states. [2019-08-05 11:20:43,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:20:43,527 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2019-08-05 11:20:43,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-08-05 11:20:43,527 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 95 [2019-08-05 11:20:43,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:20:43,528 INFO L225 Difference]: With dead ends: 97 [2019-08-05 11:20:43,528 INFO L226 Difference]: Without dead ends: 97 [2019-08-05 11:20:43,529 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-08-05 11:20:43,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-08-05 11:20:43,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2019-08-05 11:20:43,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-08-05 11:20:43,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2019-08-05 11:20:43,531 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 95 [2019-08-05 11:20:43,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:20:43,531 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2019-08-05 11:20:43,531 INFO L476 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-08-05 11:20:43,531 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2019-08-05 11:20:43,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-08-05 11:20:43,532 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:20:43,532 INFO L399 BasicCegarLoop]: trace histogram [92, 1, 1, 1, 1] [2019-08-05 11:20:43,532 INFO L418 AbstractCegarLoop]: === Iteration 94 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:20:43,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:20:43,532 INFO L82 PathProgramCache]: Analyzing trace with hash 443757704, now seen corresponding path program 91 times [2019-08-05 11:20:43,533 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:20:43,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:20:43,556 INFO L256 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 94 conjunts are in the unsatisfiable core [2019-08-05 11:20:43,557 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:20:47,081 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 11:20:47,081 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:20:47,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2019-08-05 11:20:47,082 INFO L454 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-08-05 11:20:47,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-08-05 11:20:47,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2019-08-05 11:20:47,083 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 95 states. [2019-08-05 11:20:47,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:20:47,231 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2019-08-05 11:20:47,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-08-05 11:20:47,231 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 96 [2019-08-05 11:20:47,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:20:47,232 INFO L225 Difference]: With dead ends: 98 [2019-08-05 11:20:47,232 INFO L226 Difference]: Without dead ends: 98 [2019-08-05 11:20:47,233 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2019-08-05 11:20:47,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-08-05 11:20:47,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2019-08-05 11:20:47,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-08-05 11:20:47,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2019-08-05 11:20:47,235 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 96 [2019-08-05 11:20:47,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:20:47,235 INFO L475 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2019-08-05 11:20:47,236 INFO L476 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-08-05 11:20:47,236 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2019-08-05 11:20:47,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-08-05 11:20:47,236 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:20:47,236 INFO L399 BasicCegarLoop]: trace histogram [93, 1, 1, 1, 1] [2019-08-05 11:20:47,237 INFO L418 AbstractCegarLoop]: === Iteration 95 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:20:47,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:20:47,237 INFO L82 PathProgramCache]: Analyzing trace with hash 871525410, now seen corresponding path program 92 times [2019-08-05 11:20:47,237 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:20:47,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:20:47,254 INFO L256 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 95 conjunts are in the unsatisfiable core [2019-08-05 11:20:47,256 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:20:50,306 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 11:20:50,306 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:20:50,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2019-08-05 11:20:50,307 INFO L454 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-08-05 11:20:50,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-08-05 11:20:50,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-08-05 11:20:50,308 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 96 states. [2019-08-05 11:20:50,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:20:50,449 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2019-08-05 11:20:50,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-08-05 11:20:50,450 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 97 [2019-08-05 11:20:50,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:20:50,450 INFO L225 Difference]: With dead ends: 99 [2019-08-05 11:20:50,451 INFO L226 Difference]: Without dead ends: 99 [2019-08-05 11:20:50,451 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-08-05 11:20:50,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-08-05 11:20:50,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2019-08-05 11:20:50,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-08-05 11:20:50,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2019-08-05 11:20:50,454 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 97 [2019-08-05 11:20:50,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:20:50,454 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2019-08-05 11:20:50,454 INFO L476 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-08-05 11:20:50,454 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2019-08-05 11:20:50,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-08-05 11:20:50,455 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:20:50,455 INFO L399 BasicCegarLoop]: trace histogram [94, 1, 1, 1, 1] [2019-08-05 11:20:50,455 INFO L418 AbstractCegarLoop]: === Iteration 96 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:20:50,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:20:50,456 INFO L82 PathProgramCache]: Analyzing trace with hash 1247422408, now seen corresponding path program 93 times [2019-08-05 11:20:50,456 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:20:50,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:20:50,478 INFO L256 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 96 conjunts are in the unsatisfiable core [2019-08-05 11:20:50,479 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:20:54,414 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 11:20:54,415 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:20:54,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2019-08-05 11:20:54,415 INFO L454 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-08-05 11:20:54,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-08-05 11:20:54,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2019-08-05 11:20:54,416 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 97 states. [2019-08-05 11:20:54,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:20:54,566 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2019-08-05 11:20:54,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-08-05 11:20:54,567 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 98 [2019-08-05 11:20:54,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:20:54,568 INFO L225 Difference]: With dead ends: 100 [2019-08-05 11:20:54,568 INFO L226 Difference]: Without dead ends: 100 [2019-08-05 11:20:54,569 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2019-08-05 11:20:54,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-08-05 11:20:54,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-08-05 11:20:54,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-08-05 11:20:54,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2019-08-05 11:20:54,571 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 98 [2019-08-05 11:20:54,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:20:54,572 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2019-08-05 11:20:54,572 INFO L476 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-08-05 11:20:54,572 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2019-08-05 11:20:54,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-08-05 11:20:54,572 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:20:54,572 INFO L399 BasicCegarLoop]: trace histogram [95, 1, 1, 1, 1] [2019-08-05 11:20:54,573 INFO L418 AbstractCegarLoop]: === Iteration 97 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:20:54,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:20:54,573 INFO L82 PathProgramCache]: Analyzing trace with hash 15327458, now seen corresponding path program 94 times [2019-08-05 11:20:54,573 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:20:54,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:20:54,601 INFO L256 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 97 conjunts are in the unsatisfiable core [2019-08-05 11:20:54,602 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:20:57,813 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 11:20:57,814 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:20:57,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2019-08-05 11:20:57,814 INFO L454 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-08-05 11:20:57,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-08-05 11:20:57,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-08-05 11:20:57,815 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 98 states. [2019-08-05 11:20:57,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:20:57,952 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2019-08-05 11:20:57,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-08-05 11:20:57,952 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 99 [2019-08-05 11:20:57,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:20:57,953 INFO L225 Difference]: With dead ends: 101 [2019-08-05 11:20:57,953 INFO L226 Difference]: Without dead ends: 101 [2019-08-05 11:20:57,954 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-08-05 11:20:57,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-08-05 11:20:57,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2019-08-05 11:20:57,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-08-05 11:20:57,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2019-08-05 11:20:57,956 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 99 [2019-08-05 11:20:57,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:20:57,957 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2019-08-05 11:20:57,957 INFO L476 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-08-05 11:20:57,957 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2019-08-05 11:20:57,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-08-05 11:20:57,957 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:20:57,958 INFO L399 BasicCegarLoop]: trace histogram [96, 1, 1, 1, 1] [2019-08-05 11:20:57,958 INFO L418 AbstractCegarLoop]: === Iteration 98 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:20:57,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:20:57,958 INFO L82 PathProgramCache]: Analyzing trace with hash 475089672, now seen corresponding path program 95 times [2019-08-05 11:20:57,959 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:20:57,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:20:57,978 INFO L256 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 98 conjunts are in the unsatisfiable core [2019-08-05 11:20:57,980 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:01,232 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 11:21:01,232 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:01,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2019-08-05 11:21:01,233 INFO L454 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-08-05 11:21:01,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-08-05 11:21:01,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2019-08-05 11:21:01,234 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 99 states. [2019-08-05 11:21:01,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:01,423 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2019-08-05 11:21:01,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-08-05 11:21:01,424 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 100 [2019-08-05 11:21:01,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:01,425 INFO L225 Difference]: With dead ends: 102 [2019-08-05 11:21:01,425 INFO L226 Difference]: Without dead ends: 102 [2019-08-05 11:21:01,426 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2019-08-05 11:21:01,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-08-05 11:21:01,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2019-08-05 11:21:01,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-08-05 11:21:01,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2019-08-05 11:21:01,428 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 100 [2019-08-05 11:21:01,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:01,428 INFO L475 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2019-08-05 11:21:01,428 INFO L476 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-08-05 11:21:01,428 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2019-08-05 11:21:01,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:21:01,429 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:01,429 INFO L399 BasicCegarLoop]: trace histogram [97, 1, 1, 1, 1] [2019-08-05 11:21:01,429 INFO L418 AbstractCegarLoop]: === Iteration 99 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:01,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:01,429 INFO L82 PathProgramCache]: Analyzing trace with hash 1842816418, now seen corresponding path program 96 times [2019-08-05 11:21:01,430 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:01,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:01,449 INFO L256 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 99 conjunts are in the unsatisfiable core [2019-08-05 11:21:01,450 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:05,040 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 11:21:05,040 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:05,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2019-08-05 11:21:05,040 INFO L454 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-08-05 11:21:05,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-08-05 11:21:05,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-08-05 11:21:05,042 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 100 states. [2019-08-05 11:21:05,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:05,236 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2019-08-05 11:21:05,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-08-05 11:21:05,236 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 101 [2019-08-05 11:21:05,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:05,237 INFO L225 Difference]: With dead ends: 103 [2019-08-05 11:21:05,237 INFO L226 Difference]: Without dead ends: 103 [2019-08-05 11:21:05,238 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-08-05 11:21:05,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-08-05 11:21:05,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2019-08-05 11:21:05,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-08-05 11:21:05,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2019-08-05 11:21:05,239 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 101 [2019-08-05 11:21:05,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:05,240 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2019-08-05 11:21:05,240 INFO L476 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-08-05 11:21:05,240 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2019-08-05 11:21:05,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-08-05 11:21:05,240 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:05,240 INFO L399 BasicCegarLoop]: trace histogram [98, 1, 1, 1, 1] [2019-08-05 11:21:05,240 INFO L418 AbstractCegarLoop]: === Iteration 100 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:05,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:05,241 INFO L82 PathProgramCache]: Analyzing trace with hash 1292672584, now seen corresponding path program 97 times [2019-08-05 11:21:05,241 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:05,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:05,261 INFO L256 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 100 conjunts are in the unsatisfiable core [2019-08-05 11:21:05,262 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:08,893 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 11:21:08,893 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:08,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100] total 100 [2019-08-05 11:21:08,894 INFO L454 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-08-05 11:21:08,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-08-05 11:21:08,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2019-08-05 11:21:08,895 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 101 states. [2019-08-05 11:21:09,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:09,045 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2019-08-05 11:21:09,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-08-05 11:21:09,045 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 102 [2019-08-05 11:21:09,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:09,046 INFO L225 Difference]: With dead ends: 104 [2019-08-05 11:21:09,047 INFO L226 Difference]: Without dead ends: 104 [2019-08-05 11:21:09,047 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2019-08-05 11:21:09,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-08-05 11:21:09,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-08-05 11:21:09,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-08-05 11:21:09,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2019-08-05 11:21:09,050 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 102 [2019-08-05 11:21:09,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:09,050 INFO L475 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2019-08-05 11:21:09,051 INFO L476 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-08-05 11:21:09,051 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2019-08-05 11:21:09,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-08-05 11:21:09,051 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:09,051 INFO L399 BasicCegarLoop]: trace histogram [99, 1, 1, 1, 1] [2019-08-05 11:21:09,051 INFO L418 AbstractCegarLoop]: === Iteration 101 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:09,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:09,052 INFO L82 PathProgramCache]: Analyzing trace with hash 1418082914, now seen corresponding path program 98 times [2019-08-05 11:21:09,052 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:09,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:09,076 INFO L256 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 101 conjunts are in the unsatisfiable core [2019-08-05 11:21:09,078 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:12,883 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 11:21:12,884 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:12,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2019-08-05 11:21:12,884 INFO L454 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-08-05 11:21:12,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-08-05 11:21:12,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-08-05 11:21:12,886 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 102 states. [2019-08-05 11:21:13,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:13,063 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2019-08-05 11:21:13,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-08-05 11:21:13,063 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 103 [2019-08-05 11:21:13,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:13,064 INFO L225 Difference]: With dead ends: 105 [2019-08-05 11:21:13,064 INFO L226 Difference]: Without dead ends: 105 [2019-08-05 11:21:13,065 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-08-05 11:21:13,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-08-05 11:21:13,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2019-08-05 11:21:13,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-08-05 11:21:13,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2019-08-05 11:21:13,067 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 103 [2019-08-05 11:21:13,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:13,067 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2019-08-05 11:21:13,067 INFO L476 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-08-05 11:21:13,068 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2019-08-05 11:21:13,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-08-05 11:21:13,068 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:13,068 INFO L399 BasicCegarLoop]: trace histogram [100, 1, 1, 1, 1] [2019-08-05 11:21:13,068 INFO L418 AbstractCegarLoop]: === Iteration 102 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:13,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:13,069 INFO L82 PathProgramCache]: Analyzing trace with hash 1010835848, now seen corresponding path program 99 times [2019-08-05 11:21:13,069 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:13,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:13,092 INFO L256 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 102 conjunts are in the unsatisfiable core [2019-08-05 11:21:13,093 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:16,682 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 11:21:16,683 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:16,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102] total 102 [2019-08-05 11:21:16,683 INFO L454 AbstractCegarLoop]: Interpolant automaton has 103 states [2019-08-05 11:21:16,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2019-08-05 11:21:16,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2019-08-05 11:21:16,685 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 103 states. [2019-08-05 11:21:16,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:16,849 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2019-08-05 11:21:16,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-08-05 11:21:16,850 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 104 [2019-08-05 11:21:16,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:16,851 INFO L225 Difference]: With dead ends: 106 [2019-08-05 11:21:16,851 INFO L226 Difference]: Without dead ends: 106 [2019-08-05 11:21:16,852 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2019-08-05 11:21:16,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-08-05 11:21:16,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2019-08-05 11:21:16,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-08-05 11:21:16,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2019-08-05 11:21:16,855 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 104 [2019-08-05 11:21:16,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:16,855 INFO L475 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2019-08-05 11:21:16,855 INFO L476 AbstractCegarLoop]: Interpolant automaton has 103 states. [2019-08-05 11:21:16,855 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2019-08-05 11:21:16,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-08-05 11:21:16,856 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:16,856 INFO L399 BasicCegarLoop]: trace histogram [101, 1, 1, 1, 1] [2019-08-05 11:21:16,856 INFO L418 AbstractCegarLoop]: === Iteration 103 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:16,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:16,857 INFO L82 PathProgramCache]: Analyzing trace with hash 1271078690, now seen corresponding path program 100 times [2019-08-05 11:21:16,857 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:16,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:16,877 INFO L256 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 103 conjunts are in the unsatisfiable core [2019-08-05 11:21:16,878 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:20,793 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 11:21:20,794 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:20,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2019-08-05 11:21:20,794 INFO L454 AbstractCegarLoop]: Interpolant automaton has 104 states [2019-08-05 11:21:20,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2019-08-05 11:21:20,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-08-05 11:21:20,796 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 104 states. [2019-08-05 11:21:20,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:20,989 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2019-08-05 11:21:20,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-08-05 11:21:20,989 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 105 [2019-08-05 11:21:20,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:20,991 INFO L225 Difference]: With dead ends: 107 [2019-08-05 11:21:20,991 INFO L226 Difference]: Without dead ends: 107 [2019-08-05 11:21:20,992 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-08-05 11:21:20,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-08-05 11:21:20,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-08-05 11:21:20,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-08-05 11:21:20,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2019-08-05 11:21:20,994 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 105 [2019-08-05 11:21:20,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:20,994 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2019-08-05 11:21:20,994 INFO L476 AbstractCegarLoop]: Interpolant automaton has 104 states. [2019-08-05 11:21:20,994 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2019-08-05 11:21:20,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-08-05 11:21:20,995 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:20,995 INFO L399 BasicCegarLoop]: trace histogram [102, 1, 1, 1, 1] [2019-08-05 11:21:20,995 INFO L418 AbstractCegarLoop]: === Iteration 104 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:20,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:20,996 INFO L82 PathProgramCache]: Analyzing trace with hash 748672200, now seen corresponding path program 101 times [2019-08-05 11:21:20,996 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:21,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:21,019 INFO L256 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 104 conjunts are in the unsatisfiable core [2019-08-05 11:21:21,021 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:25,347 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 11:21:25,348 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:25,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104] total 104 [2019-08-05 11:21:25,348 INFO L454 AbstractCegarLoop]: Interpolant automaton has 105 states [2019-08-05 11:21:25,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2019-08-05 11:21:25,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5460, Invalid=5460, Unknown=0, NotChecked=0, Total=10920 [2019-08-05 11:21:25,351 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 105 states. [2019-08-05 11:21:25,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:25,543 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2019-08-05 11:21:25,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-08-05 11:21:25,544 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 106 [2019-08-05 11:21:25,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:25,545 INFO L225 Difference]: With dead ends: 108 [2019-08-05 11:21:25,545 INFO L226 Difference]: Without dead ends: 108 [2019-08-05 11:21:25,545 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=5460, Invalid=5460, Unknown=0, NotChecked=0, Total=10920 [2019-08-05 11:21:25,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-08-05 11:21:25,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2019-08-05 11:21:25,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-08-05 11:21:25,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2019-08-05 11:21:25,550 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 106 [2019-08-05 11:21:25,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:25,550 INFO L475 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2019-08-05 11:21:25,550 INFO L476 AbstractCegarLoop]: Interpolant automaton has 105 states. [2019-08-05 11:21:25,550 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2019-08-05 11:21:25,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-08-05 11:21:25,551 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:25,551 INFO L399 BasicCegarLoop]: trace histogram [103, 1, 1, 1, 1] [2019-08-05 11:21:25,551 INFO L418 AbstractCegarLoop]: === Iteration 105 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:25,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:25,551 INFO L82 PathProgramCache]: Analyzing trace with hash 1733940194, now seen corresponding path program 102 times [2019-08-05 11:21:25,552 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:25,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:25,569 INFO L256 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 105 conjunts are in the unsatisfiable core [2019-08-05 11:21:25,571 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:29,617 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 11:21:29,618 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:29,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2019-08-05 11:21:29,618 INFO L454 AbstractCegarLoop]: Interpolant automaton has 106 states [2019-08-05 11:21:29,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2019-08-05 11:21:29,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-08-05 11:21:29,619 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand 106 states. [2019-08-05 11:21:29,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:29,820 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2019-08-05 11:21:29,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2019-08-05 11:21:29,821 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 107 [2019-08-05 11:21:29,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:29,822 INFO L225 Difference]: With dead ends: 109 [2019-08-05 11:21:29,822 INFO L226 Difference]: Without dead ends: 109 [2019-08-05 11:21:29,822 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-08-05 11:21:29,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-08-05 11:21:29,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2019-08-05 11:21:29,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-08-05 11:21:29,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2019-08-05 11:21:29,824 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 107 [2019-08-05 11:21:29,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:29,824 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2019-08-05 11:21:29,825 INFO L476 AbstractCegarLoop]: Interpolant automaton has 106 states. [2019-08-05 11:21:29,825 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2019-08-05 11:21:29,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-08-05 11:21:29,825 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:29,825 INFO L399 BasicCegarLoop]: trace histogram [104, 1, 1, 1, 1] [2019-08-05 11:21:29,826 INFO L418 AbstractCegarLoop]: === Iteration 106 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:29,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:29,826 INFO L82 PathProgramCache]: Analyzing trace with hash -2082490360, now seen corresponding path program 103 times [2019-08-05 11:21:29,826 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:29,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:29,847 INFO L256 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 106 conjunts are in the unsatisfiable core [2019-08-05 11:21:29,849 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:34,070 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 11:21:34,070 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:34,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106] total 106 [2019-08-05 11:21:34,071 INFO L454 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-08-05 11:21:34,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-08-05 11:21:34,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5671, Invalid=5671, Unknown=0, NotChecked=0, Total=11342 [2019-08-05 11:21:34,072 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 107 states. [2019-08-05 11:21:34,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:34,242 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2019-08-05 11:21:34,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2019-08-05 11:21:34,243 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 108 [2019-08-05 11:21:34,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:34,243 INFO L225 Difference]: With dead ends: 110 [2019-08-05 11:21:34,243 INFO L226 Difference]: Without dead ends: 110 [2019-08-05 11:21:34,244 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5671, Invalid=5671, Unknown=0, NotChecked=0, Total=11342 [2019-08-05 11:21:34,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-08-05 11:21:34,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2019-08-05 11:21:34,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-08-05 11:21:34,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2019-08-05 11:21:34,247 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 108 [2019-08-05 11:21:34,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:34,247 INFO L475 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2019-08-05 11:21:34,248 INFO L476 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-08-05 11:21:34,248 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2019-08-05 11:21:34,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-08-05 11:21:34,248 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:34,248 INFO L399 BasicCegarLoop]: trace histogram [105, 1, 1, 1, 1] [2019-08-05 11:21:34,249 INFO L418 AbstractCegarLoop]: === Iteration 107 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:34,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:34,249 INFO L82 PathProgramCache]: Analyzing trace with hash -132753246, now seen corresponding path program 104 times [2019-08-05 11:21:34,250 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:34,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:34,273 INFO L256 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 107 conjunts are in the unsatisfiable core [2019-08-05 11:21:34,275 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:38,494 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 11:21:38,494 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:38,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107] total 107 [2019-08-05 11:21:38,494 INFO L454 AbstractCegarLoop]: Interpolant automaton has 108 states [2019-08-05 11:21:38,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2019-08-05 11:21:38,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-08-05 11:21:38,496 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand 108 states. [2019-08-05 11:21:38,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:38,713 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2019-08-05 11:21:38,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2019-08-05 11:21:38,714 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 109 [2019-08-05 11:21:38,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:38,714 INFO L225 Difference]: With dead ends: 111 [2019-08-05 11:21:38,715 INFO L226 Difference]: Without dead ends: 111 [2019-08-05 11:21:38,715 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-08-05 11:21:38,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-08-05 11:21:38,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-08-05 11:21:38,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-08-05 11:21:38,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2019-08-05 11:21:38,718 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 109 [2019-08-05 11:21:38,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:38,719 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2019-08-05 11:21:38,719 INFO L476 AbstractCegarLoop]: Interpolant automaton has 108 states. [2019-08-05 11:21:38,719 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2019-08-05 11:21:38,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-08-05 11:21:38,720 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:38,720 INFO L399 BasicCegarLoop]: trace histogram [106, 1, 1, 1, 1] [2019-08-05 11:21:38,720 INFO L418 AbstractCegarLoop]: === Iteration 108 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:38,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:38,720 INFO L82 PathProgramCache]: Analyzing trace with hash 179555144, now seen corresponding path program 105 times [2019-08-05 11:21:38,720 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:38,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:38,737 INFO L256 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 108 conjunts are in the unsatisfiable core [2019-08-05 11:21:38,738 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:42,636 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 11:21:42,636 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:42,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108] total 108 [2019-08-05 11:21:42,637 INFO L454 AbstractCegarLoop]: Interpolant automaton has 109 states [2019-08-05 11:21:42,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2019-08-05 11:21:42,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5886, Invalid=5886, Unknown=0, NotChecked=0, Total=11772 [2019-08-05 11:21:42,638 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 109 states. [2019-08-05 11:21:42,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:42,843 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2019-08-05 11:21:42,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2019-08-05 11:21:42,844 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 110 [2019-08-05 11:21:42,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:42,844 INFO L225 Difference]: With dead ends: 112 [2019-08-05 11:21:42,844 INFO L226 Difference]: Without dead ends: 112 [2019-08-05 11:21:42,845 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=5886, Invalid=5886, Unknown=0, NotChecked=0, Total=11772 [2019-08-05 11:21:42,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-08-05 11:21:42,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2019-08-05 11:21:42,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-08-05 11:21:42,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2019-08-05 11:21:42,846 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 110 [2019-08-05 11:21:42,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:42,846 INFO L475 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2019-08-05 11:21:42,847 INFO L476 AbstractCegarLoop]: Interpolant automaton has 109 states. [2019-08-05 11:21:42,847 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2019-08-05 11:21:42,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-08-05 11:21:42,847 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:42,848 INFO L399 BasicCegarLoop]: trace histogram [107, 1, 1, 1, 1] [2019-08-05 11:21:42,848 INFO L418 AbstractCegarLoop]: === Iteration 109 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:42,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:42,848 INFO L82 PathProgramCache]: Analyzing trace with hash 1271180642, now seen corresponding path program 106 times [2019-08-05 11:21:42,849 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:42,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:42,884 INFO L256 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 109 conjunts are in the unsatisfiable core [2019-08-05 11:21:42,886 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:47,064 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 11:21:47,064 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:47,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109] total 109 [2019-08-05 11:21:47,065 INFO L454 AbstractCegarLoop]: Interpolant automaton has 110 states [2019-08-05 11:21:47,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2019-08-05 11:21:47,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-08-05 11:21:47,066 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 110 states. [2019-08-05 11:21:47,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:47,299 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2019-08-05 11:21:47,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2019-08-05 11:21:47,300 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 111 [2019-08-05 11:21:47,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:47,301 INFO L225 Difference]: With dead ends: 113 [2019-08-05 11:21:47,301 INFO L226 Difference]: Without dead ends: 113 [2019-08-05 11:21:47,301 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-08-05 11:21:47,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-08-05 11:21:47,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2019-08-05 11:21:47,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-08-05 11:21:47,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2019-08-05 11:21:47,303 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 111 [2019-08-05 11:21:47,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:47,304 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2019-08-05 11:21:47,304 INFO L476 AbstractCegarLoop]: Interpolant automaton has 110 states. [2019-08-05 11:21:47,304 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2019-08-05 11:21:47,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-08-05 11:21:47,304 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:47,304 INFO L399 BasicCegarLoop]: trace histogram [108, 1, 1, 1, 1] [2019-08-05 11:21:47,305 INFO L418 AbstractCegarLoop]: === Iteration 110 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:47,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:47,305 INFO L82 PathProgramCache]: Analyzing trace with hash 751832712, now seen corresponding path program 107 times [2019-08-05 11:21:47,305 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:47,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:47,324 INFO L256 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 110 conjunts are in the unsatisfiable core [2019-08-05 11:21:47,325 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:51,764 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 11:21:51,765 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:51,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110] total 110 [2019-08-05 11:21:51,765 INFO L454 AbstractCegarLoop]: Interpolant automaton has 111 states [2019-08-05 11:21:51,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2019-08-05 11:21:51,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6105, Invalid=6105, Unknown=0, NotChecked=0, Total=12210 [2019-08-05 11:21:51,767 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 111 states. [2019-08-05 11:21:51,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:51,944 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2019-08-05 11:21:51,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2019-08-05 11:21:51,945 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 112 [2019-08-05 11:21:51,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:51,945 INFO L225 Difference]: With dead ends: 114 [2019-08-05 11:21:51,946 INFO L226 Difference]: Without dead ends: 114 [2019-08-05 11:21:51,946 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=6105, Invalid=6105, Unknown=0, NotChecked=0, Total=12210 [2019-08-05 11:21:51,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-08-05 11:21:51,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2019-08-05 11:21:51,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-08-05 11:21:51,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 114 transitions. [2019-08-05 11:21:51,949 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 114 transitions. Word has length 112 [2019-08-05 11:21:51,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:51,949 INFO L475 AbstractCegarLoop]: Abstraction has 114 states and 114 transitions. [2019-08-05 11:21:51,949 INFO L476 AbstractCegarLoop]: Interpolant automaton has 111 states. [2019-08-05 11:21:51,950 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 114 transitions. [2019-08-05 11:21:51,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-08-05 11:21:51,950 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:51,950 INFO L399 BasicCegarLoop]: trace histogram [109, 1, 1, 1, 1] [2019-08-05 11:21:51,950 INFO L418 AbstractCegarLoop]: === Iteration 111 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:51,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:51,951 INFO L82 PathProgramCache]: Analyzing trace with hash 1831916066, now seen corresponding path program 108 times [2019-08-05 11:21:51,951 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:51,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:51,973 INFO L256 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 111 conjunts are in the unsatisfiable core [2019-08-05 11:21:51,974 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:56,447 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 11:21:56,447 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:56,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111] total 111 [2019-08-05 11:21:56,448 INFO L454 AbstractCegarLoop]: Interpolant automaton has 112 states [2019-08-05 11:21:56,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2019-08-05 11:21:56,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-08-05 11:21:56,449 INFO L87 Difference]: Start difference. First operand 114 states and 114 transitions. Second operand 112 states. [2019-08-05 11:21:56,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:56,629 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2019-08-05 11:21:56,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2019-08-05 11:21:56,630 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 113 [2019-08-05 11:21:56,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:56,630 INFO L225 Difference]: With dead ends: 115 [2019-08-05 11:21:56,630 INFO L226 Difference]: Without dead ends: 115 [2019-08-05 11:21:56,631 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-08-05 11:21:56,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-08-05 11:21:56,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2019-08-05 11:21:56,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-08-05 11:21:56,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2019-08-05 11:21:56,634 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 113 [2019-08-05 11:21:56,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:56,634 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2019-08-05 11:21:56,635 INFO L476 AbstractCegarLoop]: Interpolant automaton has 112 states. [2019-08-05 11:21:56,635 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2019-08-05 11:21:56,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-08-05 11:21:56,635 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:56,635 INFO L399 BasicCegarLoop]: trace histogram [110, 1, 1, 1, 1] [2019-08-05 11:21:56,636 INFO L418 AbstractCegarLoop]: === Iteration 112 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:56,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:56,636 INFO L82 PathProgramCache]: Analyzing trace with hash 954761672, now seen corresponding path program 109 times [2019-08-05 11:21:56,636 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:56,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:56,663 INFO L256 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 112 conjunts are in the unsatisfiable core [2019-08-05 11:21:56,664 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:22:01,051 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 11:22:01,051 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:22:01,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [112] total 112 [2019-08-05 11:22:01,052 INFO L454 AbstractCegarLoop]: Interpolant automaton has 113 states [2019-08-05 11:22:01,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2019-08-05 11:22:01,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6328, Invalid=6328, Unknown=0, NotChecked=0, Total=12656 [2019-08-05 11:22:01,053 INFO L87 Difference]: Start difference. First operand 115 states and 115 transitions. Second operand 113 states. [2019-08-05 11:22:01,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:22:01,281 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2019-08-05 11:22:01,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2019-08-05 11:22:01,281 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 114 [2019-08-05 11:22:01,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:22:01,282 INFO L225 Difference]: With dead ends: 116 [2019-08-05 11:22:01,282 INFO L226 Difference]: Without dead ends: 116 [2019-08-05 11:22:01,283 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=6328, Invalid=6328, Unknown=0, NotChecked=0, Total=12656 [2019-08-05 11:22:01,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-08-05 11:22:01,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2019-08-05 11:22:01,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-08-05 11:22:01,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 116 transitions. [2019-08-05 11:22:01,285 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 116 transitions. Word has length 114 [2019-08-05 11:22:01,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:22:01,286 INFO L475 AbstractCegarLoop]: Abstraction has 116 states and 116 transitions. [2019-08-05 11:22:01,286 INFO L476 AbstractCegarLoop]: Interpolant automaton has 113 states. [2019-08-05 11:22:01,286 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2019-08-05 11:22:01,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-08-05 11:22:01,287 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:22:01,287 INFO L399 BasicCegarLoop]: trace histogram [111, 1, 1, 1, 1] [2019-08-05 11:22:01,287 INFO L418 AbstractCegarLoop]: === Iteration 113 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:22:01,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:22:01,287 INFO L82 PathProgramCache]: Analyzing trace with hash -467220766, now seen corresponding path program 110 times [2019-08-05 11:22:01,288 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:22:01,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:22:01,314 INFO L256 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 113 conjunts are in the unsatisfiable core [2019-08-05 11:22:01,315 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:22:05,890 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 11:22:05,891 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:22:05,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113] total 113 [2019-08-05 11:22:05,891 INFO L454 AbstractCegarLoop]: Interpolant automaton has 114 states [2019-08-05 11:22:05,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2019-08-05 11:22:05,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-08-05 11:22:05,892 INFO L87 Difference]: Start difference. First operand 116 states and 116 transitions. Second operand 114 states. [2019-08-05 11:22:06,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:22:06,088 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2019-08-05 11:22:06,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2019-08-05 11:22:06,089 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 115 [2019-08-05 11:22:06,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:22:06,090 INFO L225 Difference]: With dead ends: 117 [2019-08-05 11:22:06,090 INFO L226 Difference]: Without dead ends: 117 [2019-08-05 11:22:06,090 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-08-05 11:22:06,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-08-05 11:22:06,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2019-08-05 11:22:06,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-08-05 11:22:06,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2019-08-05 11:22:06,092 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 115 [2019-08-05 11:22:06,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:22:06,093 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2019-08-05 11:22:06,093 INFO L476 AbstractCegarLoop]: Interpolant automaton has 114 states. [2019-08-05 11:22:06,093 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2019-08-05 11:22:06,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-08-05 11:22:06,094 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:22:06,094 INFO L399 BasicCegarLoop]: trace histogram [112, 1, 1, 1, 1] [2019-08-05 11:22:06,094 INFO L418 AbstractCegarLoop]: === Iteration 114 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:22:06,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:22:06,094 INFO L82 PathProgramCache]: Analyzing trace with hash -1599003384, now seen corresponding path program 111 times [2019-08-05 11:22:06,095 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:22:06,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:22:06,111 INFO L256 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 114 conjunts are in the unsatisfiable core [2019-08-05 11:22:06,112 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:22:10,411 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 11:22:10,411 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:22:10,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [114] total 114 [2019-08-05 11:22:10,412 INFO L454 AbstractCegarLoop]: Interpolant automaton has 115 states [2019-08-05 11:22:10,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2019-08-05 11:22:10,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6555, Invalid=6555, Unknown=0, NotChecked=0, Total=13110 [2019-08-05 11:22:10,413 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 115 states. [2019-08-05 11:22:10,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:22:10,603 INFO L93 Difference]: Finished difference Result 118 states and 118 transitions. [2019-08-05 11:22:10,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2019-08-05 11:22:10,604 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 116 [2019-08-05 11:22:10,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:22:10,604 INFO L225 Difference]: With dead ends: 118 [2019-08-05 11:22:10,604 INFO L226 Difference]: Without dead ends: 118 [2019-08-05 11:22:10,605 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=6555, Invalid=6555, Unknown=0, NotChecked=0, Total=13110 [2019-08-05 11:22:10,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-08-05 11:22:10,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2019-08-05 11:22:10,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-08-05 11:22:10,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 118 transitions. [2019-08-05 11:22:10,607 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 118 transitions. Word has length 116 [2019-08-05 11:22:10,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:22:10,608 INFO L475 AbstractCegarLoop]: Abstraction has 118 states and 118 transitions. [2019-08-05 11:22:10,608 INFO L476 AbstractCegarLoop]: Interpolant automaton has 115 states. [2019-08-05 11:22:10,608 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 118 transitions. [2019-08-05 11:22:10,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-08-05 11:22:10,608 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:22:10,608 INFO L399 BasicCegarLoop]: trace histogram [113, 1, 1, 1, 1] [2019-08-05 11:22:10,609 INFO L418 AbstractCegarLoop]: === Iteration 115 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:22:10,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:22:10,609 INFO L82 PathProgramCache]: Analyzing trace with hash 1970441122, now seen corresponding path program 112 times [2019-08-05 11:22:10,609 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:22:10,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:22:10,626 INFO L256 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 115 conjunts are in the unsatisfiable core [2019-08-05 11:22:10,626 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:22:15,354 INFO L134 CoverageAnalysis]: Checked inductivity of 6441 backedges. 0 proven. 6441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:22:15,354 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:22:15,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115] total 115 [2019-08-05 11:22:15,354 INFO L454 AbstractCegarLoop]: Interpolant automaton has 116 states [2019-08-05 11:22:15,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2019-08-05 11:22:15,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2019-08-05 11:22:15,356 INFO L87 Difference]: Start difference. First operand 118 states and 118 transitions. Second operand 116 states. [2019-08-05 11:22:15,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:22:15,614 INFO L93 Difference]: Finished difference Result 119 states and 119 transitions. [2019-08-05 11:22:15,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2019-08-05 11:22:15,615 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 117 [2019-08-05 11:22:15,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:22:15,616 INFO L225 Difference]: With dead ends: 119 [2019-08-05 11:22:15,616 INFO L226 Difference]: Without dead ends: 119 [2019-08-05 11:22:15,617 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2019-08-05 11:22:15,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-08-05 11:22:15,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2019-08-05 11:22:15,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-08-05 11:22:15,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 119 transitions. [2019-08-05 11:22:15,619 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 119 transitions. Word has length 117 [2019-08-05 11:22:15,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:22:15,619 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 119 transitions. [2019-08-05 11:22:15,619 INFO L476 AbstractCegarLoop]: Interpolant automaton has 116 states. [2019-08-05 11:22:15,620 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 119 transitions. [2019-08-05 11:22:15,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-08-05 11:22:15,620 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:22:15,620 INFO L399 BasicCegarLoop]: trace histogram [114, 1, 1, 1, 1] [2019-08-05 11:22:15,620 INFO L418 AbstractCegarLoop]: === Iteration 116 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:22:15,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:22:15,621 INFO L82 PathProgramCache]: Analyzing trace with hash 954071112, now seen corresponding path program 113 times [2019-08-05 11:22:15,621 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:22:15,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:22:15,644 INFO L256 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 116 conjunts are in the unsatisfiable core [2019-08-05 11:22:15,645 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:22:20,264 INFO L134 CoverageAnalysis]: Checked inductivity of 6555 backedges. 0 proven. 6555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:22:20,264 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:22:20,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [116] total 116 [2019-08-05 11:22:20,265 INFO L454 AbstractCegarLoop]: Interpolant automaton has 117 states [2019-08-05 11:22:20,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2019-08-05 11:22:20,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6786, Invalid=6786, Unknown=0, NotChecked=0, Total=13572 [2019-08-05 11:22:20,266 INFO L87 Difference]: Start difference. First operand 119 states and 119 transitions. Second operand 117 states. [2019-08-05 11:22:20,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:22:20,471 INFO L93 Difference]: Finished difference Result 120 states and 120 transitions. [2019-08-05 11:22:20,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2019-08-05 11:22:20,471 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 118 [2019-08-05 11:22:20,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:22:20,472 INFO L225 Difference]: With dead ends: 120 [2019-08-05 11:22:20,472 INFO L226 Difference]: Without dead ends: 120 [2019-08-05 11:22:20,473 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=6786, Invalid=6786, Unknown=0, NotChecked=0, Total=13572 [2019-08-05 11:22:20,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-08-05 11:22:20,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2019-08-05 11:22:20,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-08-05 11:22:20,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 120 transitions. [2019-08-05 11:22:20,475 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 120 transitions. Word has length 118 [2019-08-05 11:22:20,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:22:20,475 INFO L475 AbstractCegarLoop]: Abstraction has 120 states and 120 transitions. [2019-08-05 11:22:20,475 INFO L476 AbstractCegarLoop]: Interpolant automaton has 117 states. [2019-08-05 11:22:20,475 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 120 transitions. [2019-08-05 11:22:20,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-08-05 11:22:20,476 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:22:20,476 INFO L399 BasicCegarLoop]: trace histogram [115, 1, 1, 1, 1] [2019-08-05 11:22:20,476 INFO L418 AbstractCegarLoop]: === Iteration 117 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:22:20,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:22:20,477 INFO L82 PathProgramCache]: Analyzing trace with hash -488628126, now seen corresponding path program 114 times [2019-08-05 11:22:20,477 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:22:20,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:22:20,503 INFO L256 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 117 conjunts are in the unsatisfiable core [2019-08-05 11:22:20,504 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:22:25,367 INFO L134 CoverageAnalysis]: Checked inductivity of 6670 backedges. 0 proven. 6670 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:22:25,367 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:22:25,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [117] total 117 [2019-08-05 11:22:25,368 INFO L454 AbstractCegarLoop]: Interpolant automaton has 118 states [2019-08-05 11:22:25,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2019-08-05 11:22:25,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2019-08-05 11:22:25,369 INFO L87 Difference]: Start difference. First operand 120 states and 120 transitions. Second operand 118 states. [2019-08-05 11:22:25,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:22:25,587 INFO L93 Difference]: Finished difference Result 121 states and 121 transitions. [2019-08-05 11:22:25,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2019-08-05 11:22:25,587 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 119 [2019-08-05 11:22:25,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:22:25,588 INFO L225 Difference]: With dead ends: 121 [2019-08-05 11:22:25,588 INFO L226 Difference]: Without dead ends: 121 [2019-08-05 11:22:25,589 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2019-08-05 11:22:25,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-08-05 11:22:25,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2019-08-05 11:22:25,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-08-05 11:22:25,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2019-08-05 11:22:25,591 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 119 [2019-08-05 11:22:25,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:22:25,591 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2019-08-05 11:22:25,592 INFO L476 AbstractCegarLoop]: Interpolant automaton has 118 states. [2019-08-05 11:22:25,592 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2019-08-05 11:22:25,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-08-05 11:22:25,592 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:22:25,592 INFO L399 BasicCegarLoop]: trace histogram [116, 1, 1, 1, 1] [2019-08-05 11:22:25,593 INFO L418 AbstractCegarLoop]: === Iteration 118 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:22:25,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:22:25,593 INFO L82 PathProgramCache]: Analyzing trace with hash 2032335752, now seen corresponding path program 115 times [2019-08-05 11:22:25,594 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:22:25,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:22:25,612 INFO L256 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 118 conjunts are in the unsatisfiable core [2019-08-05 11:22:25,613 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:22:30,434 INFO L134 CoverageAnalysis]: Checked inductivity of 6786 backedges. 0 proven. 6786 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:22:30,434 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:22:30,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [118] total 118 [2019-08-05 11:22:30,435 INFO L454 AbstractCegarLoop]: Interpolant automaton has 119 states [2019-08-05 11:22:30,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2019-08-05 11:22:30,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7021, Invalid=7021, Unknown=0, NotChecked=0, Total=14042 [2019-08-05 11:22:30,436 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 119 states. [2019-08-05 11:22:30,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:22:30,648 INFO L93 Difference]: Finished difference Result 122 states and 122 transitions. [2019-08-05 11:22:30,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2019-08-05 11:22:30,649 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 120 [2019-08-05 11:22:30,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:22:30,649 INFO L225 Difference]: With dead ends: 122 [2019-08-05 11:22:30,649 INFO L226 Difference]: Without dead ends: 122 [2019-08-05 11:22:30,650 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=7021, Invalid=7021, Unknown=0, NotChecked=0, Total=14042 [2019-08-05 11:22:30,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-08-05 11:22:30,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2019-08-05 11:22:30,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-08-05 11:22:30,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 122 transitions. [2019-08-05 11:22:30,652 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 122 transitions. Word has length 120 [2019-08-05 11:22:30,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:22:30,653 INFO L475 AbstractCegarLoop]: Abstraction has 122 states and 122 transitions. [2019-08-05 11:22:30,653 INFO L476 AbstractCegarLoop]: Interpolant automaton has 119 states. [2019-08-05 11:22:30,653 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 122 transitions. [2019-08-05 11:22:30,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-08-05 11:22:30,654 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:22:30,654 INFO L399 BasicCegarLoop]: trace histogram [117, 1, 1, 1, 1] [2019-08-05 11:22:30,654 INFO L418 AbstractCegarLoop]: === Iteration 119 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:22:30,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:22:30,654 INFO L82 PathProgramCache]: Analyzing trace with hash -1422162654, now seen corresponding path program 116 times [2019-08-05 11:22:30,655 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:22:30,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:22:30,680 INFO L256 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 119 conjunts are in the unsatisfiable core [2019-08-05 11:22:30,682 INFO L279 TraceCheckSpWp]: Computing forward predicates... Received shutdown request... [2019-08-05 11:22:34,127 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2019-08-05 11:22:34,127 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-05 11:22:34,131 WARN L223 ceAbstractionStarter]: Timeout [2019-08-05 11:22:34,132 INFO L202 PluginConnector]: Adding new model oneLoopArray.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 11:22:34 BoogieIcfgContainer [2019-08-05 11:22:34,132 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 11:22:34,134 INFO L168 Benchmark]: Toolchain (without parser) took 238778.55 ms. Allocated memory was 133.7 MB in the beginning and 656.4 MB in the end (delta: 522.7 MB). Free memory was 109.9 MB in the beginning and 328.7 MB in the end (delta: -218.7 MB). Peak memory consumption was 304.0 MB. Max. memory is 7.1 GB. [2019-08-05 11:22:34,135 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 133.7 MB. Free memory was 111.2 MB in the beginning and 111.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-08-05 11:22:34,135 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.97 ms. Allocated memory is still 133.7 MB. Free memory was 109.9 MB in the beginning and 108.0 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-08-05 11:22:34,136 INFO L168 Benchmark]: Boogie Preprocessor took 27.72 ms. Allocated memory is still 133.7 MB. Free memory was 108.0 MB in the beginning and 106.9 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-08-05 11:22:34,136 INFO L168 Benchmark]: RCFGBuilder took 298.43 ms. Allocated memory is still 133.7 MB. Free memory was 106.9 MB in the beginning and 97.6 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. [2019-08-05 11:22:34,137 INFO L168 Benchmark]: TraceAbstraction took 238408.25 ms. Allocated memory was 133.7 MB in the beginning and 656.4 MB in the end (delta: 522.7 MB). Free memory was 97.4 MB in the beginning and 328.7 MB in the end (delta: -231.2 MB). Peak memory consumption was 291.5 MB. Max. memory is 7.1 GB. [2019-08-05 11:22:34,140 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 133.7 MB. Free memory was 111.2 MB in the beginning and 111.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 39.97 ms. Allocated memory is still 133.7 MB. Free memory was 109.9 MB in the beginning and 108.0 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 27.72 ms. Allocated memory is still 133.7 MB. Free memory was 108.0 MB in the beginning and 106.9 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 298.43 ms. Allocated memory is still 133.7 MB. Free memory was 106.9 MB in the beginning and 97.6 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 238408.25 ms. Allocated memory was 133.7 MB in the beginning and 656.4 MB in the end (delta: 522.7 MB). Free memory was 97.4 MB in the beginning and 328.7 MB in the end (delta: -231.2 MB). Peak memory consumption was 291.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 19]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 19). Cancelled while BasicCegarLoop was analyzing trace of length 122 with TraceHistMax 117,while TraceCheckSpWp was constructing forward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 100 known predicates. - TimeoutResultAtElement [Line: 20]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 20). Cancelled while BasicCegarLoop was analyzing trace of length 122 with TraceHistMax 117,while TraceCheckSpWp was constructing forward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 100 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 2 error locations. TIMEOUT Result, 238.3s OverallTime, 119 OverallIterations, 117 TraceHistogramMax, 15.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 473 SDtfs, 5 SDslu, 1815 SDs, 0 SdLazy, 10656 SolverSat, 227 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 7139 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 6905 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 214.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=122occurred in iteration=118, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 118 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 216.7s InterpolantComputationTime, 7257 NumberOfCodeBlocks, 7257 NumberOfCodeBlocksAsserted, 118 NumberOfCheckSat, 7139 ConstructedInterpolants, 0 QuantifiedInterpolants, 1677927 SizeOfPredicates, 117 NumberOfNonLiveVariables, 28208 ConjunctsInSsa, 7024 ConjunctsInUnsatCore, 118 InterpolantComputations, 2 PerfectInterpolantSequences, 3/266919 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown