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/oneLoopTwoBackbones.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 11:18:04,376 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 11:18:04,378 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 11:18:04,390 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 11:18:04,391 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 11:18:04,392 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 11:18:04,393 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 11:18:04,395 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 11:18:04,397 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 11:18:04,398 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 11:18:04,399 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 11:18:04,399 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 11:18:04,400 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 11:18:04,401 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 11:18:04,402 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 11:18:04,403 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 11:18:04,404 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 11:18:04,405 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 11:18:04,406 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 11:18:04,409 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 11:18:04,410 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 11:18:04,411 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 11:18:04,413 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 11:18:04,414 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 11:18:04,417 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 11:18:04,417 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 11:18:04,417 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 11:18:04,418 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 11:18:04,419 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 11:18:04,420 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 11:18:04,420 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 11:18:04,421 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 11:18:04,422 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 11:18:04,423 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 11:18:04,424 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 11:18:04,424 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 11:18:04,425 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 11:18:04,425 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 11:18:04,426 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 11:18:04,427 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 11:18:04,427 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 11:18:04,455 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 11:18:04,469 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 11:18:04,472 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 11:18:04,474 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 11:18:04,475 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 11:18:04,476 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/loopAcceleration/loopAccelerationWerner/oneLoopTwoBackbones.bpl [2019-08-05 11:18:04,477 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/loopAcceleration/loopAccelerationWerner/oneLoopTwoBackbones.bpl' [2019-08-05 11:18:04,511 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 11:18:04,512 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 11:18:04,513 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 11:18:04,513 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 11:18:04,513 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 11:18:04,530 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "oneLoopTwoBackbones.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:18:04" (1/1) ... [2019-08-05 11:18:04,538 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "oneLoopTwoBackbones.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:18:04" (1/1) ... [2019-08-05 11:18:04,543 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 11:18:04,544 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 11:18:04,544 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 11:18:04,546 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 11:18:04,547 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 11:18:04,547 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 11:18:04,547 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 11:18:04,557 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "oneLoopTwoBackbones.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:18:04" (1/1) ... [2019-08-05 11:18:04,558 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "oneLoopTwoBackbones.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:18:04" (1/1) ... [2019-08-05 11:18:04,558 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "oneLoopTwoBackbones.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:18:04" (1/1) ... [2019-08-05 11:18:04,559 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "oneLoopTwoBackbones.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:18:04" (1/1) ... [2019-08-05 11:18:04,561 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "oneLoopTwoBackbones.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:18:04" (1/1) ... [2019-08-05 11:18:04,567 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "oneLoopTwoBackbones.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:18:04" (1/1) ... [2019-08-05 11:18:04,568 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "oneLoopTwoBackbones.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:18:04" (1/1) ... [2019-08-05 11:18:04,569 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 11:18:04,570 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 11:18:04,570 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 11:18:04,570 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 11:18:04,571 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "oneLoopTwoBackbones.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:18:04" (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:04,631 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2019-08-05 11:18:04,632 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-08-05 11:18:04,632 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-08-05 11:18:04,962 INFO L275 CfgBuilder]: Using library mode [2019-08-05 11:18:04,962 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 11:18:04,963 INFO L202 PluginConnector]: Adding new model oneLoopTwoBackbones.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:18:04 BoogieIcfgContainer [2019-08-05 11:18:04,964 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 11:18:04,965 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 11:18:04,965 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 11:18:04,968 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 11:18:04,969 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "oneLoopTwoBackbones.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:18:04" (1/2) ... [2019-08-05 11:18:04,970 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c98c484 and model type oneLoopTwoBackbones.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 11:18:04, skipping insertion in model container [2019-08-05 11:18:04,970 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "oneLoopTwoBackbones.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:18:04" (2/2) ... [2019-08-05 11:18:04,972 INFO L109 eAbstractionObserver]: Analyzing ICFG oneLoopTwoBackbones.bpl [2019-08-05 11:18:04,981 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 11:18:04,989 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-08-05 11:18:05,003 INFO L252 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-08-05 11:18:05,026 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 11:18:05,027 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 11:18:05,027 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 11:18:05,028 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 11:18:05,028 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 11:18:05,028 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 11:18:05,028 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 11:18:05,028 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 11:18:05,029 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 11:18:05,042 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2019-08-05 11:18:05,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 11:18:05,051 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:05,052 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 11:18:05,054 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:05,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:05,059 INFO L82 PathProgramCache]: Analyzing trace with hash 30176, now seen corresponding path program 1 times [2019-08-05 11:18:05,104 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:05,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:05,132 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 11:18:05,136 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:05,210 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:05,213 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:18:05,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 11:18:05,218 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:18:05,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:18:05,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:18:05,248 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2019-08-05 11:18:05,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:05,337 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-05 11:18:05,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:18:05,340 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-05 11:18:05,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:05,352 INFO L225 Difference]: With dead ends: 8 [2019-08-05 11:18:05,352 INFO L226 Difference]: Without dead ends: 7 [2019-08-05 11:18:05,354 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:05,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-05 11:18:05,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-05 11:18:05,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 11:18:05,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-08-05 11:18:05,384 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 3 [2019-08-05 11:18:05,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:05,385 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-08-05 11:18:05,385 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:18:05,385 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-08-05 11:18:05,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 11:18:05,386 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:05,386 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 11:18:05,387 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:05,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:05,387 INFO L82 PathProgramCache]: Analyzing trace with hash 943126, now seen corresponding path program 1 times [2019-08-05 11:18:05,388 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:05,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:05,400 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 11:18:05,400 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:05,538 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:05,538 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:05,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 11:18:05,541 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:18:05,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:18:05,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:18:05,542 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 4 states. [2019-08-05 11:18:05,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:05,679 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-05 11:18:05,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 11:18:05,680 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-08-05 11:18:05,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:05,680 INFO L225 Difference]: With dead ends: 8 [2019-08-05 11:18:05,681 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 11:18:05,682 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:18:05,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 11:18:05,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-05 11:18:05,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 11:18:05,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-08-05 11:18:05,685 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2019-08-05 11:18:05,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:05,685 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-08-05 11:18:05,685 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:18:05,686 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-08-05 11:18:05,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 11:18:05,686 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:05,686 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-08-05 11:18:05,687 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:05,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:05,687 INFO L82 PathProgramCache]: Analyzing trace with hash 29244576, now seen corresponding path program 2 times [2019-08-05 11:18:05,688 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:05,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:05,698 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 11:18:05,699 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:05,805 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:05,805 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:18:05,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 11:18:05,806 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:18:05,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:18:05,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:18:05,807 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 4 states. [2019-08-05 11:18:05,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:05,865 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-08-05 11:18:05,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 11:18:05,866 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-08-05 11:18:05,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:05,867 INFO L225 Difference]: With dead ends: 7 [2019-08-05 11:18:05,867 INFO L226 Difference]: Without dead ends: 7 [2019-08-05 11:18:05,868 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:18:05,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-05 11:18:05,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-05 11:18:05,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 11:18:05,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-08-05 11:18:05,870 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-08-05 11:18:05,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:05,871 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-08-05 11:18:05,871 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:18:05,871 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-08-05 11:18:05,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 11:18:05,872 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:05,872 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-08-05 11:18:05,872 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:05,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:05,873 INFO L82 PathProgramCache]: Analyzing trace with hash 906581902, now seen corresponding path program 1 times [2019-08-05 11:18:05,874 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:05,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:05,886 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 11:18:05,887 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:05,974 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:05,974 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:05,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 11:18:05,975 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 11:18:05,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 11:18:05,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:18:05,976 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 5 states. [2019-08-05 11:18:06,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:06,003 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-05 11:18:06,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:18:06,004 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2019-08-05 11:18:06,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:06,005 INFO L225 Difference]: With dead ends: 8 [2019-08-05 11:18:06,005 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 11:18:06,005 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:06,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 11:18:06,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-05 11:18:06,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 11:18:06,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-08-05 11:18:06,009 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-08-05 11:18:06,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:06,009 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-08-05 11:18:06,010 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 11:18:06,010 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-08-05 11:18:06,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 11:18:06,010 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:06,011 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1] [2019-08-05 11:18:06,011 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:06,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:06,012 INFO L82 PathProgramCache]: Analyzing trace with hash -1960495720, now seen corresponding path program 2 times [2019-08-05 11:18:06,013 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:06,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:06,047 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 11:18:06,049 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:06,176 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:06,177 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:06,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 11:18:06,177 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 11:18:06,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 11:18:06,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:18:06,178 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 6 states. [2019-08-05 11:18:06,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:06,237 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-08-05 11:18:06,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 11:18:06,238 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2019-08-05 11:18:06,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:06,239 INFO L225 Difference]: With dead ends: 9 [2019-08-05 11:18:06,239 INFO L226 Difference]: Without dead ends: 9 [2019-08-05 11:18:06,240 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:18:06,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-05 11:18:06,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-08-05 11:18:06,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 11:18:06,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-08-05 11:18:06,243 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-08-05 11:18:06,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:06,243 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-08-05 11:18:06,243 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 11:18:06,243 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-08-05 11:18:06,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 11:18:06,244 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:06,244 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1] [2019-08-05 11:18:06,244 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:06,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:06,245 INFO L82 PathProgramCache]: Analyzing trace with hash -645588786, now seen corresponding path program 3 times [2019-08-05 11:18:06,246 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:06,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:06,261 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 11:18:06,262 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:06,493 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:06,493 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:06,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 11:18:06,494 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 11:18:06,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 11:18:06,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:18:06,495 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 7 states. [2019-08-05 11:18:06,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:06,525 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-08-05 11:18:06,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 11:18:06,526 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2019-08-05 11:18:06,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:06,527 INFO L225 Difference]: With dead ends: 10 [2019-08-05 11:18:06,527 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 11:18:06,528 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:18:06,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 11:18:06,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-08-05 11:18:06,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 11:18:06,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-08-05 11:18:06,530 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2019-08-05 11:18:06,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:06,532 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-08-05 11:18:06,532 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 11:18:06,532 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-08-05 11:18:06,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 11:18:06,533 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:06,534 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1] [2019-08-05 11:18:06,535 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:06,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:06,535 INFO L82 PathProgramCache]: Analyzing trace with hash 1461820504, now seen corresponding path program 4 times [2019-08-05 11:18:06,536 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:06,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:06,557 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 11:18:06,558 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:06,713 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:06,713 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:06,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 11:18:06,714 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 11:18:06,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 11:18:06,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:18:06,715 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 8 states. [2019-08-05 11:18:06,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:06,775 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-08-05 11:18:06,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 11:18:06,776 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2019-08-05 11:18:06,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:06,777 INFO L225 Difference]: With dead ends: 11 [2019-08-05 11:18:06,777 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 11:18:06,778 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:06,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 11:18:06,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-05 11:18:06,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 11:18:06,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-08-05 11:18:06,780 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2019-08-05 11:18:06,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:06,780 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-08-05 11:18:06,780 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 11:18:06,781 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-08-05 11:18:06,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 11:18:06,781 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:06,781 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1] [2019-08-05 11:18:06,782 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:06,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:06,782 INFO L82 PathProgramCache]: Analyzing trace with hash -1927968242, now seen corresponding path program 5 times [2019-08-05 11:18:06,783 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:06,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:06,800 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 11:18:06,801 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:06,968 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:06,969 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:06,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 11:18:06,969 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 11:18:06,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 11:18:06,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:18:06,970 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 9 states. [2019-08-05 11:18:07,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:07,001 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-08-05 11:18:07,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 11:18:07,002 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 10 [2019-08-05 11:18:07,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:07,003 INFO L225 Difference]: With dead ends: 12 [2019-08-05 11:18:07,003 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 11:18:07,004 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:07,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 11:18:07,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-08-05 11:18:07,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 11:18:07,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-08-05 11:18:07,006 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-08-05 11:18:07,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:07,007 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-08-05 11:18:07,007 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 11:18:07,007 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-08-05 11:18:07,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 11:18:07,008 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:07,008 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1] [2019-08-05 11:18:07,008 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:07,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:07,008 INFO L82 PathProgramCache]: Analyzing trace with hash 362763032, now seen corresponding path program 6 times [2019-08-05 11:18:07,009 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:07,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:07,027 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 11:18:07,028 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:07,165 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:07,165 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:07,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 11:18:07,166 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 11:18:07,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 11:18:07,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:18:07,167 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 10 states. [2019-08-05 11:18:07,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:07,381 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-08-05 11:18:07,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 11:18:07,382 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 11 [2019-08-05 11:18:07,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:07,382 INFO L225 Difference]: With dead ends: 13 [2019-08-05 11:18:07,382 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 11:18:07,383 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:07,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 11:18:07,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-08-05 11:18:07,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 11:18:07,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-08-05 11:18:07,385 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2019-08-05 11:18:07,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:07,386 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-08-05 11:18:07,386 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 11:18:07,386 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-08-05 11:18:07,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 11:18:07,386 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:07,387 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1] [2019-08-05 11:18:07,387 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:07,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:07,387 INFO L82 PathProgramCache]: Analyzing trace with hash -1639011506, now seen corresponding path program 7 times [2019-08-05 11:18:07,388 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:07,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:07,423 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 11:18:07,424 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:07,621 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:07,622 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:07,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 11:18:07,622 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 11:18:07,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 11:18:07,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:18:07,623 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 11 states. [2019-08-05 11:18:07,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:07,678 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-08-05 11:18:07,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 11:18:07,678 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 12 [2019-08-05 11:18:07,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:07,679 INFO L225 Difference]: With dead ends: 14 [2019-08-05 11:18:07,679 INFO L226 Difference]: Without dead ends: 14 [2019-08-05 11:18:07,680 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:18:07,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-05 11:18:07,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-08-05 11:18:07,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-05 11:18:07,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-08-05 11:18:07,682 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2019-08-05 11:18:07,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:07,682 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-08-05 11:18:07,683 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 11:18:07,683 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-08-05 11:18:07,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 11:18:07,683 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:07,683 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1, 1, 1] [2019-08-05 11:18:07,683 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:07,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:07,684 INFO L82 PathProgramCache]: Analyzing trace with hash 730487256, now seen corresponding path program 8 times [2019-08-05 11:18:07,684 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:07,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:07,700 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 11:18:07,702 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:07,948 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:07,948 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:07,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 11:18:07,949 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 11:18:07,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 11:18:07,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 11:18:07,950 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 12 states. [2019-08-05 11:18:07,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:07,981 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-08-05 11:18:07,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 11:18:07,982 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 13 [2019-08-05 11:18:07,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:07,983 INFO L225 Difference]: With dead ends: 15 [2019-08-05 11:18:07,983 INFO L226 Difference]: Without dead ends: 15 [2019-08-05 11:18:07,984 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:07,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-05 11:18:07,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-08-05 11:18:07,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 11:18:07,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-08-05 11:18:07,988 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2019-08-05 11:18:07,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:07,988 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-08-05 11:18:07,988 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 11:18:07,988 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-08-05 11:18:07,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 11:18:07,989 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:07,989 INFO L399 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1] [2019-08-05 11:18:07,989 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:07,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:07,990 INFO L82 PathProgramCache]: Analyzing trace with hash 1170504846, now seen corresponding path program 9 times [2019-08-05 11:18:07,990 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:08,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:08,007 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 11:18:08,009 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:08,210 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:08,210 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:08,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 11:18:08,211 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 11:18:08,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 11:18:08,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:18:08,212 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 13 states. [2019-08-05 11:18:08,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:08,272 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-08-05 11:18:08,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 11:18:08,273 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 14 [2019-08-05 11:18:08,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:08,274 INFO L225 Difference]: With dead ends: 16 [2019-08-05 11:18:08,274 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 11:18:08,274 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:18:08,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 11:18:08,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-08-05 11:18:08,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 11:18:08,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-08-05 11:18:08,277 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2019-08-05 11:18:08,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:08,278 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-08-05 11:18:08,278 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 11:18:08,278 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-08-05 11:18:08,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 11:18:08,279 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:08,281 INFO L399 BasicCegarLoop]: trace histogram [11, 1, 1, 1, 1] [2019-08-05 11:18:08,281 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:08,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:08,282 INFO L82 PathProgramCache]: Analyzing trace with hash 1926148248, now seen corresponding path program 10 times [2019-08-05 11:18:08,283 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:08,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:08,300 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 11:18:08,301 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:08,537 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:08,538 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:08,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 11:18:08,538 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 11:18:08,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 11:18:08,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-08-05 11:18:08,539 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 14 states. [2019-08-05 11:18:08,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:08,568 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-08-05 11:18:08,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 11:18:08,569 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 15 [2019-08-05 11:18:08,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:08,570 INFO L225 Difference]: With dead ends: 17 [2019-08-05 11:18:08,570 INFO L226 Difference]: Without dead ends: 17 [2019-08-05 11:18:08,571 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:08,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-05 11:18:08,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-08-05 11:18:08,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 11:18:08,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-08-05 11:18:08,574 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2019-08-05 11:18:08,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:08,574 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-08-05 11:18:08,574 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 11:18:08,574 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-08-05 11:18:08,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 11:18:08,575 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:08,575 INFO L399 BasicCegarLoop]: trace histogram [12, 1, 1, 1, 1] [2019-08-05 11:18:08,575 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:08,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:08,576 INFO L82 PathProgramCache]: Analyzing trace with hash -418710066, now seen corresponding path program 11 times [2019-08-05 11:18:08,576 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:08,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:08,595 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 11:18:08,596 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:08,896 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:08,896 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:08,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 11:18:08,897 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 11:18:08,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 11:18:08,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:18:08,897 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 15 states. [2019-08-05 11:18:08,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:08,965 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-08-05 11:18:08,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 11:18:08,966 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 16 [2019-08-05 11:18:08,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:08,966 INFO L225 Difference]: With dead ends: 18 [2019-08-05 11:18:08,967 INFO L226 Difference]: Without dead ends: 18 [2019-08-05 11:18:08,967 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:18:08,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-05 11:18:08,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-08-05 11:18:08,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-05 11:18:08,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-08-05 11:18:08,970 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2019-08-05 11:18:08,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:08,971 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-08-05 11:18:08,971 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 11:18:08,971 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-08-05 11:18:08,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 11:18:08,972 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:08,972 INFO L399 BasicCegarLoop]: trace histogram [13, 1, 1, 1, 1] [2019-08-05 11:18:08,972 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:08,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:08,972 INFO L82 PathProgramCache]: Analyzing trace with hash -94873768, now seen corresponding path program 12 times [2019-08-05 11:18:08,973 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:08,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:08,995 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 11:18:08,996 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:09,306 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:09,307 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:09,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 11:18:09,308 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 11:18:09,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 11:18:09,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-08-05 11:18:09,309 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 16 states. [2019-08-05 11:18:09,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:09,354 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-08-05 11:18:09,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 11:18:09,354 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 17 [2019-08-05 11:18:09,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:09,355 INFO L225 Difference]: With dead ends: 19 [2019-08-05 11:18:09,355 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 11:18:09,356 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-08-05 11:18:09,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 11:18:09,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-08-05 11:18:09,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 11:18:09,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-08-05 11:18:09,360 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2019-08-05 11:18:09,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:09,361 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-08-05 11:18:09,361 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 11:18:09,361 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-08-05 11:18:09,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 11:18:09,361 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:09,361 INFO L399 BasicCegarLoop]: trace histogram [14, 1, 1, 1, 1] [2019-08-05 11:18:09,361 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:09,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:09,362 INFO L82 PathProgramCache]: Analyzing trace with hash 1354116878, now seen corresponding path program 13 times [2019-08-05 11:18:09,362 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:09,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:09,380 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:18:09,381 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:09,593 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:09,594 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:09,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 11:18:09,594 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:18:09,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:18:09,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:18:09,595 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 17 states. [2019-08-05 11:18:09,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:09,831 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-08-05 11:18:09,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:18:09,831 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 18 [2019-08-05 11:18:09,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:09,832 INFO L225 Difference]: With dead ends: 20 [2019-08-05 11:18:09,832 INFO L226 Difference]: Without dead ends: 20 [2019-08-05 11:18:09,833 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:18:09,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-05 11:18:09,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-08-05 11:18:09,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 11:18:09,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-08-05 11:18:09,836 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2019-08-05 11:18:09,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:09,836 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-08-05 11:18:09,837 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:18:09,837 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-08-05 11:18:09,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 11:18:09,838 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:09,838 INFO L399 BasicCegarLoop]: trace histogram [15, 1, 1, 1, 1] [2019-08-05 11:18:09,838 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:09,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:09,839 INFO L82 PathProgramCache]: Analyzing trace with hash -971813352, now seen corresponding path program 14 times [2019-08-05 11:18:09,839 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:09,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:09,873 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 11:18:09,875 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:10,119 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:10,119 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:10,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:18:10,120 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 11:18:10,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 11:18:10,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-08-05 11:18:10,121 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 18 states. [2019-08-05 11:18:10,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:10,163 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-08-05 11:18:10,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 11:18:10,163 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 19 [2019-08-05 11:18:10,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:10,164 INFO L225 Difference]: With dead ends: 21 [2019-08-05 11:18:10,165 INFO L226 Difference]: Without dead ends: 21 [2019-08-05 11:18:10,165 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-08-05 11:18:10,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-05 11:18:10,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-08-05 11:18:10,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-05 11:18:10,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-08-05 11:18:10,169 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2019-08-05 11:18:10,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:10,169 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-08-05 11:18:10,169 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 11:18:10,169 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-08-05 11:18:10,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 11:18:10,169 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:10,170 INFO L399 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1] [2019-08-05 11:18:10,170 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:10,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:10,170 INFO L82 PathProgramCache]: Analyzing trace with hash -61206450, now seen corresponding path program 15 times [2019-08-05 11:18:10,171 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:10,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:10,186 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:18:10,188 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:10,378 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:10,378 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:10,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 11:18:10,379 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:18:10,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:18:10,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:18:10,380 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 19 states. [2019-08-05 11:18:10,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:10,429 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-08-05 11:18:10,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:18:10,430 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 20 [2019-08-05 11:18:10,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:10,430 INFO L225 Difference]: With dead ends: 22 [2019-08-05 11:18:10,431 INFO L226 Difference]: Without dead ends: 22 [2019-08-05 11:18:10,432 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:10,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-05 11:18:10,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-08-05 11:18:10,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-05 11:18:10,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-08-05 11:18:10,434 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2019-08-05 11:18:10,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:10,434 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-08-05 11:18:10,435 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:18:10,435 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-08-05 11:18:10,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 11:18:10,435 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:10,435 INFO L399 BasicCegarLoop]: trace histogram [17, 1, 1, 1, 1] [2019-08-05 11:18:10,436 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:10,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:10,436 INFO L82 PathProgramCache]: Analyzing trace with hash -1897163560, now seen corresponding path program 16 times [2019-08-05 11:18:10,437 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:10,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:10,451 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 11:18:10,452 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:10,956 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:10,957 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:10,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:18:10,957 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 11:18:10,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 11:18:10,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-08-05 11:18:10,958 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 20 states. [2019-08-05 11:18:11,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:11,002 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-08-05 11:18:11,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 11:18:11,002 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 21 [2019-08-05 11:18:11,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:11,003 INFO L225 Difference]: With dead ends: 23 [2019-08-05 11:18:11,004 INFO L226 Difference]: Without dead ends: 23 [2019-08-05 11:18:11,004 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-08-05 11:18:11,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-08-05 11:18:11,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-08-05 11:18:11,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-05 11:18:11,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-08-05 11:18:11,007 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2019-08-05 11:18:11,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:11,008 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-08-05 11:18:11,008 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 11:18:11,008 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-08-05 11:18:11,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 11:18:11,009 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:11,009 INFO L399 BasicCegarLoop]: trace histogram [18, 1, 1, 1, 1] [2019-08-05 11:18:11,009 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:11,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:11,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1317708174, now seen corresponding path program 17 times [2019-08-05 11:18:11,010 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:11,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:11,025 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:18:11,027 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:11,468 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:11,469 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:11,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 11:18:11,469 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:18:11,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:18:11,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:18:11,470 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 21 states. [2019-08-05 11:18:11,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:11,575 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-08-05 11:18:11,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:18:11,576 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 22 [2019-08-05 11:18:11,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:11,577 INFO L225 Difference]: With dead ends: 24 [2019-08-05 11:18:11,577 INFO L226 Difference]: Without dead ends: 24 [2019-08-05 11:18:11,578 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:11,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-08-05 11:18:11,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-08-05 11:18:11,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-05 11:18:11,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-08-05 11:18:11,581 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2019-08-05 11:18:11,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:11,582 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-08-05 11:18:11,582 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:18:11,582 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-08-05 11:18:11,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 11:18:11,582 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:11,583 INFO L399 BasicCegarLoop]: trace histogram [19, 1, 1, 1, 1] [2019-08-05 11:18:11,583 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:11,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:11,583 INFO L82 PathProgramCache]: Analyzing trace with hash -2100483176, now seen corresponding path program 18 times [2019-08-05 11:18:11,584 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:11,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:11,598 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 11:18:11,603 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:11,806 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:11,806 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:11,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:18:11,807 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 11:18:11,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 11:18:11,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-08-05 11:18:11,808 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 22 states. [2019-08-05 11:18:11,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:11,840 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-08-05 11:18:11,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 11:18:11,841 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 23 [2019-08-05 11:18:11,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:11,841 INFO L225 Difference]: With dead ends: 25 [2019-08-05 11:18:11,842 INFO L226 Difference]: Without dead ends: 25 [2019-08-05 11:18:11,842 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-08-05 11:18:11,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-05 11:18:11,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-08-05 11:18:11,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-05 11:18:11,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-08-05 11:18:11,846 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2019-08-05 11:18:11,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:11,846 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-08-05 11:18:11,846 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 11:18:11,846 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-08-05 11:18:11,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 11:18:11,847 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:11,847 INFO L399 BasicCegarLoop]: trace histogram [20, 1, 1, 1, 1] [2019-08-05 11:18:11,847 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:11,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:11,848 INFO L82 PathProgramCache]: Analyzing trace with hash -690232626, now seen corresponding path program 19 times [2019-08-05 11:18:11,849 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:11,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:11,863 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 11:18:11,864 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:12,313 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:12,313 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:12,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 11:18:12,314 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 11:18:12,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 11:18:12,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:18:12,315 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 23 states. [2019-08-05 11:18:12,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:12,382 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-08-05 11:18:12,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 11:18:12,384 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 24 [2019-08-05 11:18:12,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:12,385 INFO L225 Difference]: With dead ends: 26 [2019-08-05 11:18:12,385 INFO L226 Difference]: Without dead ends: 26 [2019-08-05 11:18:12,385 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:18:12,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-08-05 11:18:12,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-08-05 11:18:12,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-08-05 11:18:12,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-08-05 11:18:12,388 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2019-08-05 11:18:12,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:12,388 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-08-05 11:18:12,388 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 11:18:12,388 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-08-05 11:18:12,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 11:18:12,389 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:12,389 INFO L399 BasicCegarLoop]: trace histogram [21, 1, 1, 1, 1] [2019-08-05 11:18:12,389 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:12,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:12,390 INFO L82 PathProgramCache]: Analyzing trace with hash 77861464, now seen corresponding path program 20 times [2019-08-05 11:18:12,390 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:12,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:12,404 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 11:18:12,406 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:12,792 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:12,792 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:12,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 11:18:12,793 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 11:18:12,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 11:18:12,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-08-05 11:18:12,793 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 24 states. [2019-08-05 11:18:12,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:12,877 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-08-05 11:18:12,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 11:18:12,878 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 25 [2019-08-05 11:18:12,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:12,878 INFO L225 Difference]: With dead ends: 27 [2019-08-05 11:18:12,879 INFO L226 Difference]: Without dead ends: 27 [2019-08-05 11:18:12,879 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:12,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-08-05 11:18:12,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-08-05 11:18:12,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-05 11:18:12,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-08-05 11:18:12,883 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2019-08-05 11:18:12,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:12,884 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-08-05 11:18:12,884 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 11:18:12,884 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-08-05 11:18:12,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 11:18:12,884 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:12,885 INFO L399 BasicCegarLoop]: trace histogram [22, 1, 1, 1, 1] [2019-08-05 11:18:12,885 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:12,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:12,885 INFO L82 PathProgramCache]: Analyzing trace with hash -1881025522, now seen corresponding path program 21 times [2019-08-05 11:18:12,886 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:12,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:12,899 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 24 conjunts are in the unsatisfiable core [2019-08-05 11:18:12,901 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:13,408 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:13,409 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:13,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 11:18:13,410 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 11:18:13,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 11:18:13,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:18:13,411 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 25 states. [2019-08-05 11:18:13,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:13,477 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-08-05 11:18:13,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 11:18:13,477 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 26 [2019-08-05 11:18:13,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:13,478 INFO L225 Difference]: With dead ends: 28 [2019-08-05 11:18:13,478 INFO L226 Difference]: Without dead ends: 28 [2019-08-05 11:18:13,479 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:18:13,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-08-05 11:18:13,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-08-05 11:18:13,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-05 11:18:13,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-08-05 11:18:13,482 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2019-08-05 11:18:13,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:13,482 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-08-05 11:18:13,483 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 11:18:13,483 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-08-05 11:18:13,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 11:18:13,483 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:13,483 INFO L399 BasicCegarLoop]: trace histogram [23, 1, 1, 1, 1] [2019-08-05 11:18:13,484 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:13,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:13,484 INFO L82 PathProgramCache]: Analyzing trace with hash 1817987352, now seen corresponding path program 22 times [2019-08-05 11:18:13,485 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:13,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:13,498 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 11:18:13,499 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:13,770 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:13,771 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:13,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 11:18:13,772 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 11:18:13,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 11:18:13,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-08-05 11:18:13,773 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 26 states. [2019-08-05 11:18:13,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:13,830 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-08-05 11:18:13,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 11:18:13,832 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 27 [2019-08-05 11:18:13,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:13,832 INFO L225 Difference]: With dead ends: 29 [2019-08-05 11:18:13,833 INFO L226 Difference]: Without dead ends: 29 [2019-08-05 11:18:13,833 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:13,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-08-05 11:18:13,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-08-05 11:18:13,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-08-05 11:18:13,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-08-05 11:18:13,836 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2019-08-05 11:18:13,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:13,836 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-08-05 11:18:13,836 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 11:18:13,836 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-08-05 11:18:13,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 11:18:13,837 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:13,837 INFO L399 BasicCegarLoop]: trace histogram [24, 1, 1, 1, 1] [2019-08-05 11:18:13,838 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:13,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:13,838 INFO L82 PathProgramCache]: Analyzing trace with hash 523269454, now seen corresponding path program 23 times [2019-08-05 11:18:13,839 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:13,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:13,856 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 26 conjunts are in the unsatisfiable core [2019-08-05 11:18:13,858 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:14,411 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:14,411 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:14,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 11:18:14,411 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:18:14,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:18:14,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:18:14,413 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 27 states. [2019-08-05 11:18:14,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:14,457 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-08-05 11:18:14,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:18:14,458 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 28 [2019-08-05 11:18:14,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:14,458 INFO L225 Difference]: With dead ends: 30 [2019-08-05 11:18:14,458 INFO L226 Difference]: Without dead ends: 30 [2019-08-05 11:18:14,459 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:18:14,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-08-05 11:18:14,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-08-05 11:18:14,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-05 11:18:14,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-08-05 11:18:14,462 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2019-08-05 11:18:14,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:14,463 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-08-05 11:18:14,463 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:18:14,463 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-08-05 11:18:14,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 11:18:14,464 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:14,464 INFO L399 BasicCegarLoop]: trace histogram [25, 1, 1, 1, 1] [2019-08-05 11:18:14,465 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:14,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:14,465 INFO L82 PathProgramCache]: Analyzing trace with hash -958279720, now seen corresponding path program 24 times [2019-08-05 11:18:14,466 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:14,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:14,479 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:18:14,481 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:14,990 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:14,990 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:14,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:18:14,990 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 11:18:14,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 11:18:14,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-08-05 11:18:14,991 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 28 states. [2019-08-05 11:18:15,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:15,145 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-08-05 11:18:15,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 11:18:15,146 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 29 [2019-08-05 11:18:15,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:15,146 INFO L225 Difference]: With dead ends: 31 [2019-08-05 11:18:15,147 INFO L226 Difference]: Without dead ends: 31 [2019-08-05 11:18:15,147 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-08-05 11:18:15,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-08-05 11:18:15,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-08-05 11:18:15,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-08-05 11:18:15,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-08-05 11:18:15,150 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2019-08-05 11:18:15,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:15,150 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-08-05 11:18:15,150 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 11:18:15,150 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-08-05 11:18:15,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 11:18:15,151 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:15,151 INFO L399 BasicCegarLoop]: trace histogram [26, 1, 1, 1, 1] [2019-08-05 11:18:15,151 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:15,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:15,152 INFO L82 PathProgramCache]: Analyzing trace with hash 358336142, now seen corresponding path program 25 times [2019-08-05 11:18:15,152 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:15,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:15,165 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 28 conjunts are in the unsatisfiable core [2019-08-05 11:18:15,166 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:16,935 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:16,936 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:16,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 11:18:16,936 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:18:16,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:18:16,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:18:16,937 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 29 states. [2019-08-05 11:18:16,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:16,978 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-08-05 11:18:16,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:18:16,978 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 30 [2019-08-05 11:18:16,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:16,979 INFO L225 Difference]: With dead ends: 32 [2019-08-05 11:18:16,979 INFO L226 Difference]: Without dead ends: 32 [2019-08-05 11:18:16,980 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:18:16,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-08-05 11:18:16,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-08-05 11:18:16,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-05 11:18:16,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-08-05 11:18:16,983 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2019-08-05 11:18:16,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:16,984 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-08-05 11:18:16,984 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:18:16,984 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-08-05 11:18:16,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-05 11:18:16,984 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:16,985 INFO L399 BasicCegarLoop]: trace histogram [27, 1, 1, 1, 1] [2019-08-05 11:18:16,985 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:16,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:16,985 INFO L82 PathProgramCache]: Analyzing trace with hash -1776245096, now seen corresponding path program 26 times [2019-08-05 11:18:16,986 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:16,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:16,999 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:18:17,000 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:17,418 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:17,419 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:17,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:18:17,420 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 11:18:17,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 11:18:17,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-08-05 11:18:17,421 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 30 states. [2019-08-05 11:18:17,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:17,460 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-08-05 11:18:17,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 11:18:17,461 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 31 [2019-08-05 11:18:17,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:17,461 INFO L225 Difference]: With dead ends: 33 [2019-08-05 11:18:17,462 INFO L226 Difference]: Without dead ends: 33 [2019-08-05 11:18:17,463 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:17,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-08-05 11:18:17,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-08-05 11:18:17,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-05 11:18:17,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-08-05 11:18:17,466 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2019-08-05 11:18:17,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:17,466 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-08-05 11:18:17,466 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 11:18:17,467 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-08-05 11:18:17,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 11:18:17,467 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:17,467 INFO L399 BasicCegarLoop]: trace histogram [28, 1, 1, 1, 1] [2019-08-05 11:18:17,467 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:17,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:17,468 INFO L82 PathProgramCache]: Analyzing trace with hash 771213262, now seen corresponding path program 27 times [2019-08-05 11:18:17,469 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:17,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:17,481 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 30 conjunts are in the unsatisfiable core [2019-08-05 11:18:17,483 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:17,862 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:17,862 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:17,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-05 11:18:17,863 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-05 11:18:17,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-05 11:18:17,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-08-05 11:18:17,864 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 31 states. [2019-08-05 11:18:17,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:17,993 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-08-05 11:18:17,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 11:18:17,993 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 32 [2019-08-05 11:18:17,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:17,993 INFO L225 Difference]: With dead ends: 34 [2019-08-05 11:18:17,994 INFO L226 Difference]: Without dead ends: 34 [2019-08-05 11:18:17,994 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-08-05 11:18:17,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-08-05 11:18:17,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-08-05 11:18:17,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-05 11:18:17,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-08-05 11:18:17,996 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2019-08-05 11:18:17,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:17,997 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-08-05 11:18:17,997 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-05 11:18:17,997 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-08-05 11:18:17,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-05 11:18:17,997 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:17,997 INFO L399 BasicCegarLoop]: trace histogram [29, 1, 1, 1, 1] [2019-08-05 11:18:17,998 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:17,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:17,998 INFO L82 PathProgramCache]: Analyzing trace with hash -1861956264, now seen corresponding path program 28 times [2019-08-05 11:18:17,999 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:18,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:18,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 11:18:18,013 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:18,640 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:18,640 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:18,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-05 11:18:18,640 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 11:18:18,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 11:18:18,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-08-05 11:18:18,641 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 32 states. [2019-08-05 11:18:18,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:18,898 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-08-05 11:18:18,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-05 11:18:18,898 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 33 [2019-08-05 11:18:18,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:18,899 INFO L225 Difference]: With dead ends: 35 [2019-08-05 11:18:18,899 INFO L226 Difference]: Without dead ends: 35 [2019-08-05 11:18:18,901 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-08-05 11:18:18,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-08-05 11:18:18,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-08-05 11:18:18,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-05 11:18:18,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-08-05 11:18:18,903 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2019-08-05 11:18:18,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:18,903 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-08-05 11:18:18,904 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 11:18:18,904 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-08-05 11:18:18,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-05 11:18:18,904 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:18,904 INFO L399 BasicCegarLoop]: trace histogram [30, 1, 1, 1, 1] [2019-08-05 11:18:18,904 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:18,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:18,905 INFO L82 PathProgramCache]: Analyzing trace with hash -1885832946, now seen corresponding path program 29 times [2019-08-05 11:18:18,905 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:18,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:18,924 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 32 conjunts are in the unsatisfiable core [2019-08-05 11:18:18,925 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:19,410 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:19,411 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:19,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-05 11:18:19,411 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-05 11:18:19,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-05 11:18:19,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 11:18:19,412 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 33 states. [2019-08-05 11:18:19,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:19,460 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-08-05 11:18:19,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-05 11:18:19,461 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 34 [2019-08-05 11:18:19,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:19,462 INFO L225 Difference]: With dead ends: 36 [2019-08-05 11:18:19,462 INFO L226 Difference]: Without dead ends: 36 [2019-08-05 11:18:19,463 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 11:18:19,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-08-05 11:18:19,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-08-05 11:18:19,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-05 11:18:19,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-08-05 11:18:19,466 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2019-08-05 11:18:19,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:19,466 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-08-05 11:18:19,466 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-05 11:18:19,466 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-08-05 11:18:19,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-05 11:18:19,467 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:19,467 INFO L399 BasicCegarLoop]: trace histogram [31, 1, 1, 1, 1] [2019-08-05 11:18:19,467 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:19,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:19,467 INFO L82 PathProgramCache]: Analyzing trace with hash 1668957208, now seen corresponding path program 30 times [2019-08-05 11:18:19,468 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:19,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:19,482 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 33 conjunts are in the unsatisfiable core [2019-08-05 11:18:19,483 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:19,927 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:19,927 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:19,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 11:18:19,928 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 11:18:19,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 11:18:19,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 11:18:19,929 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 34 states. [2019-08-05 11:18:19,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:19,990 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-08-05 11:18:19,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-05 11:18:19,990 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 35 [2019-08-05 11:18:19,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:19,991 INFO L225 Difference]: With dead ends: 37 [2019-08-05 11:18:19,991 INFO L226 Difference]: Without dead ends: 37 [2019-08-05 11:18:19,992 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:19,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-08-05 11:18:19,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-08-05 11:18:19,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-05 11:18:19,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-08-05 11:18:19,995 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2019-08-05 11:18:19,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:19,995 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-08-05 11:18:19,996 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 11:18:19,996 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-08-05 11:18:19,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-05 11:18:19,996 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:19,997 INFO L399 BasicCegarLoop]: trace histogram [32, 1, 1, 1, 1] [2019-08-05 11:18:19,997 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:19,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:19,997 INFO L82 PathProgramCache]: Analyzing trace with hash 198302286, now seen corresponding path program 31 times [2019-08-05 11:18:19,998 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:20,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:20,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 34 conjunts are in the unsatisfiable core [2019-08-05 11:18:20,013 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:20,440 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:20,441 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:20,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-05 11:18:20,441 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 11:18:20,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 11:18:20,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 11:18:20,442 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 35 states. [2019-08-05 11:18:20,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:20,485 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-08-05 11:18:20,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 11:18:20,485 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 36 [2019-08-05 11:18:20,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:20,486 INFO L225 Difference]: With dead ends: 38 [2019-08-05 11:18:20,486 INFO L226 Difference]: Without dead ends: 38 [2019-08-05 11:18:20,487 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:20,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-08-05 11:18:20,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-08-05 11:18:20,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-05 11:18:20,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-08-05 11:18:20,490 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2019-08-05 11:18:20,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:20,490 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-08-05 11:18:20,490 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 11:18:20,490 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-08-05 11:18:20,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-08-05 11:18:20,491 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:20,491 INFO L399 BasicCegarLoop]: trace histogram [33, 1, 1, 1, 1] [2019-08-05 11:18:20,491 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:20,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:20,491 INFO L82 PathProgramCache]: Analyzing trace with hash 1852639960, now seen corresponding path program 32 times [2019-08-05 11:18:20,492 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:20,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:20,506 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 35 conjunts are in the unsatisfiable core [2019-08-05 11:18:20,507 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:21,008 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:21,009 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:21,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-05 11:18:21,009 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-05 11:18:21,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-05 11:18:21,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 11:18:21,011 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 36 states. [2019-08-05 11:18:21,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:21,158 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-08-05 11:18:21,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-05 11:18:21,158 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 37 [2019-08-05 11:18:21,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:21,159 INFO L225 Difference]: With dead ends: 39 [2019-08-05 11:18:21,159 INFO L226 Difference]: Without dead ends: 39 [2019-08-05 11:18:21,161 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:21,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-08-05 11:18:21,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-08-05 11:18:21,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-05 11:18:21,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-08-05 11:18:21,164 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2019-08-05 11:18:21,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:21,164 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-08-05 11:18:21,164 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-05 11:18:21,164 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-08-05 11:18:21,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-05 11:18:21,165 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:21,165 INFO L399 BasicCegarLoop]: trace histogram [34, 1, 1, 1, 1] [2019-08-05 11:18:21,165 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:21,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:21,166 INFO L82 PathProgramCache]: Analyzing trace with hash 1597500302, now seen corresponding path program 33 times [2019-08-05 11:18:21,166 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:21,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:21,183 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 36 conjunts are in the unsatisfiable core [2019-08-05 11:18:21,184 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:21,936 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:21,936 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:21,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-05 11:18:21,936 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-05 11:18:21,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-05 11:18:21,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 11:18:21,937 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 37 states. [2019-08-05 11:18:21,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:21,981 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-08-05 11:18:21,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-05 11:18:21,981 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 38 [2019-08-05 11:18:21,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:21,982 INFO L225 Difference]: With dead ends: 40 [2019-08-05 11:18:21,982 INFO L226 Difference]: Without dead ends: 40 [2019-08-05 11:18:21,983 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 11:18:21,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-08-05 11:18:21,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-08-05 11:18:21,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-05 11:18:21,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-08-05 11:18:21,985 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2019-08-05 11:18:21,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:21,986 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-08-05 11:18:21,986 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-05 11:18:21,986 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-08-05 11:18:21,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-08-05 11:18:21,986 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:21,986 INFO L399 BasicCegarLoop]: trace histogram [35, 1, 1, 1, 1] [2019-08-05 11:18:21,986 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:21,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:21,987 INFO L82 PathProgramCache]: Analyzing trace with hash -2016861800, now seen corresponding path program 34 times [2019-08-05 11:18:21,987 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:22,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:22,002 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-05 11:18:22,003 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:22,612 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:22,612 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:22,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-05 11:18:22,613 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-05 11:18:22,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-05 11:18:22,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 11:18:22,614 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 38 states. [2019-08-05 11:18:22,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:22,695 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-08-05 11:18:22,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-05 11:18:22,695 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 39 [2019-08-05 11:18:22,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:22,696 INFO L225 Difference]: With dead ends: 41 [2019-08-05 11:18:22,696 INFO L226 Difference]: Without dead ends: 41 [2019-08-05 11:18:22,697 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:22,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-08-05 11:18:22,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-08-05 11:18:22,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-05 11:18:22,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-08-05 11:18:22,700 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2019-08-05 11:18:22,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:22,700 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-08-05 11:18:22,700 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-05 11:18:22,700 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-08-05 11:18:22,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 11:18:22,701 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:22,701 INFO L399 BasicCegarLoop]: trace histogram [36, 1, 1, 1, 1] [2019-08-05 11:18:22,701 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:22,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:22,701 INFO L82 PathProgramCache]: Analyzing trace with hash 1902030030, now seen corresponding path program 35 times [2019-08-05 11:18:22,702 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:22,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:22,716 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 38 conjunts are in the unsatisfiable core [2019-08-05 11:18:22,717 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:24,168 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:24,169 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:24,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-05 11:18:24,169 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-05 11:18:24,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-05 11:18:24,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 11:18:24,170 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 39 states. [2019-08-05 11:18:24,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:24,224 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-08-05 11:18:24,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-05 11:18:24,225 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 40 [2019-08-05 11:18:24,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:24,226 INFO L225 Difference]: With dead ends: 42 [2019-08-05 11:18:24,226 INFO L226 Difference]: Without dead ends: 42 [2019-08-05 11:18:24,227 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 11:18:24,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-08-05 11:18:24,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-08-05 11:18:24,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-05 11:18:24,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-08-05 11:18:24,229 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2019-08-05 11:18:24,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:24,230 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-08-05 11:18:24,230 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-05 11:18:24,230 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-08-05 11:18:24,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-08-05 11:18:24,230 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:24,231 INFO L399 BasicCegarLoop]: trace histogram [37, 1, 1, 1, 1] [2019-08-05 11:18:24,231 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:24,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:24,231 INFO L82 PathProgramCache]: Analyzing trace with hash -1166374824, now seen corresponding path program 36 times [2019-08-05 11:18:24,232 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:24,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:24,246 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 39 conjunts are in the unsatisfiable core [2019-08-05 11:18:24,247 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:24,805 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:24,805 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:24,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-05 11:18:24,806 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-05 11:18:24,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-05 11:18:24,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 11:18:24,807 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 40 states. [2019-08-05 11:18:24,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:24,862 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-08-05 11:18:24,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-05 11:18:24,863 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 41 [2019-08-05 11:18:24,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:24,864 INFO L225 Difference]: With dead ends: 43 [2019-08-05 11:18:24,864 INFO L226 Difference]: Without dead ends: 43 [2019-08-05 11:18:24,865 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:24,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-08-05 11:18:24,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-08-05 11:18:24,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-05 11:18:24,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-08-05 11:18:24,868 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2019-08-05 11:18:24,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:24,868 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-08-05 11:18:24,868 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-05 11:18:24,868 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-08-05 11:18:24,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-05 11:18:24,869 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:24,869 INFO L399 BasicCegarLoop]: trace histogram [38, 1, 1, 1, 1] [2019-08-05 11:18:24,869 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:24,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:24,870 INFO L82 PathProgramCache]: Analyzing trace with hash -1797644786, now seen corresponding path program 37 times [2019-08-05 11:18:24,870 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:24,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:24,886 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 40 conjunts are in the unsatisfiable core [2019-08-05 11:18:24,888 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:25,585 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:25,586 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:25,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-05 11:18:25,586 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-05 11:18:25,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-05 11:18:25,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:18:25,587 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 41 states. [2019-08-05 11:18:25,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:25,652 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-08-05 11:18:25,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-05 11:18:25,653 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 42 [2019-08-05 11:18:25,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:25,653 INFO L225 Difference]: With dead ends: 44 [2019-08-05 11:18:25,653 INFO L226 Difference]: Without dead ends: 44 [2019-08-05 11:18:25,654 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:25,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-08-05 11:18:25,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-08-05 11:18:25,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-05 11:18:25,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-08-05 11:18:25,656 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2019-08-05 11:18:25,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:25,656 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-08-05 11:18:25,656 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-05 11:18:25,656 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-08-05 11:18:25,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-08-05 11:18:25,657 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:25,657 INFO L399 BasicCegarLoop]: trace histogram [39, 1, 1, 1, 1] [2019-08-05 11:18:25,657 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:25,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:25,657 INFO L82 PathProgramCache]: Analyzing trace with hash 107822872, now seen corresponding path program 38 times [2019-08-05 11:18:25,658 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:25,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:25,672 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 41 conjunts are in the unsatisfiable core [2019-08-05 11:18:25,673 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:26,294 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:26,294 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:26,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-05 11:18:26,295 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-05 11:18:26,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-05 11:18:26,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 11:18:26,295 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 42 states. [2019-08-05 11:18:26,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:26,371 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-08-05 11:18:26,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-05 11:18:26,371 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 43 [2019-08-05 11:18:26,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:26,372 INFO L225 Difference]: With dead ends: 45 [2019-08-05 11:18:26,372 INFO L226 Difference]: Without dead ends: 45 [2019-08-05 11:18:26,373 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:26,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-05 11:18:26,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-08-05 11:18:26,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-05 11:18:26,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-08-05 11:18:26,375 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2019-08-05 11:18:26,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:26,375 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-08-05 11:18:26,375 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-05 11:18:26,375 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-08-05 11:18:26,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-08-05 11:18:26,375 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:26,375 INFO L399 BasicCegarLoop]: trace histogram [40, 1, 1, 1, 1] [2019-08-05 11:18:26,376 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:26,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:26,376 INFO L82 PathProgramCache]: Analyzing trace with hash -952221874, now seen corresponding path program 39 times [2019-08-05 11:18:26,376 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:26,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:26,391 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 42 conjunts are in the unsatisfiable core [2019-08-05 11:18:26,392 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:27,146 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:27,146 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:27,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-05 11:18:27,147 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-05 11:18:27,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-05 11:18:27,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 11:18:27,148 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 43 states. [2019-08-05 11:18:27,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:27,203 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-08-05 11:18:27,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-05 11:18:27,203 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 44 [2019-08-05 11:18:27,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:27,204 INFO L225 Difference]: With dead ends: 46 [2019-08-05 11:18:27,204 INFO L226 Difference]: Without dead ends: 46 [2019-08-05 11:18:27,205 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:27,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-08-05 11:18:27,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-08-05 11:18:27,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-05 11:18:27,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-08-05 11:18:27,207 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2019-08-05 11:18:27,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:27,208 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-08-05 11:18:27,208 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-05 11:18:27,208 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-08-05 11:18:27,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-08-05 11:18:27,208 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:27,209 INFO L399 BasicCegarLoop]: trace histogram [41, 1, 1, 1, 1] [2019-08-05 11:18:27,209 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:27,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:27,209 INFO L82 PathProgramCache]: Analyzing trace with hash 546129368, now seen corresponding path program 40 times [2019-08-05 11:18:27,210 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:27,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:27,225 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 43 conjunts are in the unsatisfiable core [2019-08-05 11:18:27,226 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:28,839 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:28,839 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:28,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-05 11:18:28,840 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-05 11:18:28,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-05 11:18:28,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 11:18:28,841 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 44 states. [2019-08-05 11:18:28,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:28,931 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-08-05 11:18:28,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-05 11:18:28,932 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 45 [2019-08-05 11:18:28,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:28,932 INFO L225 Difference]: With dead ends: 47 [2019-08-05 11:18:28,933 INFO L226 Difference]: Without dead ends: 47 [2019-08-05 11:18:28,934 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 11:18:28,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-08-05 11:18:28,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-08-05 11:18:28,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-08-05 11:18:28,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-08-05 11:18:28,936 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2019-08-05 11:18:28,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:28,936 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-08-05 11:18:28,936 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-05 11:18:28,936 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-08-05 11:18:28,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-08-05 11:18:28,937 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:28,937 INFO L399 BasicCegarLoop]: trace histogram [42, 1, 1, 1, 1] [2019-08-05 11:18:28,937 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:28,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:28,937 INFO L82 PathProgramCache]: Analyzing trace with hash -249622386, now seen corresponding path program 41 times [2019-08-05 11:18:28,938 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:28,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:28,952 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 44 conjunts are in the unsatisfiable core [2019-08-05 11:18:28,953 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:29,622 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:18:29,622 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:29,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-05 11:18:29,622 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-05 11:18:29,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-05 11:18:29,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 11:18:29,623 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 45 states. [2019-08-05 11:18:29,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:29,687 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-08-05 11:18:29,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-05 11:18:29,687 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 46 [2019-08-05 11:18:29,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:29,688 INFO L225 Difference]: With dead ends: 48 [2019-08-05 11:18:29,688 INFO L226 Difference]: Without dead ends: 48 [2019-08-05 11:18:29,689 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 11:18:29,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-08-05 11:18:29,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-08-05 11:18:29,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-05 11:18:29,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-08-05 11:18:29,692 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2019-08-05 11:18:29,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:29,692 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-08-05 11:18:29,692 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-05 11:18:29,692 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-08-05 11:18:29,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 11:18:29,693 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:29,693 INFO L399 BasicCegarLoop]: trace histogram [43, 1, 1, 1, 1] [2019-08-05 11:18:29,693 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:29,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:29,693 INFO L82 PathProgramCache]: Analyzing trace with hash 851877016, now seen corresponding path program 42 times [2019-08-05 11:18:29,694 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:29,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:29,708 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 45 conjunts are in the unsatisfiable core [2019-08-05 11:18:29,709 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:30,543 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:18:30,543 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:30,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-05 11:18:30,544 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-05 11:18:30,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-05 11:18:30,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 11:18:30,544 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 46 states. [2019-08-05 11:18:30,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:30,693 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-08-05 11:18:30,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-05 11:18:30,693 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 47 [2019-08-05 11:18:30,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:30,694 INFO L225 Difference]: With dead ends: 49 [2019-08-05 11:18:30,694 INFO L226 Difference]: Without dead ends: 49 [2019-08-05 11:18:30,695 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 11:18:30,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-08-05 11:18:30,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-08-05 11:18:30,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-08-05 11:18:30,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-08-05 11:18:30,697 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2019-08-05 11:18:30,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:30,697 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-08-05 11:18:30,697 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-05 11:18:30,697 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-08-05 11:18:30,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-08-05 11:18:30,698 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:30,698 INFO L399 BasicCegarLoop]: trace histogram [44, 1, 1, 1, 1] [2019-08-05 11:18:30,698 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:30,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:30,699 INFO L82 PathProgramCache]: Analyzing trace with hash 638620110, now seen corresponding path program 43 times [2019-08-05 11:18:30,699 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:30,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:30,714 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 46 conjunts are in the unsatisfiable core [2019-08-05 11:18:30,716 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:31,538 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:18:31,538 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:31,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-05 11:18:31,539 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-05 11:18:31,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-05 11:18:31,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 11:18:31,539 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 47 states. [2019-08-05 11:18:31,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:31,604 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-08-05 11:18:31,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-05 11:18:31,605 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 48 [2019-08-05 11:18:31,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:31,606 INFO L225 Difference]: With dead ends: 50 [2019-08-05 11:18:31,606 INFO L226 Difference]: Without dead ends: 50 [2019-08-05 11:18:31,606 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:18:31,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-08-05 11:18:31,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-08-05 11:18:31,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-08-05 11:18:31,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-08-05 11:18:31,608 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2019-08-05 11:18:31,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:31,608 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2019-08-05 11:18:31,608 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-05 11:18:31,608 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-08-05 11:18:31,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-08-05 11:18:31,608 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:31,609 INFO L399 BasicCegarLoop]: trace histogram [45, 1, 1, 1, 1] [2019-08-05 11:18:31,609 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:31,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:31,609 INFO L82 PathProgramCache]: Analyzing trace with hash -1677376680, now seen corresponding path program 44 times [2019-08-05 11:18:31,609 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:31,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:31,624 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 47 conjunts are in the unsatisfiable core [2019-08-05 11:18:31,625 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:32,635 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:18:32,636 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:32,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-05 11:18:32,636 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-05 11:18:32,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-05 11:18:32,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 11:18:32,637 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 48 states. [2019-08-05 11:18:32,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:32,958 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-08-05 11:18:32,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-05 11:18:32,958 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 49 [2019-08-05 11:18:32,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:32,959 INFO L225 Difference]: With dead ends: 51 [2019-08-05 11:18:32,959 INFO L226 Difference]: Without dead ends: 51 [2019-08-05 11:18:32,960 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:18:32,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-05 11:18:32,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-08-05 11:18:32,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-08-05 11:18:32,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-08-05 11:18:32,962 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2019-08-05 11:18:32,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:32,962 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-08-05 11:18:32,962 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-05 11:18:32,962 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-08-05 11:18:32,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-08-05 11:18:32,963 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:32,963 INFO L399 BasicCegarLoop]: trace histogram [46, 1, 1, 1, 1] [2019-08-05 11:18:32,963 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:32,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:32,963 INFO L82 PathProgramCache]: Analyzing trace with hash -458833138, now seen corresponding path program 45 times [2019-08-05 11:18:32,964 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:32,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:32,980 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 48 conjunts are in the unsatisfiable core [2019-08-05 11:18:32,981 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:34,382 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:18:34,383 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:34,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-08-05 11:18:34,383 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-05 11:18:34,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-05 11:18:34,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 11:18:34,384 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 49 states. [2019-08-05 11:18:34,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:34,454 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-08-05 11:18:34,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-08-05 11:18:34,455 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 50 [2019-08-05 11:18:34,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:34,455 INFO L225 Difference]: With dead ends: 52 [2019-08-05 11:18:34,456 INFO L226 Difference]: Without dead ends: 52 [2019-08-05 11:18:34,456 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 11:18:34,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-08-05 11:18:34,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-08-05 11:18:34,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-05 11:18:34,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-08-05 11:18:34,459 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2019-08-05 11:18:34,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:34,460 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-08-05 11:18:34,460 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-05 11:18:34,460 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-08-05 11:18:34,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-08-05 11:18:34,461 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:34,461 INFO L399 BasicCegarLoop]: trace histogram [47, 1, 1, 1, 1] [2019-08-05 11:18:34,461 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:34,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:34,461 INFO L82 PathProgramCache]: Analyzing trace with hash -1338689000, now seen corresponding path program 46 times [2019-08-05 11:18:34,462 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:34,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:34,477 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 49 conjunts are in the unsatisfiable core [2019-08-05 11:18:34,478 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:35,474 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:18:35,474 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:35,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-05 11:18:35,474 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-05 11:18:35,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-05 11:18:35,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 11:18:35,475 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 50 states. [2019-08-05 11:18:35,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:35,551 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-08-05 11:18:35,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-05 11:18:35,552 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 51 [2019-08-05 11:18:35,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:35,552 INFO L225 Difference]: With dead ends: 53 [2019-08-05 11:18:35,553 INFO L226 Difference]: Without dead ends: 53 [2019-08-05 11:18:35,553 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 11:18:35,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-08-05 11:18:35,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-08-05 11:18:35,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-08-05 11:18:35,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-08-05 11:18:35,556 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2019-08-05 11:18:35,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:35,557 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-08-05 11:18:35,557 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-05 11:18:35,557 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-08-05 11:18:35,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-08-05 11:18:35,558 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:35,558 INFO L399 BasicCegarLoop]: trace histogram [48, 1, 1, 1, 1] [2019-08-05 11:18:35,558 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:35,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:35,558 INFO L82 PathProgramCache]: Analyzing trace with hash 1450550350, now seen corresponding path program 47 times [2019-08-05 11:18:35,559 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:35,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:35,574 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 50 conjunts are in the unsatisfiable core [2019-08-05 11:18:35,575 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:36,494 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:18:36,494 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:36,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-08-05 11:18:36,495 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-05 11:18:36,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-05 11:18:36,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 11:18:36,495 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 51 states. [2019-08-05 11:18:36,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:36,577 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-08-05 11:18:36,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-05 11:18:36,577 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 52 [2019-08-05 11:18:36,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:36,578 INFO L225 Difference]: With dead ends: 54 [2019-08-05 11:18:36,578 INFO L226 Difference]: Without dead ends: 54 [2019-08-05 11:18:36,579 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 11:18:36,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-05 11:18:36,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-08-05 11:18:36,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-08-05 11:18:36,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2019-08-05 11:18:36,582 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2019-08-05 11:18:36,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:36,582 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2019-08-05 11:18:36,582 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-08-05 11:18:36,582 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2019-08-05 11:18:36,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-08-05 11:18:36,582 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:36,583 INFO L399 BasicCegarLoop]: trace histogram [49, 1, 1, 1, 1] [2019-08-05 11:18:36,583 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:36,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:36,583 INFO L82 PathProgramCache]: Analyzing trace with hash 2017624280, now seen corresponding path program 48 times [2019-08-05 11:18:36,584 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:36,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:36,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 51 conjunts are in the unsatisfiable core [2019-08-05 11:18:36,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:37,494 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:18:37,495 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:37,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-05 11:18:37,495 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-05 11:18:37,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-05 11:18:37,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 11:18:37,496 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 52 states. [2019-08-05 11:18:37,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:37,569 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-08-05 11:18:37,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-05 11:18:37,569 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 53 [2019-08-05 11:18:37,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:37,570 INFO L225 Difference]: With dead ends: 55 [2019-08-05 11:18:37,570 INFO L226 Difference]: Without dead ends: 55 [2019-08-05 11:18:37,571 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 11:18:37,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-08-05 11:18:37,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-08-05 11:18:37,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-08-05 11:18:37,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-08-05 11:18:37,573 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2019-08-05 11:18:37,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:37,574 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-08-05 11:18:37,574 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-05 11:18:37,574 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-08-05 11:18:37,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:18:37,574 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:37,574 INFO L399 BasicCegarLoop]: trace histogram [50, 1, 1, 1, 1] [2019-08-05 11:18:37,575 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:37,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:37,575 INFO L82 PathProgramCache]: Analyzing trace with hash -1877920370, now seen corresponding path program 49 times [2019-08-05 11:18:37,576 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:37,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:37,592 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 52 conjunts are in the unsatisfiable core [2019-08-05 11:18:37,593 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:39,030 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:18:39,031 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:39,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-08-05 11:18:39,031 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-08-05 11:18:39,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-08-05 11:18:39,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 11:18:39,032 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 53 states. [2019-08-05 11:18:39,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:39,124 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-08-05 11:18:39,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-08-05 11:18:39,125 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 54 [2019-08-05 11:18:39,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:39,126 INFO L225 Difference]: With dead ends: 56 [2019-08-05 11:18:39,126 INFO L226 Difference]: Without dead ends: 56 [2019-08-05 11:18:39,126 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 11:18:39,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-08-05 11:18:39,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-08-05 11:18:39,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-08-05 11:18:39,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-08-05 11:18:39,128 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2019-08-05 11:18:39,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:39,129 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-08-05 11:18:39,129 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-08-05 11:18:39,129 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-08-05 11:18:39,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-08-05 11:18:39,129 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:39,129 INFO L399 BasicCegarLoop]: trace histogram [51, 1, 1, 1, 1] [2019-08-05 11:18:39,129 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:39,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:39,130 INFO L82 PathProgramCache]: Analyzing trace with hash 1914247064, now seen corresponding path program 50 times [2019-08-05 11:18:39,130 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:39,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:39,147 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 53 conjunts are in the unsatisfiable core [2019-08-05 11:18:39,148 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:41,217 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:18:41,217 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:41,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-05 11:18:41,217 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-08-05 11:18:41,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-08-05 11:18:41,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 11:18:41,218 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 54 states. [2019-08-05 11:18:41,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:41,342 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-08-05 11:18:41,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-05 11:18:41,343 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 55 [2019-08-05 11:18:41,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:41,343 INFO L225 Difference]: With dead ends: 57 [2019-08-05 11:18:41,344 INFO L226 Difference]: Without dead ends: 57 [2019-08-05 11:18:41,344 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 11:18:41,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-05 11:18:41,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-08-05 11:18:41,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-08-05 11:18:41,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-08-05 11:18:41,346 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2019-08-05 11:18:41,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:41,346 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-08-05 11:18:41,347 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-08-05 11:18:41,347 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-08-05 11:18:41,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-08-05 11:18:41,347 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:41,347 INFO L399 BasicCegarLoop]: trace histogram [52, 1, 1, 1, 1] [2019-08-05 11:18:41,348 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:41,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:41,348 INFO L82 PathProgramCache]: Analyzing trace with hash -787646770, now seen corresponding path program 51 times [2019-08-05 11:18:41,349 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:41,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:41,365 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 54 conjunts are in the unsatisfiable core [2019-08-05 11:18:41,367 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:42,670 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:18:42,670 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:42,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-08-05 11:18:42,670 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-08-05 11:18:42,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-08-05 11:18:42,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 11:18:42,671 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 55 states. [2019-08-05 11:18:42,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:42,770 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-08-05 11:18:42,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-05 11:18:42,771 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 56 [2019-08-05 11:18:42,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:42,771 INFO L225 Difference]: With dead ends: 58 [2019-08-05 11:18:42,771 INFO L226 Difference]: Without dead ends: 58 [2019-08-05 11:18:42,773 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 11:18:42,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-08-05 11:18:42,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-08-05 11:18:42,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-08-05 11:18:42,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-08-05 11:18:42,775 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2019-08-05 11:18:42,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:42,775 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-08-05 11:18:42,775 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-08-05 11:18:42,775 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-08-05 11:18:42,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-08-05 11:18:42,776 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:42,776 INFO L399 BasicCegarLoop]: trace histogram [53, 1, 1, 1, 1] [2019-08-05 11:18:42,776 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:42,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:42,777 INFO L82 PathProgramCache]: Analyzing trace with hash 1352990296, now seen corresponding path program 52 times [2019-08-05 11:18:42,777 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:42,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:42,793 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 55 conjunts are in the unsatisfiable core [2019-08-05 11:18:42,795 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:44,195 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:18:44,196 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:44,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-08-05 11:18:44,196 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-08-05 11:18:44,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-08-05 11:18:44,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 11:18:44,197 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 56 states. [2019-08-05 11:18:44,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:44,279 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-08-05 11:18:44,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-08-05 11:18:44,280 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 57 [2019-08-05 11:18:44,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:44,281 INFO L225 Difference]: With dead ends: 59 [2019-08-05 11:18:44,281 INFO L226 Difference]: Without dead ends: 59 [2019-08-05 11:18:44,281 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 11:18:44,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-08-05 11:18:44,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-08-05 11:18:44,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-08-05 11:18:44,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2019-08-05 11:18:44,284 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2019-08-05 11:18:44,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:44,284 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2019-08-05 11:18:44,284 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-08-05 11:18:44,284 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2019-08-05 11:18:44,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-08-05 11:18:44,285 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:44,285 INFO L399 BasicCegarLoop]: trace histogram [54, 1, 1, 1, 1] [2019-08-05 11:18:44,285 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:44,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:44,285 INFO L82 PathProgramCache]: Analyzing trace with hash -1006737394, now seen corresponding path program 53 times [2019-08-05 11:18:44,286 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:44,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:44,302 INFO L256 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 56 conjunts are in the unsatisfiable core [2019-08-05 11:18:44,303 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:45,506 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:18:45,506 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:45,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2019-08-05 11:18:45,506 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-08-05 11:18:45,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-08-05 11:18:45,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 11:18:45,507 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 57 states. [2019-08-05 11:18:45,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:45,579 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-08-05 11:18:45,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-08-05 11:18:45,579 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 58 [2019-08-05 11:18:45,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:45,580 INFO L225 Difference]: With dead ends: 60 [2019-08-05 11:18:45,580 INFO L226 Difference]: Without dead ends: 60 [2019-08-05 11:18:45,582 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 11:18:45,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-05 11:18:45,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-08-05 11:18:45,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-08-05 11:18:45,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2019-08-05 11:18:45,584 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2019-08-05 11:18:45,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:45,585 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2019-08-05 11:18:45,585 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-08-05 11:18:45,585 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2019-08-05 11:18:45,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-08-05 11:18:45,585 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:45,585 INFO L399 BasicCegarLoop]: trace histogram [55, 1, 1, 1, 1] [2019-08-05 11:18:45,586 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:45,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:45,586 INFO L82 PathProgramCache]: Analyzing trace with hash -1143851752, now seen corresponding path program 54 times [2019-08-05 11:18:45,587 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:45,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:45,602 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 57 conjunts are in the unsatisfiable core [2019-08-05 11:18:45,603 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:46,740 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:18:46,740 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:46,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-08-05 11:18:46,740 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-08-05 11:18:46,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-08-05 11:18:46,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 11:18:46,741 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 58 states. [2019-08-05 11:18:46,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:46,847 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-08-05 11:18:46,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-08-05 11:18:46,847 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 59 [2019-08-05 11:18:46,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:46,848 INFO L225 Difference]: With dead ends: 61 [2019-08-05 11:18:46,848 INFO L226 Difference]: Without dead ends: 61 [2019-08-05 11:18:46,849 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:18:46,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-08-05 11:18:46,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-08-05 11:18:46,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-08-05 11:18:46,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-08-05 11:18:46,851 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2019-08-05 11:18:46,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:46,852 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-08-05 11:18:46,852 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-08-05 11:18:46,852 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-08-05 11:18:46,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-08-05 11:18:46,852 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:46,852 INFO L399 BasicCegarLoop]: trace histogram [56, 1, 1, 1, 1] [2019-08-05 11:18:46,853 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:46,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:46,853 INFO L82 PathProgramCache]: Analyzing trace with hash -1099429554, now seen corresponding path program 55 times [2019-08-05 11:18:46,853 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:46,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:46,869 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 58 conjunts are in the unsatisfiable core [2019-08-05 11:18:46,870 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:48,042 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:18:48,042 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:48,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2019-08-05 11:18:48,043 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-08-05 11:18:48,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-08-05 11:18:48,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 11:18:48,044 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 59 states. [2019-08-05 11:18:48,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:48,146 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-08-05 11:18:48,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-08-05 11:18:48,146 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 60 [2019-08-05 11:18:48,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:48,147 INFO L225 Difference]: With dead ends: 62 [2019-08-05 11:18:48,147 INFO L226 Difference]: Without dead ends: 62 [2019-08-05 11:18:48,148 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 11:18:48,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-08-05 11:18:48,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-08-05 11:18:48,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-08-05 11:18:48,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2019-08-05 11:18:48,150 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2019-08-05 11:18:48,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:48,150 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2019-08-05 11:18:48,151 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-08-05 11:18:48,151 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-08-05 11:18:48,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:18:48,151 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:48,151 INFO L399 BasicCegarLoop]: trace histogram [57, 1, 1, 1, 1] [2019-08-05 11:18:48,152 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:48,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:48,152 INFO L82 PathProgramCache]: Analyzing trace with hash 277658584, now seen corresponding path program 56 times [2019-08-05 11:18:48,153 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:48,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:48,171 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 59 conjunts are in the unsatisfiable core [2019-08-05 11:18:48,172 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:49,943 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:18:49,943 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:49,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2019-08-05 11:18:49,944 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-08-05 11:18:49,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-08-05 11:18:49,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 11:18:49,944 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 60 states. [2019-08-05 11:18:50,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:50,034 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-08-05 11:18:50,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-08-05 11:18:50,035 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 61 [2019-08-05 11:18:50,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:50,036 INFO L225 Difference]: With dead ends: 63 [2019-08-05 11:18:50,036 INFO L226 Difference]: Without dead ends: 63 [2019-08-05 11:18:50,036 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 11:18:50,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-05 11:18:50,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-08-05 11:18:50,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-08-05 11:18:50,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2019-08-05 11:18:50,038 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2019-08-05 11:18:50,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:50,039 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2019-08-05 11:18:50,039 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-08-05 11:18:50,039 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2019-08-05 11:18:50,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-08-05 11:18:50,039 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:50,040 INFO L399 BasicCegarLoop]: trace histogram [58, 1, 1, 1, 1] [2019-08-05 11:18:50,040 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:50,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:50,040 INFO L82 PathProgramCache]: Analyzing trace with hash 17717902, now seen corresponding path program 57 times [2019-08-05 11:18:50,041 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:50,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:50,070 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 60 conjunts are in the unsatisfiable core [2019-08-05 11:18:50,072 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:51,355 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:18:51,355 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:51,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2019-08-05 11:18:51,355 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-08-05 11:18:51,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-08-05 11:18:51,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 11:18:51,356 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 61 states. [2019-08-05 11:18:51,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:51,443 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2019-08-05 11:18:51,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-08-05 11:18:51,444 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 62 [2019-08-05 11:18:51,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:51,444 INFO L225 Difference]: With dead ends: 64 [2019-08-05 11:18:51,445 INFO L226 Difference]: Without dead ends: 64 [2019-08-05 11:18:51,445 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 11:18:51,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-08-05 11:18:51,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-08-05 11:18:51,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-08-05 11:18:51,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2019-08-05 11:18:51,447 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2019-08-05 11:18:51,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:51,448 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2019-08-05 11:18:51,448 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-08-05 11:18:51,448 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2019-08-05 11:18:51,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-08-05 11:18:51,448 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:51,448 INFO L399 BasicCegarLoop]: trace histogram [59, 1, 1, 1, 1] [2019-08-05 11:18:51,449 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:51,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:51,449 INFO L82 PathProgramCache]: Analyzing trace with hash 549491352, now seen corresponding path program 58 times [2019-08-05 11:18:51,449 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:51,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:51,467 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 61 conjunts are in the unsatisfiable core [2019-08-05 11:18:51,468 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:52,847 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:18:52,848 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:52,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2019-08-05 11:18:52,848 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-08-05 11:18:52,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-08-05 11:18:52,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 11:18:52,849 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 62 states. [2019-08-05 11:18:52,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:52,935 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-08-05 11:18:52,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-08-05 11:18:52,936 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 63 [2019-08-05 11:18:52,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:52,937 INFO L225 Difference]: With dead ends: 65 [2019-08-05 11:18:52,937 INFO L226 Difference]: Without dead ends: 65 [2019-08-05 11:18:52,937 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:18:52,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-08-05 11:18:52,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-08-05 11:18:52,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-08-05 11:18:52,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-08-05 11:18:52,940 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2019-08-05 11:18:52,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:52,940 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-08-05 11:18:52,941 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-08-05 11:18:52,941 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-08-05 11:18:52,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-08-05 11:18:52,941 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:52,941 INFO L399 BasicCegarLoop]: trace histogram [60, 1, 1, 1, 1] [2019-08-05 11:18:52,942 INFO L418 AbstractCegarLoop]: === Iteration 62 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:52,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:52,942 INFO L82 PathProgramCache]: Analyzing trace with hash -145400882, now seen corresponding path program 59 times [2019-08-05 11:18:52,943 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:52,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:52,959 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 62 conjunts are in the unsatisfiable core [2019-08-05 11:18:52,960 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:54,679 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:18:54,679 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:54,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2019-08-05 11:18:54,680 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-08-05 11:18:54,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-08-05 11:18:54,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 11:18:54,681 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 63 states. [2019-08-05 11:18:54,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:54,777 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-08-05 11:18:54,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-08-05 11:18:54,778 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 64 [2019-08-05 11:18:54,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:54,779 INFO L225 Difference]: With dead ends: 66 [2019-08-05 11:18:54,779 INFO L226 Difference]: Without dead ends: 66 [2019-08-05 11:18:54,779 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 11:18:54,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-05 11:18:54,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-08-05 11:18:54,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-08-05 11:18:54,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2019-08-05 11:18:54,781 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2019-08-05 11:18:54,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:54,781 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2019-08-05 11:18:54,781 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-08-05 11:18:54,781 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-08-05 11:18:54,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-08-05 11:18:54,782 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:54,782 INFO L399 BasicCegarLoop]: trace histogram [61, 1, 1, 1, 1] [2019-08-05 11:18:54,782 INFO L418 AbstractCegarLoop]: === Iteration 63 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:54,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:54,782 INFO L82 PathProgramCache]: Analyzing trace with hash -212223656, now seen corresponding path program 60 times [2019-08-05 11:18:54,783 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:54,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:54,795 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 63 conjunts are in the unsatisfiable core [2019-08-05 11:18:54,797 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:56,158 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:18:56,158 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:56,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2019-08-05 11:18:56,159 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-08-05 11:18:56,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-08-05 11:18:56,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 11:18:56,160 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 64 states. [2019-08-05 11:18:56,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:56,246 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2019-08-05 11:18:56,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-08-05 11:18:56,246 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 65 [2019-08-05 11:18:56,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:56,247 INFO L225 Difference]: With dead ends: 67 [2019-08-05 11:18:56,247 INFO L226 Difference]: Without dead ends: 67 [2019-08-05 11:18:56,248 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 11:18:56,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-08-05 11:18:56,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-08-05 11:18:56,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-08-05 11:18:56,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-08-05 11:18:56,250 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2019-08-05 11:18:56,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:56,250 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2019-08-05 11:18:56,250 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-08-05 11:18:56,250 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-08-05 11:18:56,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-08-05 11:18:56,250 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:56,250 INFO L399 BasicCegarLoop]: trace histogram [62, 1, 1, 1, 1] [2019-08-05 11:18:56,251 INFO L418 AbstractCegarLoop]: === Iteration 64 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:56,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:56,251 INFO L82 PathProgramCache]: Analyzing trace with hash 2011237646, now seen corresponding path program 61 times [2019-08-05 11:18:56,252 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:56,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:56,268 INFO L256 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 64 conjunts are in the unsatisfiable core [2019-08-05 11:18:56,270 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:57,749 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:18:57,749 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:57,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2019-08-05 11:18:57,750 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-08-05 11:18:57,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-08-05 11:18:57,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 11:18:57,751 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 65 states. [2019-08-05 11:18:57,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:57,843 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-08-05 11:18:57,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-08-05 11:18:57,844 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 66 [2019-08-05 11:18:57,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:57,845 INFO L225 Difference]: With dead ends: 68 [2019-08-05 11:18:57,845 INFO L226 Difference]: Without dead ends: 68 [2019-08-05 11:18:57,845 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:18:57,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-08-05 11:18:57,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-08-05 11:18:57,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-08-05 11:18:57,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2019-08-05 11:18:57,848 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2019-08-05 11:18:57,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:57,848 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2019-08-05 11:18:57,849 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-08-05 11:18:57,849 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2019-08-05 11:18:57,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-08-05 11:18:57,849 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:57,849 INFO L399 BasicCegarLoop]: trace histogram [63, 1, 1, 1, 1] [2019-08-05 11:18:57,850 INFO L418 AbstractCegarLoop]: === Iteration 65 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:57,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:57,850 INFO L82 PathProgramCache]: Analyzing trace with hash -2075906024, now seen corresponding path program 62 times [2019-08-05 11:18:57,850 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:57,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:57,868 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 65 conjunts are in the unsatisfiable core [2019-08-05 11:18:57,869 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:59,649 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:18:59,650 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:59,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2019-08-05 11:18:59,650 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-08-05 11:18:59,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-08-05 11:18:59,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 11:18:59,651 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 66 states. [2019-08-05 11:18:59,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:59,760 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2019-08-05 11:18:59,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-08-05 11:18:59,761 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 67 [2019-08-05 11:18:59,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:59,762 INFO L225 Difference]: With dead ends: 69 [2019-08-05 11:18:59,762 INFO L226 Difference]: Without dead ends: 69 [2019-08-05 11:18:59,762 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 11:18:59,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-05 11:18:59,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-08-05 11:18:59,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-05 11:18:59,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2019-08-05 11:18:59,765 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2019-08-05 11:18:59,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:59,765 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2019-08-05 11:18:59,765 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-08-05 11:18:59,765 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2019-08-05 11:18:59,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:18:59,766 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:59,766 INFO L399 BasicCegarLoop]: trace histogram [64, 1, 1, 1, 1] [2019-08-05 11:18:59,766 INFO L418 AbstractCegarLoop]: === Iteration 66 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:59,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:59,766 INFO L82 PathProgramCache]: Analyzing trace with hash 71659086, now seen corresponding path program 63 times [2019-08-05 11:18:59,767 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:59,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:59,784 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 66 conjunts are in the unsatisfiable core [2019-08-05 11:18:59,785 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:19:01,229 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:01,229 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:19:01,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2019-08-05 11:19:01,230 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-08-05 11:19:01,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-08-05 11:19:01,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 11:19:01,231 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 67 states. [2019-08-05 11:19:01,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:19:01,342 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-08-05 11:19:01,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-08-05 11:19:01,342 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 68 [2019-08-05 11:19:01,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:19:01,343 INFO L225 Difference]: With dead ends: 70 [2019-08-05 11:19:01,343 INFO L226 Difference]: Without dead ends: 70 [2019-08-05 11:19:01,344 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 11:19:01,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-08-05 11:19:01,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-08-05 11:19:01,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-08-05 11:19:01,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2019-08-05 11:19:01,346 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2019-08-05 11:19:01,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:19:01,347 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2019-08-05 11:19:01,347 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-08-05 11:19:01,347 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2019-08-05 11:19:01,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-08-05 11:19:01,348 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:19:01,348 INFO L399 BasicCegarLoop]: trace histogram [65, 1, 1, 1, 1] [2019-08-05 11:19:01,348 INFO L418 AbstractCegarLoop]: === Iteration 67 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:19:01,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:19:01,349 INFO L82 PathProgramCache]: Analyzing trace with hash -2073299240, now seen corresponding path program 64 times [2019-08-05 11:19:01,349 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:19:01,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:19:01,361 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 67 conjunts are in the unsatisfiable core [2019-08-05 11:19:01,362 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:19:02,952 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:02,952 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:19:02,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2019-08-05 11:19:02,953 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-08-05 11:19:02,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-08-05 11:19:02,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 11:19:02,953 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 68 states. [2019-08-05 11:19:03,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:19:03,058 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2019-08-05 11:19:03,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-08-05 11:19:03,059 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 69 [2019-08-05 11:19:03,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:19:03,060 INFO L225 Difference]: With dead ends: 71 [2019-08-05 11:19:03,060 INFO L226 Difference]: Without dead ends: 71 [2019-08-05 11:19:03,060 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:03,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-08-05 11:19:03,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-08-05 11:19:03,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-08-05 11:19:03,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2019-08-05 11:19:03,063 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2019-08-05 11:19:03,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:19:03,064 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2019-08-05 11:19:03,064 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-08-05 11:19:03,064 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-08-05 11:19:03,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-08-05 11:19:03,064 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:19:03,064 INFO L399 BasicCegarLoop]: trace histogram [66, 1, 1, 1, 1] [2019-08-05 11:19:03,065 INFO L418 AbstractCegarLoop]: === Iteration 68 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:19:03,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:19:03,065 INFO L82 PathProgramCache]: Analyzing trace with hash 152469390, now seen corresponding path program 65 times [2019-08-05 11:19:03,065 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:19:03,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:19:03,081 INFO L256 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 68 conjunts are in the unsatisfiable core [2019-08-05 11:19:03,083 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:19:05,906 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:05,906 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:19:05,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2019-08-05 11:19:05,907 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-08-05 11:19:05,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-08-05 11:19:05,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 11:19:05,908 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 69 states. [2019-08-05 11:19:06,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:19:06,008 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2019-08-05 11:19:06,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-08-05 11:19:06,008 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 70 [2019-08-05 11:19:06,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:19:06,009 INFO L225 Difference]: With dead ends: 72 [2019-08-05 11:19:06,009 INFO L226 Difference]: Without dead ends: 72 [2019-08-05 11:19:06,010 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 11:19:06,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-08-05 11:19:06,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-08-05 11:19:06,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-08-05 11:19:06,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2019-08-05 11:19:06,012 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2019-08-05 11:19:06,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:19:06,012 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2019-08-05 11:19:06,012 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-08-05 11:19:06,013 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2019-08-05 11:19:06,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-08-05 11:19:06,013 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:19:06,013 INFO L399 BasicCegarLoop]: trace histogram [67, 1, 1, 1, 1] [2019-08-05 11:19:06,014 INFO L418 AbstractCegarLoop]: === Iteration 69 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:19:06,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:19:06,014 INFO L82 PathProgramCache]: Analyzing trace with hash 431820184, now seen corresponding path program 66 times [2019-08-05 11:19:06,014 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:19:06,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:19:06,031 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 69 conjunts are in the unsatisfiable core [2019-08-05 11:19:06,033 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:19:07,696 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:07,696 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:19:07,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2019-08-05 11:19:07,697 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-08-05 11:19:07,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-08-05 11:19:07,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 11:19:07,697 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 70 states. [2019-08-05 11:19:07,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:19:07,804 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2019-08-05 11:19:07,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-08-05 11:19:07,805 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 71 [2019-08-05 11:19:07,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:19:07,805 INFO L225 Difference]: With dead ends: 73 [2019-08-05 11:19:07,806 INFO L226 Difference]: Without dead ends: 73 [2019-08-05 11:19:07,806 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:07,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-08-05 11:19:07,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-08-05 11:19:07,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-08-05 11:19:07,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-08-05 11:19:07,808 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2019-08-05 11:19:07,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:19:07,808 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2019-08-05 11:19:07,808 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-08-05 11:19:07,808 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-08-05 11:19:07,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-08-05 11:19:07,808 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:19:07,809 INFO L399 BasicCegarLoop]: trace histogram [68, 1, 1, 1, 1] [2019-08-05 11:19:07,809 INFO L418 AbstractCegarLoop]: === Iteration 70 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:19:07,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:19:07,809 INFO L82 PathProgramCache]: Analyzing trace with hash 501760206, now seen corresponding path program 67 times [2019-08-05 11:19:07,810 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:19:07,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:19:07,824 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 70 conjunts are in the unsatisfiable core [2019-08-05 11:19:07,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:19:09,691 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:09,691 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:19:09,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2019-08-05 11:19:09,691 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-08-05 11:19:09,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-08-05 11:19:09,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 11:19:09,692 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 71 states. [2019-08-05 11:19:09,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:19:09,784 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-08-05 11:19:09,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-08-05 11:19:09,785 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 72 [2019-08-05 11:19:09,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:19:09,786 INFO L225 Difference]: With dead ends: 74 [2019-08-05 11:19:09,786 INFO L226 Difference]: Without dead ends: 74 [2019-08-05 11:19:09,787 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 11:19:09,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-08-05 11:19:09,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-08-05 11:19:09,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-08-05 11:19:09,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2019-08-05 11:19:09,789 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2019-08-05 11:19:09,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:19:09,789 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2019-08-05 11:19:09,789 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-08-05 11:19:09,790 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2019-08-05 11:19:09,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-08-05 11:19:09,790 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:19:09,790 INFO L399 BasicCegarLoop]: trace histogram [69, 1, 1, 1, 1] [2019-08-05 11:19:09,790 INFO L418 AbstractCegarLoop]: === Iteration 71 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:19:09,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:19:09,791 INFO L82 PathProgramCache]: Analyzing trace with hash -1625066408, now seen corresponding path program 68 times [2019-08-05 11:19:09,791 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:19:09,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:19:09,810 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 71 conjunts are in the unsatisfiable core [2019-08-05 11:19:09,811 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:19:11,778 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:11,779 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:19:11,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2019-08-05 11:19:11,779 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-08-05 11:19:11,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-08-05 11:19:11,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 11:19:11,780 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 72 states. [2019-08-05 11:19:11,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:19:11,918 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-08-05 11:19:11,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-08-05 11:19:11,919 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 73 [2019-08-05 11:19:11,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:19:11,919 INFO L225 Difference]: With dead ends: 75 [2019-08-05 11:19:11,920 INFO L226 Difference]: Without dead ends: 75 [2019-08-05 11:19:11,920 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 11:19:11,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-08-05 11:19:11,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-08-05 11:19:11,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-05 11:19:11,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2019-08-05 11:19:11,923 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2019-08-05 11:19:11,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:19:11,923 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2019-08-05 11:19:11,923 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-08-05 11:19:11,923 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2019-08-05 11:19:11,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-08-05 11:19:11,924 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:19:11,924 INFO L399 BasicCegarLoop]: trace histogram [70, 1, 1, 1, 1] [2019-08-05 11:19:11,924 INFO L418 AbstractCegarLoop]: === Iteration 72 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:19:11,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:19:11,925 INFO L82 PathProgramCache]: Analyzing trace with hash 1162785294, now seen corresponding path program 69 times [2019-08-05 11:19:11,925 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:19:11,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:19:11,946 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 72 conjunts are in the unsatisfiable core [2019-08-05 11:19:11,948 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:19:14,070 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:14,070 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:19:14,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2019-08-05 11:19:14,071 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-08-05 11:19:14,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-08-05 11:19:14,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 11:19:14,072 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 73 states. [2019-08-05 11:19:14,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:19:14,189 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2019-08-05 11:19:14,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-08-05 11:19:14,189 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 74 [2019-08-05 11:19:14,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:19:14,190 INFO L225 Difference]: With dead ends: 76 [2019-08-05 11:19:14,190 INFO L226 Difference]: Without dead ends: 76 [2019-08-05 11:19:14,190 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 11:19:14,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-08-05 11:19:14,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-08-05 11:19:14,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-08-05 11:19:14,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2019-08-05 11:19:14,193 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2019-08-05 11:19:14,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:19:14,194 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2019-08-05 11:19:14,194 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-08-05 11:19:14,194 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2019-08-05 11:19:14,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-08-05 11:19:14,195 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:19:14,195 INFO L399 BasicCegarLoop]: trace histogram [71, 1, 1, 1, 1] [2019-08-05 11:19:14,195 INFO L418 AbstractCegarLoop]: === Iteration 73 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:19:14,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:19:14,196 INFO L82 PathProgramCache]: Analyzing trace with hash 1686842136, now seen corresponding path program 70 times [2019-08-05 11:19:14,196 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:19:14,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:19:14,217 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 73 conjunts are in the unsatisfiable core [2019-08-05 11:19:14,219 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:19:16,198 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:16,198 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:19:16,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2019-08-05 11:19:16,198 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-08-05 11:19:16,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-08-05 11:19:16,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 11:19:16,199 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 74 states. [2019-08-05 11:19:16,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:19:16,419 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2019-08-05 11:19:16,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-08-05 11:19:16,420 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 75 [2019-08-05 11:19:16,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:19:16,421 INFO L225 Difference]: With dead ends: 77 [2019-08-05 11:19:16,421 INFO L226 Difference]: Without dead ends: 77 [2019-08-05 11:19:16,421 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 11:19:16,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-08-05 11:19:16,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-08-05 11:19:16,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-05 11:19:16,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-08-05 11:19:16,424 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2019-08-05 11:19:16,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:19:16,424 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-08-05 11:19:16,424 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-08-05 11:19:16,424 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-08-05 11:19:16,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-08-05 11:19:16,425 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:19:16,425 INFO L399 BasicCegarLoop]: trace histogram [72, 1, 1, 1, 1] [2019-08-05 11:19:16,425 INFO L418 AbstractCegarLoop]: === Iteration 74 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:19:16,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:19:16,426 INFO L82 PathProgramCache]: Analyzing trace with hash 752735054, now seen corresponding path program 71 times [2019-08-05 11:19:16,426 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:19:16,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:19:16,444 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 74 conjunts are in the unsatisfiable core [2019-08-05 11:19:16,446 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:19:18,353 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:18,353 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:19:18,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2019-08-05 11:19:18,354 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-08-05 11:19:18,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-08-05 11:19:18,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 11:19:18,355 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 75 states. [2019-08-05 11:19:18,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:19:18,485 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2019-08-05 11:19:18,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-08-05 11:19:18,485 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 76 [2019-08-05 11:19:18,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:19:18,486 INFO L225 Difference]: With dead ends: 78 [2019-08-05 11:19:18,486 INFO L226 Difference]: Without dead ends: 78 [2019-08-05 11:19:18,487 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 11:19:18,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-08-05 11:19:18,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-08-05 11:19:18,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-08-05 11:19:18,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2019-08-05 11:19:18,489 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2019-08-05 11:19:18,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:19:18,489 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2019-08-05 11:19:18,489 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-08-05 11:19:18,489 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2019-08-05 11:19:18,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 11:19:18,490 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:19:18,490 INFO L399 BasicCegarLoop]: trace histogram [73, 1, 1, 1, 1] [2019-08-05 11:19:18,490 INFO L418 AbstractCegarLoop]: === Iteration 75 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:19:18,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:19:18,490 INFO L82 PathProgramCache]: Analyzing trace with hash 1860186584, now seen corresponding path program 72 times [2019-08-05 11:19:18,491 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:19:18,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:19:18,510 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 75 conjunts are in the unsatisfiable core [2019-08-05 11:19:18,511 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:19:20,611 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:20,611 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:19:20,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2019-08-05 11:19:20,612 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-08-05 11:19:20,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-08-05 11:19:20,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 11:19:20,612 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 76 states. [2019-08-05 11:19:20,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:19:20,891 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2019-08-05 11:19:20,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-08-05 11:19:20,891 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 77 [2019-08-05 11:19:20,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:19:20,892 INFO L225 Difference]: With dead ends: 79 [2019-08-05 11:19:20,892 INFO L226 Difference]: Without dead ends: 79 [2019-08-05 11:19:20,893 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 11:19:20,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-08-05 11:19:20,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-08-05 11:19:20,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-08-05 11:19:20,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2019-08-05 11:19:20,895 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77 [2019-08-05 11:19:20,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:19:20,895 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2019-08-05 11:19:20,895 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-08-05 11:19:20,896 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2019-08-05 11:19:20,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-08-05 11:19:20,896 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:19:20,896 INFO L399 BasicCegarLoop]: trace histogram [74, 1, 1, 1, 1] [2019-08-05 11:19:20,897 INFO L418 AbstractCegarLoop]: === Iteration 76 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:19:20,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:19:20,897 INFO L82 PathProgramCache]: Analyzing trace with hash 1831445646, now seen corresponding path program 73 times [2019-08-05 11:19:20,898 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:19:20,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:19:20,919 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 76 conjunts are in the unsatisfiable core [2019-08-05 11:19:20,920 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:19:23,019 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:23,019 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:19:23,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2019-08-05 11:19:23,019 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-08-05 11:19:23,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-08-05 11:19:23,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 11:19:23,020 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 77 states. [2019-08-05 11:19:23,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:19:23,119 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2019-08-05 11:19:23,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-08-05 11:19:23,120 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 78 [2019-08-05 11:19:23,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:19:23,121 INFO L225 Difference]: With dead ends: 80 [2019-08-05 11:19:23,121 INFO L226 Difference]: Without dead ends: 80 [2019-08-05 11:19:23,122 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:23,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-08-05 11:19:23,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-08-05 11:19:23,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-08-05 11:19:23,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2019-08-05 11:19:23,124 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 78 [2019-08-05 11:19:23,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:19:23,124 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2019-08-05 11:19:23,124 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-08-05 11:19:23,125 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2019-08-05 11:19:23,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-08-05 11:19:23,125 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:19:23,126 INFO L399 BasicCegarLoop]: trace histogram [75, 1, 1, 1, 1] [2019-08-05 11:19:23,126 INFO L418 AbstractCegarLoop]: === Iteration 77 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:19:23,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:19:23,126 INFO L82 PathProgramCache]: Analyzing trace with hash 940476568, now seen corresponding path program 74 times [2019-08-05 11:19:23,127 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:19:23,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:19:23,152 INFO L256 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 77 conjunts are in the unsatisfiable core [2019-08-05 11:19:23,154 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:19:25,567 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:25,567 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:19:25,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2019-08-05 11:19:25,568 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-08-05 11:19:25,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-08-05 11:19:25,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 11:19:25,569 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 78 states. [2019-08-05 11:19:25,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:19:25,931 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2019-08-05 11:19:25,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-08-05 11:19:25,931 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 79 [2019-08-05 11:19:25,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:19:25,932 INFO L225 Difference]: With dead ends: 81 [2019-08-05 11:19:25,932 INFO L226 Difference]: Without dead ends: 81 [2019-08-05 11:19:25,933 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 11:19:25,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-08-05 11:19:25,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-08-05 11:19:25,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-08-05 11:19:25,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-08-05 11:19:25,936 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 79 [2019-08-05 11:19:25,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:19:25,936 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2019-08-05 11:19:25,936 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-08-05 11:19:25,936 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-08-05 11:19:25,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-08-05 11:19:25,937 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:19:25,937 INFO L399 BasicCegarLoop]: trace histogram [76, 1, 1, 1, 1] [2019-08-05 11:19:25,937 INFO L418 AbstractCegarLoop]: === Iteration 78 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:19:25,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:19:25,937 INFO L82 PathProgramCache]: Analyzing trace with hash -909761074, now seen corresponding path program 75 times [2019-08-05 11:19:25,938 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:19:25,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:19:25,958 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 78 conjunts are in the unsatisfiable core [2019-08-05 11:19:25,959 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:19:28,023 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:28,023 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:19:28,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2019-08-05 11:19:28,023 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-08-05 11:19:28,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-08-05 11:19:28,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 11:19:28,024 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 79 states. [2019-08-05 11:19:28,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:19:28,142 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2019-08-05 11:19:28,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-08-05 11:19:28,143 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 80 [2019-08-05 11:19:28,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:19:28,144 INFO L225 Difference]: With dead ends: 82 [2019-08-05 11:19:28,144 INFO L226 Difference]: Without dead ends: 82 [2019-08-05 11:19:28,144 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 11:19:28,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-08-05 11:19:28,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2019-08-05 11:19:28,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-08-05 11:19:28,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2019-08-05 11:19:28,146 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 80 [2019-08-05 11:19:28,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:19:28,147 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2019-08-05 11:19:28,147 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-08-05 11:19:28,147 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2019-08-05 11:19:28,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-08-05 11:19:28,148 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:19:28,148 INFO L399 BasicCegarLoop]: trace histogram [77, 1, 1, 1, 1] [2019-08-05 11:19:28,148 INFO L418 AbstractCegarLoop]: === Iteration 79 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:19:28,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:19:28,148 INFO L82 PathProgramCache]: Analyzing trace with hash 1862414168, now seen corresponding path program 76 times [2019-08-05 11:19:28,149 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:19:28,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:19:28,168 INFO L256 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 79 conjunts are in the unsatisfiable core [2019-08-05 11:19:28,170 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:19:30,540 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:30,540 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:19:30,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2019-08-05 11:19:30,541 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-08-05 11:19:30,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-08-05 11:19:30,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 11:19:30,542 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 80 states. [2019-08-05 11:19:30,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:19:30,652 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2019-08-05 11:19:30,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-08-05 11:19:30,652 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 81 [2019-08-05 11:19:30,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:19:30,653 INFO L225 Difference]: With dead ends: 83 [2019-08-05 11:19:30,653 INFO L226 Difference]: Without dead ends: 83 [2019-08-05 11:19:30,654 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 11:19:30,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-08-05 11:19:30,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-08-05 11:19:30,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-08-05 11:19:30,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2019-08-05 11:19:30,656 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 81 [2019-08-05 11:19:30,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:19:30,657 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2019-08-05 11:19:30,657 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-08-05 11:19:30,657 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2019-08-05 11:19:30,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-08-05 11:19:30,657 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:19:30,657 INFO L399 BasicCegarLoop]: trace histogram [78, 1, 1, 1, 1] [2019-08-05 11:19:30,657 INFO L418 AbstractCegarLoop]: === Iteration 80 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:19:30,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:19:30,658 INFO L82 PathProgramCache]: Analyzing trace with hash 1900500750, now seen corresponding path program 77 times [2019-08-05 11:19:30,658 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:19:30,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:19:30,676 INFO L256 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 80 conjunts are in the unsatisfiable core [2019-08-05 11:19:30,677 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:19:32,879 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:19:32,879 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:19:32,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2019-08-05 11:19:32,879 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-08-05 11:19:32,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-08-05 11:19:32,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 11:19:32,880 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 81 states. [2019-08-05 11:19:32,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:19:32,989 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2019-08-05 11:19:32,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-08-05 11:19:32,989 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 82 [2019-08-05 11:19:32,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:19:32,990 INFO L225 Difference]: With dead ends: 84 [2019-08-05 11:19:32,990 INFO L226 Difference]: Without dead ends: 84 [2019-08-05 11:19:32,991 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 11:19:32,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-08-05 11:19:32,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2019-08-05 11:19:32,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-08-05 11:19:32,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2019-08-05 11:19:32,993 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 82 [2019-08-05 11:19:32,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:19:32,993 INFO L475 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2019-08-05 11:19:32,993 INFO L476 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-08-05 11:19:32,994 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2019-08-05 11:19:32,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-08-05 11:19:32,994 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:19:32,994 INFO L399 BasicCegarLoop]: trace histogram [79, 1, 1, 1, 1] [2019-08-05 11:19:32,994 INFO L418 AbstractCegarLoop]: === Iteration 81 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:19:32,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:19:32,995 INFO L82 PathProgramCache]: Analyzing trace with hash -1213782504, now seen corresponding path program 78 times [2019-08-05 11:19:32,995 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:19:33,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:19:33,010 INFO L256 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 81 conjunts are in the unsatisfiable core [2019-08-05 11:19:33,012 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:19:37,354 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:19:37,355 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:19:37,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2019-08-05 11:19:37,355 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-08-05 11:19:37,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-08-05 11:19:37,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-08-05 11:19:37,356 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 82 states. [2019-08-05 11:19:37,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:19:37,456 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2019-08-05 11:19:37,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-08-05 11:19:37,457 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 83 [2019-08-05 11:19:37,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:19:37,458 INFO L225 Difference]: With dead ends: 85 [2019-08-05 11:19:37,458 INFO L226 Difference]: Without dead ends: 85 [2019-08-05 11:19:37,458 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-08-05 11:19:37,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-08-05 11:19:37,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-08-05 11:19:37,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-08-05 11:19:37,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2019-08-05 11:19:37,460 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 83 [2019-08-05 11:19:37,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:19:37,460 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2019-08-05 11:19:37,460 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-08-05 11:19:37,460 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2019-08-05 11:19:37,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-08-05 11:19:37,461 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:19:37,461 INFO L399 BasicCegarLoop]: trace histogram [80, 1, 1, 1, 1] [2019-08-05 11:19:37,461 INFO L418 AbstractCegarLoop]: === Iteration 82 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:19:37,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:19:37,461 INFO L82 PathProgramCache]: Analyzing trace with hash 1027684430, now seen corresponding path program 79 times [2019-08-05 11:19:37,462 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:19:37,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:19:37,479 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 82 conjunts are in the unsatisfiable core [2019-08-05 11:19:37,481 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:19:39,814 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:19:39,814 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:19:39,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2019-08-05 11:19:39,815 INFO L454 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-08-05 11:19:39,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-08-05 11:19:39,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 11:19:39,815 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 83 states. [2019-08-05 11:19:40,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:19:40,677 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2019-08-05 11:19:40,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-08-05 11:19:40,678 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 84 [2019-08-05 11:19:40,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:19:40,679 INFO L225 Difference]: With dead ends: 86 [2019-08-05 11:19:40,679 INFO L226 Difference]: Without dead ends: 86 [2019-08-05 11:19:40,680 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 11:19:40,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-08-05 11:19:40,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2019-08-05 11:19:40,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-08-05 11:19:40,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2019-08-05 11:19:40,682 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 84 [2019-08-05 11:19:40,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:19:40,683 INFO L475 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2019-08-05 11:19:40,683 INFO L476 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-08-05 11:19:40,683 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2019-08-05 11:19:40,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 11:19:40,684 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:19:40,684 INFO L399 BasicCegarLoop]: trace histogram [81, 1, 1, 1, 1] [2019-08-05 11:19:40,685 INFO L418 AbstractCegarLoop]: === Iteration 83 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:19:40,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:19:40,685 INFO L82 PathProgramCache]: Analyzing trace with hash 1793682648, now seen corresponding path program 80 times [2019-08-05 11:19:40,686 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:19:40,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:19:40,720 INFO L256 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 83 conjunts are in the unsatisfiable core [2019-08-05 11:19:40,722 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:19:43,692 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:19:43,692 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:19:43,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2019-08-05 11:19:43,693 INFO L454 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-08-05 11:19:43,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-08-05 11:19:43,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-08-05 11:19:43,694 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 84 states. [2019-08-05 11:19:43,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:19:43,859 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2019-08-05 11:19:43,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-08-05 11:19:43,859 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 85 [2019-08-05 11:19:43,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:19:43,860 INFO L225 Difference]: With dead ends: 87 [2019-08-05 11:19:43,860 INFO L226 Difference]: Without dead ends: 87 [2019-08-05 11:19:43,861 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-08-05 11:19:43,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-08-05 11:19:43,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-08-05 11:19:43,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-08-05 11:19:43,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2019-08-05 11:19:43,863 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 85 [2019-08-05 11:19:43,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:19:43,863 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2019-08-05 11:19:43,863 INFO L476 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-08-05 11:19:43,863 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2019-08-05 11:19:43,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-08-05 11:19:43,864 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:19:43,864 INFO L399 BasicCegarLoop]: trace histogram [82, 1, 1, 1, 1] [2019-08-05 11:19:43,864 INFO L418 AbstractCegarLoop]: === Iteration 84 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:19:43,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:19:43,864 INFO L82 PathProgramCache]: Analyzing trace with hash -230176370, now seen corresponding path program 81 times [2019-08-05 11:19:43,865 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:19:43,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:19:43,880 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 84 conjunts are in the unsatisfiable core [2019-08-05 11:19:43,881 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:19:46,741 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:19:46,741 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:19:46,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2019-08-05 11:19:46,742 INFO L454 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-08-05 11:19:46,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-08-05 11:19:46,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2019-08-05 11:19:46,743 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 85 states. [2019-08-05 11:19:46,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:19:46,889 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2019-08-05 11:19:46,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-08-05 11:19:46,889 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 86 [2019-08-05 11:19:46,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:19:46,890 INFO L225 Difference]: With dead ends: 88 [2019-08-05 11:19:46,890 INFO L226 Difference]: Without dead ends: 88 [2019-08-05 11:19:46,891 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2019-08-05 11:19:46,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-08-05 11:19:46,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2019-08-05 11:19:46,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-08-05 11:19:46,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2019-08-05 11:19:46,893 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 86 [2019-08-05 11:19:46,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:19:46,893 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2019-08-05 11:19:46,893 INFO L476 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-08-05 11:19:46,893 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2019-08-05 11:19:46,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-08-05 11:19:46,893 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:19:46,893 INFO L399 BasicCegarLoop]: trace histogram [83, 1, 1, 1, 1] [2019-08-05 11:19:46,894 INFO L418 AbstractCegarLoop]: === Iteration 85 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:19:46,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:19:46,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1454703512, now seen corresponding path program 82 times [2019-08-05 11:19:46,895 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:19:46,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:19:46,912 INFO L256 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 85 conjunts are in the unsatisfiable core [2019-08-05 11:19:46,913 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:19:49,404 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:19:49,404 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:19:49,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2019-08-05 11:19:49,405 INFO L454 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-08-05 11:19:49,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-08-05 11:19:49,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-08-05 11:19:49,406 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 86 states. [2019-08-05 11:19:49,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:19:49,618 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2019-08-05 11:19:49,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-08-05 11:19:49,618 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 87 [2019-08-05 11:19:49,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:19:49,619 INFO L225 Difference]: With dead ends: 89 [2019-08-05 11:19:49,619 INFO L226 Difference]: Without dead ends: 89 [2019-08-05 11:19:49,620 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:19:49,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-08-05 11:19:49,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-08-05 11:19:49,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-08-05 11:19:49,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2019-08-05 11:19:49,622 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 87 [2019-08-05 11:19:49,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:19:49,622 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2019-08-05 11:19:49,622 INFO L476 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-08-05 11:19:49,623 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2019-08-05 11:19:49,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-08-05 11:19:49,623 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:19:49,623 INFO L399 BasicCegarLoop]: trace histogram [84, 1, 1, 1, 1] [2019-08-05 11:19:49,624 INFO L418 AbstractCegarLoop]: === Iteration 86 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:19:49,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:19:49,624 INFO L82 PathProgramCache]: Analyzing trace with hash 2146372302, now seen corresponding path program 83 times [2019-08-05 11:19:49,625 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:19:49,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:19:49,640 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 86 conjunts are in the unsatisfiable core [2019-08-05 11:19:49,641 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:19:52,368 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:19:52,369 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:19:52,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2019-08-05 11:19:52,369 INFO L454 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-08-05 11:19:52,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-08-05 11:19:52,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2019-08-05 11:19:52,370 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 87 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 90 states and 90 transitions. [2019-08-05 11:19:52,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-08-05 11:19:52,495 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 88 [2019-08-05 11:19:52,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:19:52,496 INFO L225 Difference]: With dead ends: 90 [2019-08-05 11:19:52,496 INFO L226 Difference]: Without dead ends: 90 [2019-08-05 11:19:52,497 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:19:52,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-08-05 11:19:52,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2019-08-05 11:19:52,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-08-05 11:19:52,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2019-08-05 11:19:52,500 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 88 [2019-08-05 11:19:52,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:19:52,500 INFO L475 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2019-08-05 11:19:52,500 INFO L476 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-08-05 11:19:52,500 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2019-08-05 11:19:52,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-08-05 11:19:52,501 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:19:52,501 INFO L399 BasicCegarLoop]: trace histogram [85, 1, 1, 1, 1] [2019-08-05 11:19:52,501 INFO L418 AbstractCegarLoop]: === Iteration 87 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:19:52,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:19:52,501 INFO L82 PathProgramCache]: Analyzing trace with hash 2113268312, now seen corresponding path program 84 times [2019-08-05 11:19:52,502 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:19:52,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:19:52,521 INFO L256 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 87 conjunts are in the unsatisfiable core [2019-08-05 11:19:52,522 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:19:55,087 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:19:55,087 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:19:55,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2019-08-05 11:19:55,088 INFO L454 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-08-05 11:19:55,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-08-05 11:19:55,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-08-05 11:19:55,089 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 88 states. [2019-08-05 11:19:55,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:19:55,309 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2019-08-05 11:19:55,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-08-05 11:19:55,309 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 89 [2019-08-05 11:19:55,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:19:55,310 INFO L225 Difference]: With dead ends: 91 [2019-08-05 11:19:55,310 INFO L226 Difference]: Without dead ends: 91 [2019-08-05 11:19:55,310 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-08-05 11:19:55,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-08-05 11:19:55,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-08-05 11:19:55,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-08-05 11:19:55,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2019-08-05 11:19:55,312 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 89 [2019-08-05 11:19:55,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:19:55,313 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2019-08-05 11:19:55,313 INFO L476 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-08-05 11:19:55,313 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2019-08-05 11:19:55,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-08-05 11:19:55,313 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:19:55,313 INFO L399 BasicCegarLoop]: trace histogram [86, 1, 1, 1, 1] [2019-08-05 11:19:55,314 INFO L418 AbstractCegarLoop]: === Iteration 88 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:19:55,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:19:55,314 INFO L82 PathProgramCache]: Analyzing trace with hash 1087044622, now seen corresponding path program 85 times [2019-08-05 11:19:55,314 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:19:55,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:19:55,332 INFO L256 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 88 conjunts are in the unsatisfiable core [2019-08-05 11:19:55,333 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:19:58,102 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:19:58,102 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:19:58,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2019-08-05 11:19:58,102 INFO L454 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-08-05 11:19:58,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-08-05 11:19:58,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2019-08-05 11:19:58,103 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 89 states. [2019-08-05 11:19:58,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:19:58,234 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2019-08-05 11:19:58,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-08-05 11:19:58,235 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 90 [2019-08-05 11:19:58,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:19:58,236 INFO L225 Difference]: With dead ends: 92 [2019-08-05 11:19:58,236 INFO L226 Difference]: Without dead ends: 92 [2019-08-05 11:19:58,237 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:19:58,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-08-05 11:19:58,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2019-08-05 11:19:58,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-08-05 11:19:58,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2019-08-05 11:19:58,239 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 90 [2019-08-05 11:19:58,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:19:58,239 INFO L475 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2019-08-05 11:19:58,239 INFO L476 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-08-05 11:19:58,239 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2019-08-05 11:19:58,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-08-05 11:19:58,239 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:19:58,240 INFO L399 BasicCegarLoop]: trace histogram [87, 1, 1, 1, 1] [2019-08-05 11:19:58,240 INFO L418 AbstractCegarLoop]: === Iteration 89 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:19:58,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:19:58,240 INFO L82 PathProgramCache]: Analyzing trace with hash -661118696, now seen corresponding path program 86 times [2019-08-05 11:19:58,240 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:19:58,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:19:58,263 INFO L256 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 89 conjunts are in the unsatisfiable core [2019-08-05 11:19:58,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:20:01,211 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:01,211 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:20:01,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2019-08-05 11:20:01,211 INFO L454 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-08-05 11:20:01,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-08-05 11:20:01,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-08-05 11:20:01,212 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 90 states. [2019-08-05 11:20:01,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:20:01,356 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2019-08-05 11:20:01,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-08-05 11:20:01,356 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 91 [2019-08-05 11:20:01,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:20:01,357 INFO L225 Difference]: With dead ends: 93 [2019-08-05 11:20:01,357 INFO L226 Difference]: Without dead ends: 93 [2019-08-05 11:20:01,358 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-08-05 11:20:01,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-08-05 11:20:01,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2019-08-05 11:20:01,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-08-05 11:20:01,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2019-08-05 11:20:01,361 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 91 [2019-08-05 11:20:01,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:20:01,361 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2019-08-05 11:20:01,361 INFO L476 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-08-05 11:20:01,361 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2019-08-05 11:20:01,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-08-05 11:20:01,362 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:20:01,362 INFO L399 BasicCegarLoop]: trace histogram [88, 1, 1, 1, 1] [2019-08-05 11:20:01,362 INFO L418 AbstractCegarLoop]: === Iteration 90 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:20:01,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:20:01,363 INFO L82 PathProgramCache]: Analyzing trace with hash 980393294, now seen corresponding path program 87 times [2019-08-05 11:20:01,363 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:20:01,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:20:01,388 INFO L256 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 90 conjunts are in the unsatisfiable core [2019-08-05 11:20:01,390 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:20:04,127 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:04,127 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:20:04,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2019-08-05 11:20:04,127 INFO L454 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-08-05 11:20:04,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-08-05 11:20:04,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2019-08-05 11:20:04,129 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 91 states. [2019-08-05 11:20:04,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:20:04,259 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2019-08-05 11:20:04,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-08-05 11:20:04,260 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 92 [2019-08-05 11:20:04,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:20:04,260 INFO L225 Difference]: With dead ends: 94 [2019-08-05 11:20:04,261 INFO L226 Difference]: Without dead ends: 94 [2019-08-05 11:20:04,261 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2019-08-05 11:20:04,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-08-05 11:20:04,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2019-08-05 11:20:04,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-08-05 11:20:04,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2019-08-05 11:20:04,263 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 92 [2019-08-05 11:20:04,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:20:04,263 INFO L475 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2019-08-05 11:20:04,264 INFO L476 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-08-05 11:20:04,264 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2019-08-05 11:20:04,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:20:04,264 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:20:04,264 INFO L399 BasicCegarLoop]: trace histogram [89, 1, 1, 1, 1] [2019-08-05 11:20:04,264 INFO L418 AbstractCegarLoop]: === Iteration 91 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:20:04,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:20:04,265 INFO L82 PathProgramCache]: Analyzing trace with hash 327657432, now seen corresponding path program 88 times [2019-08-05 11:20:04,265 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:20:04,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:20:04,291 INFO L256 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 91 conjunts are in the unsatisfiable core [2019-08-05 11:20:04,293 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:20:07,524 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:07,524 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:20:07,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2019-08-05 11:20:07,525 INFO L454 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-08-05 11:20:07,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-08-05 11:20:07,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-08-05 11:20:07,525 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 92 states. [2019-08-05 11:20:07,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:20:07,652 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2019-08-05 11:20:07,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-08-05 11:20:07,653 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 93 [2019-08-05 11:20:07,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:20:07,654 INFO L225 Difference]: With dead ends: 95 [2019-08-05 11:20:07,654 INFO L226 Difference]: Without dead ends: 95 [2019-08-05 11:20:07,655 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-08-05 11:20:07,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-08-05 11:20:07,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2019-08-05 11:20:07,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-08-05 11:20:07,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2019-08-05 11:20:07,657 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 93 [2019-08-05 11:20:07,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:20:07,657 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2019-08-05 11:20:07,657 INFO L476 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-08-05 11:20:07,657 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2019-08-05 11:20:07,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-08-05 11:20:07,658 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:20:07,658 INFO L399 BasicCegarLoop]: trace histogram [90, 1, 1, 1, 1] [2019-08-05 11:20:07,658 INFO L418 AbstractCegarLoop]: === Iteration 92 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:20:07,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:20:07,658 INFO L82 PathProgramCache]: Analyzing trace with hash 1567682190, now seen corresponding path program 89 times [2019-08-05 11:20:07,659 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:20:07,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:20:07,680 INFO L256 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 92 conjunts are in the unsatisfiable core [2019-08-05 11:20:07,682 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:20:10,500 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:10,500 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:20:10,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2019-08-05 11:20:10,501 INFO L454 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-08-05 11:20:10,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-08-05 11:20:10,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2019-08-05 11:20:10,502 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 93 states. [2019-08-05 11:20:10,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:20:10,699 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2019-08-05 11:20:10,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-08-05 11:20:10,699 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 94 [2019-08-05 11:20:10,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:20:10,700 INFO L225 Difference]: With dead ends: 96 [2019-08-05 11:20:10,700 INFO L226 Difference]: Without dead ends: 96 [2019-08-05 11:20:10,700 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2019-08-05 11:20:10,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-08-05 11:20:10,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2019-08-05 11:20:10,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-08-05 11:20:10,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2019-08-05 11:20:10,702 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 94 [2019-08-05 11:20:10,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:20:10,702 INFO L475 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2019-08-05 11:20:10,702 INFO L476 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-08-05 11:20:10,702 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2019-08-05 11:20:10,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-08-05 11:20:10,703 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:20:10,703 INFO L399 BasicCegarLoop]: trace histogram [91, 1, 1, 1, 1] [2019-08-05 11:20:10,703 INFO L418 AbstractCegarLoop]: === Iteration 93 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:20:10,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:20:10,703 INFO L82 PathProgramCache]: Analyzing trace with hash 1353744024, now seen corresponding path program 90 times [2019-08-05 11:20:10,704 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:20:10,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:20:10,733 INFO L256 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 93 conjunts are in the unsatisfiable core [2019-08-05 11:20:10,734 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:20:13,729 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:13,730 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:20:13,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2019-08-05 11:20:13,730 INFO L454 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-08-05 11:20:13,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-08-05 11:20:13,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-08-05 11:20:13,731 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 94 states. [2019-08-05 11:20:13,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:20:13,904 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2019-08-05 11:20:13,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-08-05 11:20:13,904 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 95 [2019-08-05 11:20:13,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:20:13,905 INFO L225 Difference]: With dead ends: 97 [2019-08-05 11:20:13,905 INFO L226 Difference]: Without dead ends: 97 [2019-08-05 11:20:13,906 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-08-05 11:20:13,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-08-05 11:20:13,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2019-08-05 11:20:13,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-08-05 11:20:13,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2019-08-05 11:20:13,908 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 95 [2019-08-05 11:20:13,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:20:13,908 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2019-08-05 11:20:13,908 INFO L476 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-08-05 11:20:13,908 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2019-08-05 11:20:13,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-08-05 11:20:13,909 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:20:13,909 INFO L399 BasicCegarLoop]: trace histogram [92, 1, 1, 1, 1] [2019-08-05 11:20:13,909 INFO L418 AbstractCegarLoop]: === Iteration 94 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:20:13,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:20:13,909 INFO L82 PathProgramCache]: Analyzing trace with hash -983371826, now seen corresponding path program 91 times [2019-08-05 11:20:13,910 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:20:13,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:20:13,937 INFO L256 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 94 conjunts are in the unsatisfiable core [2019-08-05 11:20:13,939 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:20:17,155 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:17,155 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:20:17,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2019-08-05 11:20:17,156 INFO L454 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-08-05 11:20:17,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-08-05 11:20:17,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2019-08-05 11:20:17,157 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 95 states. [2019-08-05 11:20:17,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:20:17,304 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2019-08-05 11:20:17,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-08-05 11:20:17,305 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 96 [2019-08-05 11:20:17,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:20:17,305 INFO L225 Difference]: With dead ends: 98 [2019-08-05 11:20:17,306 INFO L226 Difference]: Without dead ends: 98 [2019-08-05 11:20:17,306 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2019-08-05 11:20:17,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-08-05 11:20:17,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2019-08-05 11:20:17,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-08-05 11:20:17,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2019-08-05 11:20:17,308 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 96 [2019-08-05 11:20:17,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:20:17,308 INFO L475 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2019-08-05 11:20:17,308 INFO L476 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-08-05 11:20:17,308 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2019-08-05 11:20:17,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-08-05 11:20:17,309 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:20:17,309 INFO L399 BasicCegarLoop]: trace histogram [93, 1, 1, 1, 1] [2019-08-05 11:20:17,309 INFO L418 AbstractCegarLoop]: === Iteration 95 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:20:17,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:20:17,309 INFO L82 PathProgramCache]: Analyzing trace with hash -419519144, now seen corresponding path program 92 times [2019-08-05 11:20:17,310 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:20:17,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:20:17,335 INFO L256 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 95 conjunts are in the unsatisfiable core [2019-08-05 11:20:17,337 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:20:20,432 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:20,432 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:20:20,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2019-08-05 11:20:20,432 INFO L454 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-08-05 11:20:20,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-08-05 11:20:20,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-08-05 11:20:20,433 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 96 states. [2019-08-05 11:20:20,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:20:20,559 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2019-08-05 11:20:20,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-08-05 11:20:20,560 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 97 [2019-08-05 11:20:20,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:20:20,561 INFO L225 Difference]: With dead ends: 99 [2019-08-05 11:20:20,561 INFO L226 Difference]: Without dead ends: 99 [2019-08-05 11:20:20,562 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:20,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-08-05 11:20:20,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2019-08-05 11:20:20,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-08-05 11:20:20,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2019-08-05 11:20:20,564 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 97 [2019-08-05 11:20:20,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:20:20,564 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2019-08-05 11:20:20,564 INFO L476 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-08-05 11:20:20,564 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2019-08-05 11:20:20,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-08-05 11:20:20,565 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:20:20,565 INFO L399 BasicCegarLoop]: trace histogram [94, 1, 1, 1, 1] [2019-08-05 11:20:20,565 INFO L418 AbstractCegarLoop]: === Iteration 96 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:20:20,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:20:20,565 INFO L82 PathProgramCache]: Analyzing trace with hash -119955186, now seen corresponding path program 93 times [2019-08-05 11:20:20,566 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:20:20,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:20:20,585 INFO L256 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 96 conjunts are in the unsatisfiable core [2019-08-05 11:20:20,586 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:20:24,254 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:24,254 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:20:24,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2019-08-05 11:20:24,254 INFO L454 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-08-05 11:20:24,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-08-05 11:20:24,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2019-08-05 11:20:24,256 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 97 states. [2019-08-05 11:20:24,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:20:24,411 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2019-08-05 11:20:24,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-08-05 11:20:24,412 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 98 [2019-08-05 11:20:24,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:20:24,412 INFO L225 Difference]: With dead ends: 100 [2019-08-05 11:20:24,413 INFO L226 Difference]: Without dead ends: 100 [2019-08-05 11:20:24,413 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2019-08-05 11:20:24,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-08-05 11:20:24,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-08-05 11:20:24,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-08-05 11:20:24,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2019-08-05 11:20:24,415 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 98 [2019-08-05 11:20:24,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:20:24,416 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2019-08-05 11:20:24,416 INFO L476 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-08-05 11:20:24,416 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2019-08-05 11:20:24,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-08-05 11:20:24,417 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:20:24,417 INFO L399 BasicCegarLoop]: trace histogram [95, 1, 1, 1, 1] [2019-08-05 11:20:24,418 INFO L418 AbstractCegarLoop]: === Iteration 97 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:20:24,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:20:24,418 INFO L82 PathProgramCache]: Analyzing trace with hash 576592920, now seen corresponding path program 94 times [2019-08-05 11:20:24,418 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:20:24,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:20:24,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 97 conjunts are in the unsatisfiable core [2019-08-05 11:20:24,442 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:20:27,939 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:27,939 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:20:27,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2019-08-05 11:20:27,940 INFO L454 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-08-05 11:20:27,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-08-05 11:20:27,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-08-05 11:20:27,941 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 98 states. [2019-08-05 11:20:28,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:20:28,100 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2019-08-05 11:20:28,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-08-05 11:20:28,101 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 99 [2019-08-05 11:20:28,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:20:28,102 INFO L225 Difference]: With dead ends: 101 [2019-08-05 11:20:28,102 INFO L226 Difference]: Without dead ends: 101 [2019-08-05 11:20:28,103 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-08-05 11:20:28,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-08-05 11:20:28,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2019-08-05 11:20:28,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-08-05 11:20:28,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2019-08-05 11:20:28,105 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 99 [2019-08-05 11:20:28,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:20:28,105 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2019-08-05 11:20:28,105 INFO L476 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-08-05 11:20:28,105 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2019-08-05 11:20:28,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-08-05 11:20:28,106 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:20:28,106 INFO L399 BasicCegarLoop]: trace histogram [96, 1, 1, 1, 1] [2019-08-05 11:20:28,106 INFO L418 AbstractCegarLoop]: === Iteration 98 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:20:28,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:20:28,106 INFO L82 PathProgramCache]: Analyzing trace with hash 694747726, now seen corresponding path program 95 times [2019-08-05 11:20:28,107 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:20:28,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:20:28,125 INFO L256 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 98 conjunts are in the unsatisfiable core [2019-08-05 11:20:28,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:20:31,641 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:20:31,641 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:20:31,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2019-08-05 11:20:31,641 INFO L454 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-08-05 11:20:31,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-08-05 11:20:31,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2019-08-05 11:20:31,642 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 99 states. [2019-08-05 11:20:31,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:20:31,819 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2019-08-05 11:20:31,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-08-05 11:20:31,819 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 100 [2019-08-05 11:20:31,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:20:31,820 INFO L225 Difference]: With dead ends: 102 [2019-08-05 11:20:31,820 INFO L226 Difference]: Without dead ends: 102 [2019-08-05 11:20:31,821 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2019-08-05 11:20:31,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-08-05 11:20:31,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2019-08-05 11:20:31,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-08-05 11:20:31,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2019-08-05 11:20:31,823 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 100 [2019-08-05 11:20:31,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:20:31,823 INFO L475 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2019-08-05 11:20:31,823 INFO L476 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-08-05 11:20:31,823 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2019-08-05 11:20:31,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:20:31,824 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:20:31,824 INFO L399 BasicCegarLoop]: trace histogram [97, 1, 1, 1, 1] [2019-08-05 11:20:31,824 INFO L418 AbstractCegarLoop]: === Iteration 99 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:20:31,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:20:31,824 INFO L82 PathProgramCache]: Analyzing trace with hash 62579416, now seen corresponding path program 96 times [2019-08-05 11:20:31,825 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:20:31,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:20:31,844 INFO L256 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 99 conjunts are in the unsatisfiable core [2019-08-05 11:20:31,845 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:20:35,160 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:20:35,160 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:20:35,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2019-08-05 11:20:35,161 INFO L454 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-08-05 11:20:35,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-08-05 11:20:35,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-08-05 11:20:35,162 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 100 states. [2019-08-05 11:20:35,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:20:35,380 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2019-08-05 11:20:35,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-08-05 11:20:35,381 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 101 [2019-08-05 11:20:35,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:20:35,382 INFO L225 Difference]: With dead ends: 103 [2019-08-05 11:20:35,382 INFO L226 Difference]: Without dead ends: 103 [2019-08-05 11:20:35,383 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-08-05 11:20:35,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-08-05 11:20:35,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2019-08-05 11:20:35,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-08-05 11:20:35,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2019-08-05 11:20:35,386 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 101 [2019-08-05 11:20:35,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:20:35,386 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2019-08-05 11:20:35,386 INFO L476 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-08-05 11:20:35,386 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2019-08-05 11:20:35,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-08-05 11:20:35,386 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:20:35,387 INFO L399 BasicCegarLoop]: trace histogram [98, 1, 1, 1, 1] [2019-08-05 11:20:35,387 INFO L418 AbstractCegarLoop]: === Iteration 100 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:20:35,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:20:35,387 INFO L82 PathProgramCache]: Analyzing trace with hash 1940198286, now seen corresponding path program 97 times [2019-08-05 11:20:35,387 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:20:35,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:20:35,414 INFO L256 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 100 conjunts are in the unsatisfiable core [2019-08-05 11:20:35,416 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:20:39,039 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:20:39,039 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:20:39,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100] total 100 [2019-08-05 11:20:39,039 INFO L454 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-08-05 11:20:39,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-08-05 11:20:39,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2019-08-05 11:20:39,040 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 101 states. [2019-08-05 11:20:39,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:20:39,192 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2019-08-05 11:20:39,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-08-05 11:20:39,192 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 102 [2019-08-05 11:20:39,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:20:39,193 INFO L225 Difference]: With dead ends: 104 [2019-08-05 11:20:39,194 INFO L226 Difference]: Without dead ends: 104 [2019-08-05 11:20:39,194 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2019-08-05 11:20:39,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-08-05 11:20:39,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-08-05 11:20:39,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-08-05 11:20:39,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2019-08-05 11:20:39,197 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 102 [2019-08-05 11:20:39,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:20:39,198 INFO L475 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2019-08-05 11:20:39,198 INFO L476 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-08-05 11:20:39,198 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2019-08-05 11:20:39,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-08-05 11:20:39,198 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:20:39,198 INFO L399 BasicCegarLoop]: trace histogram [99, 1, 1, 1, 1] [2019-08-05 11:20:39,199 INFO L418 AbstractCegarLoop]: === Iteration 101 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:20:39,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:20:39,199 INFO L82 PathProgramCache]: Analyzing trace with hash 16841112, now seen corresponding path program 98 times [2019-08-05 11:20:39,199 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:20:39,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:20:39,222 INFO L256 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 101 conjunts are in the unsatisfiable core [2019-08-05 11:20:39,224 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:20:42,936 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:20:42,937 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:20:42,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2019-08-05 11:20:42,937 INFO L454 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-08-05 11:20:42,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-08-05 11:20:42,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-08-05 11:20:42,951 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 102 states. [2019-08-05 11:20:43,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:20:43,131 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2019-08-05 11:20:43,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-08-05 11:20:43,131 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 103 [2019-08-05 11:20:43,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:20:43,132 INFO L225 Difference]: With dead ends: 105 [2019-08-05 11:20:43,132 INFO L226 Difference]: Without dead ends: 105 [2019-08-05 11:20:43,133 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-08-05 11:20:43,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-08-05 11:20:43,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2019-08-05 11:20:43,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-08-05 11:20:43,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2019-08-05 11:20:43,136 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 103 [2019-08-05 11:20:43,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:20:43,136 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2019-08-05 11:20:43,136 INFO L476 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-08-05 11:20:43,136 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2019-08-05 11:20:43,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-08-05 11:20:43,137 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:20:43,137 INFO L399 BasicCegarLoop]: trace histogram [100, 1, 1, 1, 1] [2019-08-05 11:20:43,137 INFO L418 AbstractCegarLoop]: === Iteration 102 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:20:43,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:20:43,137 INFO L82 PathProgramCache]: Analyzing trace with hash 522310862, now seen corresponding path program 99 times [2019-08-05 11:20:43,138 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:20:43,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:20:43,162 INFO L256 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 102 conjunts are in the unsatisfiable core [2019-08-05 11:20:43,164 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:20:46,747 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:20:46,747 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:20:46,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102] total 102 [2019-08-05 11:20:46,747 INFO L454 AbstractCegarLoop]: Interpolant automaton has 103 states [2019-08-05 11:20:46,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2019-08-05 11:20:46,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2019-08-05 11:20:46,749 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 103 states. [2019-08-05 11:20:46,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:20:46,921 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2019-08-05 11:20:46,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-08-05 11:20:46,921 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 104 [2019-08-05 11:20:46,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:20:46,922 INFO L225 Difference]: With dead ends: 106 [2019-08-05 11:20:46,923 INFO L226 Difference]: Without dead ends: 106 [2019-08-05 11:20:46,924 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:20:46,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-08-05 11:20:46,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2019-08-05 11:20:46,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-08-05 11:20:46,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2019-08-05 11:20:46,926 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 104 [2019-08-05 11:20:46,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:20:46,926 INFO L475 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2019-08-05 11:20:46,926 INFO L476 AbstractCegarLoop]: Interpolant automaton has 103 states. [2019-08-05 11:20:46,927 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2019-08-05 11:20:46,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-08-05 11:20:46,927 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:20:46,927 INFO L399 BasicCegarLoop]: trace histogram [101, 1, 1, 1, 1] [2019-08-05 11:20:46,928 INFO L418 AbstractCegarLoop]: === Iteration 103 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:20:46,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:20:46,928 INFO L82 PathProgramCache]: Analyzing trace with hash -987996072, now seen corresponding path program 100 times [2019-08-05 11:20:46,928 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:20:46,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:20:46,968 INFO L256 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 103 conjunts are in the unsatisfiable core [2019-08-05 11:20:46,969 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:20:50,558 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:20:50,558 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:20:50,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2019-08-05 11:20:50,559 INFO L454 AbstractCegarLoop]: Interpolant automaton has 104 states [2019-08-05 11:20:50,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2019-08-05 11:20:50,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-08-05 11:20:50,560 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 104 states. [2019-08-05 11:20:50,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:20:50,753 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2019-08-05 11:20:50,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-08-05 11:20:50,754 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 105 [2019-08-05 11:20:50,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:20:50,755 INFO L225 Difference]: With dead ends: 107 [2019-08-05 11:20:50,755 INFO L226 Difference]: Without dead ends: 107 [2019-08-05 11:20:50,756 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-08-05 11:20:50,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-08-05 11:20:50,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-08-05 11:20:50,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-08-05 11:20:50,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2019-08-05 11:20:50,758 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 105 [2019-08-05 11:20:50,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:20:50,759 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2019-08-05 11:20:50,759 INFO L476 AbstractCegarLoop]: Interpolant automaton has 104 states. [2019-08-05 11:20:50,759 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2019-08-05 11:20:50,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-08-05 11:20:50,760 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:20:50,760 INFO L399 BasicCegarLoop]: trace histogram [102, 1, 1, 1, 1] [2019-08-05 11:20:50,760 INFO L418 AbstractCegarLoop]: === Iteration 104 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:20:50,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:20:50,760 INFO L82 PathProgramCache]: Analyzing trace with hash -562870770, now seen corresponding path program 101 times [2019-08-05 11:20:50,761 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:20:50,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:20:50,789 INFO L256 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 104 conjunts are in the unsatisfiable core [2019-08-05 11:20:50,791 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:20:54,919 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:20:54,919 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:20:54,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104] total 104 [2019-08-05 11:20:54,920 INFO L454 AbstractCegarLoop]: Interpolant automaton has 105 states [2019-08-05 11:20:54,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2019-08-05 11:20:54,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5460, Invalid=5460, Unknown=0, NotChecked=0, Total=10920 [2019-08-05 11:20:54,921 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 105 states. [2019-08-05 11:20:55,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:20:55,095 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2019-08-05 11:20:55,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-08-05 11:20:55,096 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 106 [2019-08-05 11:20:55,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:20:55,097 INFO L225 Difference]: With dead ends: 108 [2019-08-05 11:20:55,097 INFO L226 Difference]: Without dead ends: 108 [2019-08-05 11:20:55,097 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5460, Invalid=5460, Unknown=0, NotChecked=0, Total=10920 [2019-08-05 11:20:55,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-08-05 11:20:55,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2019-08-05 11:20:55,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-08-05 11:20:55,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2019-08-05 11:20:55,100 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 106 [2019-08-05 11:20:55,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:20:55,100 INFO L475 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2019-08-05 11:20:55,100 INFO L476 AbstractCegarLoop]: Interpolant automaton has 105 states. [2019-08-05 11:20:55,100 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2019-08-05 11:20:55,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-08-05 11:20:55,101 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:20:55,101 INFO L399 BasicCegarLoop]: trace histogram [103, 1, 1, 1, 1] [2019-08-05 11:20:55,101 INFO L418 AbstractCegarLoop]: === Iteration 105 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:20:55,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:20:55,101 INFO L82 PathProgramCache]: Analyzing trace with hash -268888296, now seen corresponding path program 102 times [2019-08-05 11:20:55,102 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:20:55,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:20:55,125 INFO L256 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 105 conjunts are in the unsatisfiable core [2019-08-05 11:20:55,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:20:59,371 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:20:59,372 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:20:59,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2019-08-05 11:20:59,372 INFO L454 AbstractCegarLoop]: Interpolant automaton has 106 states [2019-08-05 11:20:59,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2019-08-05 11:20:59,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-08-05 11:20:59,373 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand 106 states. [2019-08-05 11:20:59,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:20:59,568 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2019-08-05 11:20:59,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2019-08-05 11:20:59,569 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 107 [2019-08-05 11:20:59,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:20:59,570 INFO L225 Difference]: With dead ends: 109 [2019-08-05 11:20:59,570 INFO L226 Difference]: Without dead ends: 109 [2019-08-05 11:20:59,571 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-08-05 11:20:59,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-08-05 11:20:59,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2019-08-05 11:20:59,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-08-05 11:20:59,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2019-08-05 11:20:59,573 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 107 [2019-08-05 11:20:59,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:20:59,574 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2019-08-05 11:20:59,574 INFO L476 AbstractCegarLoop]: Interpolant automaton has 106 states. [2019-08-05 11:20:59,574 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2019-08-05 11:20:59,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-08-05 11:20:59,574 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:20:59,574 INFO L399 BasicCegarLoop]: trace histogram [104, 1, 1, 1, 1] [2019-08-05 11:20:59,575 INFO L418 AbstractCegarLoop]: === Iteration 106 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:20:59,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:20:59,575 INFO L82 PathProgramCache]: Analyzing trace with hash 254633806, now seen corresponding path program 103 times [2019-08-05 11:20:59,576 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:20:59,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:20:59,598 INFO L256 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 106 conjunts are in the unsatisfiable core [2019-08-05 11:20:59,600 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:03,696 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:03,697 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:03,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106] total 106 [2019-08-05 11:21:03,697 INFO L454 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-08-05 11:21:03,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-08-05 11:21:03,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5671, Invalid=5671, Unknown=0, NotChecked=0, Total=11342 [2019-08-05 11:21:03,698 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 107 states. [2019-08-05 11:21:03,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:03,868 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2019-08-05 11:21:03,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2019-08-05 11:21:03,869 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 108 [2019-08-05 11:21:03,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:03,869 INFO L225 Difference]: With dead ends: 110 [2019-08-05 11:21:03,869 INFO L226 Difference]: Without dead ends: 110 [2019-08-05 11:21:03,870 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5671, Invalid=5671, Unknown=0, NotChecked=0, Total=11342 [2019-08-05 11:21:03,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-08-05 11:21:03,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2019-08-05 11:21:03,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-08-05 11:21:03,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2019-08-05 11:21:03,872 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 108 [2019-08-05 11:21:03,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:03,873 INFO L475 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2019-08-05 11:21:03,873 INFO L476 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-08-05 11:21:03,873 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2019-08-05 11:21:03,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-08-05 11:21:03,874 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:03,874 INFO L399 BasicCegarLoop]: trace histogram [105, 1, 1, 1, 1] [2019-08-05 11:21:03,874 INFO L418 AbstractCegarLoop]: === Iteration 107 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:03,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:03,874 INFO L82 PathProgramCache]: Analyzing trace with hash -696050216, now seen corresponding path program 104 times [2019-08-05 11:21:03,875 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:03,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:03,895 INFO L256 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 107 conjunts are in the unsatisfiable core [2019-08-05 11:21:03,896 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:08,080 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:08,081 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:08,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107] total 107 [2019-08-05 11:21:08,081 INFO L454 AbstractCegarLoop]: Interpolant automaton has 108 states [2019-08-05 11:21:08,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2019-08-05 11:21:08,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-08-05 11:21:08,082 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand 108 states. [2019-08-05 11:21:08,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:08,282 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2019-08-05 11:21:08,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2019-08-05 11:21:08,283 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 109 [2019-08-05 11:21:08,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:08,283 INFO L225 Difference]: With dead ends: 111 [2019-08-05 11:21:08,284 INFO L226 Difference]: Without dead ends: 111 [2019-08-05 11:21:08,284 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:08,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-08-05 11:21:08,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-08-05 11:21:08,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-08-05 11:21:08,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2019-08-05 11:21:08,286 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 109 [2019-08-05 11:21:08,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:08,286 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2019-08-05 11:21:08,286 INFO L476 AbstractCegarLoop]: Interpolant automaton has 108 states. [2019-08-05 11:21:08,287 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2019-08-05 11:21:08,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-08-05 11:21:08,287 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:08,288 INFO L399 BasicCegarLoop]: trace histogram [106, 1, 1, 1, 1] [2019-08-05 11:21:08,288 INFO L418 AbstractCegarLoop]: === Iteration 108 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:08,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:08,288 INFO L82 PathProgramCache]: Analyzing trace with hash -102483826, now seen corresponding path program 105 times [2019-08-05 11:21:08,288 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:08,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:08,308 INFO L256 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 108 conjunts are in the unsatisfiable core [2019-08-05 11:21:08,310 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:12,466 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:12,467 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:12,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108] total 108 [2019-08-05 11:21:12,467 INFO L454 AbstractCegarLoop]: Interpolant automaton has 109 states [2019-08-05 11:21:12,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2019-08-05 11:21:12,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5886, Invalid=5886, Unknown=0, NotChecked=0, Total=11772 [2019-08-05 11:21:12,469 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 109 states. [2019-08-05 11:21:12,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:12,627 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2019-08-05 11:21:12,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2019-08-05 11:21:12,628 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 110 [2019-08-05 11:21:12,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:12,628 INFO L225 Difference]: With dead ends: 112 [2019-08-05 11:21:12,628 INFO L226 Difference]: Without dead ends: 112 [2019-08-05 11:21:12,629 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5886, Invalid=5886, Unknown=0, NotChecked=0, Total=11772 [2019-08-05 11:21:12,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-08-05 11:21:12,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2019-08-05 11:21:12,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-08-05 11:21:12,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2019-08-05 11:21:12,631 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 110 [2019-08-05 11:21:12,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:12,631 INFO L475 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2019-08-05 11:21:12,632 INFO L476 AbstractCegarLoop]: Interpolant automaton has 109 states. [2019-08-05 11:21:12,632 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2019-08-05 11:21:12,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-08-05 11:21:12,632 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:12,632 INFO L399 BasicCegarLoop]: trace histogram [107, 1, 1, 1, 1] [2019-08-05 11:21:12,632 INFO L418 AbstractCegarLoop]: === Iteration 109 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:12,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:12,633 INFO L82 PathProgramCache]: Analyzing trace with hash 1118205080, now seen corresponding path program 106 times [2019-08-05 11:21:12,633 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:12,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:12,665 INFO L256 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 109 conjunts are in the unsatisfiable core [2019-08-05 11:21:12,667 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:16,615 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:16,616 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:16,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109] total 109 [2019-08-05 11:21:16,616 INFO L454 AbstractCegarLoop]: Interpolant automaton has 110 states [2019-08-05 11:21:16,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2019-08-05 11:21:16,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-08-05 11:21:16,617 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 110 states. [2019-08-05 11:21:16,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:16,847 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2019-08-05 11:21:16,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2019-08-05 11:21:16,847 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 111 [2019-08-05 11:21:16,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:16,848 INFO L225 Difference]: With dead ends: 113 [2019-08-05 11:21:16,848 INFO L226 Difference]: Without dead ends: 113 [2019-08-05 11:21:16,849 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-08-05 11:21:16,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-08-05 11:21:16,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2019-08-05 11:21:16,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-08-05 11:21:16,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2019-08-05 11:21:16,851 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 111 [2019-08-05 11:21:16,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:16,851 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2019-08-05 11:21:16,851 INFO L476 AbstractCegarLoop]: Interpolant automaton has 110 states. [2019-08-05 11:21:16,851 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2019-08-05 11:21:16,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-08-05 11:21:16,851 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:16,852 INFO L399 BasicCegarLoop]: trace histogram [108, 1, 1, 1, 1] [2019-08-05 11:21:16,852 INFO L418 AbstractCegarLoop]: === Iteration 110 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:16,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:16,852 INFO L82 PathProgramCache]: Analyzing trace with hash 304855502, now seen corresponding path program 107 times [2019-08-05 11:21:16,852 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,875 INFO L256 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 110 conjunts are in the unsatisfiable core [2019-08-05 11:21:16,876 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:21,170 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:21,170 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:21,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110] total 110 [2019-08-05 11:21:21,170 INFO L454 AbstractCegarLoop]: Interpolant automaton has 111 states [2019-08-05 11:21:21,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2019-08-05 11:21:21,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6105, Invalid=6105, Unknown=0, NotChecked=0, Total=12210 [2019-08-05 11:21:21,172 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 111 states. [2019-08-05 11:21:21,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:21,354 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2019-08-05 11:21:21,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2019-08-05 11:21:21,354 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 112 [2019-08-05 11:21:21,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:21,355 INFO L225 Difference]: With dead ends: 114 [2019-08-05 11:21:21,355 INFO L226 Difference]: Without dead ends: 114 [2019-08-05 11:21:21,356 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=6105, Invalid=6105, Unknown=0, NotChecked=0, Total=12210 [2019-08-05 11:21:21,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-08-05 11:21:21,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2019-08-05 11:21:21,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-08-05 11:21:21,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 114 transitions. [2019-08-05 11:21:21,358 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 114 transitions. Word has length 112 [2019-08-05 11:21:21,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:21,358 INFO L475 AbstractCegarLoop]: Abstraction has 114 states and 114 transitions. [2019-08-05 11:21:21,358 INFO L476 AbstractCegarLoop]: Interpolant automaton has 111 states. [2019-08-05 11:21:21,358 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 114 transitions. [2019-08-05 11:21:21,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-08-05 11:21:21,359 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:21,359 INFO L399 BasicCegarLoop]: trace histogram [109, 1, 1, 1, 1] [2019-08-05 11:21:21,359 INFO L418 AbstractCegarLoop]: === Iteration 111 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:21,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:21,359 INFO L82 PathProgramCache]: Analyzing trace with hash 860822360, now seen corresponding path program 108 times [2019-08-05 11:21:21,360 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:21,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:21,383 INFO L256 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 111 conjunts are in the unsatisfiable core [2019-08-05 11:21:21,384 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:26,121 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:26,122 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:26,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111] total 111 [2019-08-05 11:21:26,122 INFO L454 AbstractCegarLoop]: Interpolant automaton has 112 states [2019-08-05 11:21:26,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2019-08-05 11:21:26,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-08-05 11:21:26,124 INFO L87 Difference]: Start difference. First operand 114 states and 114 transitions. Second operand 112 states. [2019-08-05 11:21:26,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:26,335 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2019-08-05 11:21:26,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2019-08-05 11:21:26,335 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 113 [2019-08-05 11:21:26,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:26,336 INFO L225 Difference]: With dead ends: 115 [2019-08-05 11:21:26,336 INFO L226 Difference]: Without dead ends: 115 [2019-08-05 11:21:26,337 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-08-05 11:21:26,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-08-05 11:21:26,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2019-08-05 11:21:26,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-08-05 11:21:26,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2019-08-05 11:21:26,340 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 113 [2019-08-05 11:21:26,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:26,340 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2019-08-05 11:21:26,340 INFO L476 AbstractCegarLoop]: Interpolant automaton has 112 states. [2019-08-05 11:21:26,340 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2019-08-05 11:21:26,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-08-05 11:21:26,341 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:26,341 INFO L399 BasicCegarLoop]: trace histogram [110, 1, 1, 1, 1] [2019-08-05 11:21:26,341 INFO L418 AbstractCegarLoop]: === Iteration 112 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:26,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:26,341 INFO L82 PathProgramCache]: Analyzing trace with hash 915925774, now seen corresponding path program 109 times [2019-08-05 11:21:26,342 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:26,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:26,373 INFO L256 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 112 conjunts are in the unsatisfiable core [2019-08-05 11:21:26,374 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:30,909 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:21:30,909 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:30,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [112] total 112 [2019-08-05 11:21:30,909 INFO L454 AbstractCegarLoop]: Interpolant automaton has 113 states [2019-08-05 11:21:30,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2019-08-05 11:21:30,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6328, Invalid=6328, Unknown=0, NotChecked=0, Total=12656 [2019-08-05 11:21:30,910 INFO L87 Difference]: Start difference. First operand 115 states and 115 transitions. Second operand 113 states. [2019-08-05 11:21:31,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:31,160 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2019-08-05 11:21:31,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2019-08-05 11:21:31,160 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 114 [2019-08-05 11:21:31,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:31,161 INFO L225 Difference]: With dead ends: 116 [2019-08-05 11:21:31,161 INFO L226 Difference]: Without dead ends: 116 [2019-08-05 11:21:31,161 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=6328, Invalid=6328, Unknown=0, NotChecked=0, Total=12656 [2019-08-05 11:21:31,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-08-05 11:21:31,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2019-08-05 11:21:31,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-08-05 11:21:31,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 116 transitions. [2019-08-05 11:21:31,163 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 116 transitions. Word has length 114 [2019-08-05 11:21:31,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:31,163 INFO L475 AbstractCegarLoop]: Abstraction has 116 states and 116 transitions. [2019-08-05 11:21:31,163 INFO L476 AbstractCegarLoop]: Interpolant automaton has 113 states. [2019-08-05 11:21:31,163 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2019-08-05 11:21:31,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-08-05 11:21:31,163 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:31,164 INFO L399 BasicCegarLoop]: trace histogram [111, 1, 1, 1, 1] [2019-08-05 11:21:31,164 INFO L418 AbstractCegarLoop]: === Iteration 113 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:31,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:31,164 INFO L82 PathProgramCache]: Analyzing trace with hash -1670835688, now seen corresponding path program 110 times [2019-08-05 11:21:31,165 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:31,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:31,197 INFO L256 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 113 conjunts are in the unsatisfiable core [2019-08-05 11:21:31,198 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:33,612 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 3 [2019-08-05 11:21:35,865 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:21:35,866 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:35,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113] total 113 [2019-08-05 11:21:35,866 INFO L454 AbstractCegarLoop]: Interpolant automaton has 114 states [2019-08-05 11:21:35,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2019-08-05 11:21:35,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-08-05 11:21:35,868 INFO L87 Difference]: Start difference. First operand 116 states and 116 transitions. Second operand 114 states. [2019-08-05 11:21:36,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:36,090 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2019-08-05 11:21:36,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2019-08-05 11:21:36,091 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 115 [2019-08-05 11:21:36,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:36,091 INFO L225 Difference]: With dead ends: 117 [2019-08-05 11:21:36,091 INFO L226 Difference]: Without dead ends: 117 [2019-08-05 11:21:36,092 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-08-05 11:21:36,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-08-05 11:21:36,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2019-08-05 11:21:36,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-08-05 11:21:36,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2019-08-05 11:21:36,094 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 115 [2019-08-05 11:21:36,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:36,094 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2019-08-05 11:21:36,095 INFO L476 AbstractCegarLoop]: Interpolant automaton has 114 states. [2019-08-05 11:21:36,095 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2019-08-05 11:21:36,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-08-05 11:21:36,095 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:36,095 INFO L399 BasicCegarLoop]: trace histogram [112, 1, 1, 1, 1] [2019-08-05 11:21:36,095 INFO L418 AbstractCegarLoop]: === Iteration 114 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:36,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:36,096 INFO L82 PathProgramCache]: Analyzing trace with hash -256062386, now seen corresponding path program 111 times [2019-08-05 11:21:36,096 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:36,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:36,119 INFO L256 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 114 conjunts are in the unsatisfiable core [2019-08-05 11:21:36,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:40,894 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:21:40,895 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:40,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [114] total 114 [2019-08-05 11:21:40,895 INFO L454 AbstractCegarLoop]: Interpolant automaton has 115 states [2019-08-05 11:21:40,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2019-08-05 11:21:40,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6555, Invalid=6555, Unknown=0, NotChecked=0, Total=13110 [2019-08-05 11:21:40,896 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 115 states. [2019-08-05 11:21:41,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:41,107 INFO L93 Difference]: Finished difference Result 118 states and 118 transitions. [2019-08-05 11:21:41,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2019-08-05 11:21:41,107 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 116 [2019-08-05 11:21:41,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:41,108 INFO L225 Difference]: With dead ends: 118 [2019-08-05 11:21:41,108 INFO L226 Difference]: Without dead ends: 118 [2019-08-05 11:21:41,109 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=6555, Invalid=6555, Unknown=0, NotChecked=0, Total=13110 [2019-08-05 11:21:41,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-08-05 11:21:41,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2019-08-05 11:21:41,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-08-05 11:21:41,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 118 transitions. [2019-08-05 11:21:41,112 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 118 transitions. Word has length 116 [2019-08-05 11:21:41,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:41,112 INFO L475 AbstractCegarLoop]: Abstraction has 118 states and 118 transitions. [2019-08-05 11:21:41,112 INFO L476 AbstractCegarLoop]: Interpolant automaton has 115 states. [2019-08-05 11:21:41,112 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 118 transitions. [2019-08-05 11:21:41,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-08-05 11:21:41,113 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:41,113 INFO L399 BasicCegarLoop]: trace histogram [113, 1, 1, 1, 1] [2019-08-05 11:21:41,113 INFO L418 AbstractCegarLoop]: === Iteration 115 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:41,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:41,113 INFO L82 PathProgramCache]: Analyzing trace with hash 652237016, now seen corresponding path program 112 times [2019-08-05 11:21:41,114 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:41,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:41,136 INFO L256 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 115 conjunts are in the unsatisfiable core [2019-08-05 11:21:41,137 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:46,076 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:21:46,076 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:46,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115] total 115 [2019-08-05 11:21:46,076 INFO L454 AbstractCegarLoop]: Interpolant automaton has 116 states [2019-08-05 11:21:46,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2019-08-05 11:21:46,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2019-08-05 11:21:46,077 INFO L87 Difference]: Start difference. First operand 118 states and 118 transitions. Second operand 116 states. [2019-08-05 11:21:46,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:46,365 INFO L93 Difference]: Finished difference Result 119 states and 119 transitions. [2019-08-05 11:21:46,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2019-08-05 11:21:46,366 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 117 [2019-08-05 11:21:46,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:46,366 INFO L225 Difference]: With dead ends: 119 [2019-08-05 11:21:46,366 INFO L226 Difference]: Without dead ends: 119 [2019-08-05 11:21:46,367 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2019-08-05 11:21:46,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-08-05 11:21:46,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2019-08-05 11:21:46,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-08-05 11:21:46,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 119 transitions. [2019-08-05 11:21:46,369 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 119 transitions. Word has length 117 [2019-08-05 11:21:46,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:46,369 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 119 transitions. [2019-08-05 11:21:46,370 INFO L476 AbstractCegarLoop]: Interpolant automaton has 116 states. [2019-08-05 11:21:46,370 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 119 transitions. [2019-08-05 11:21:46,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-08-05 11:21:46,370 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:46,370 INFO L399 BasicCegarLoop]: trace histogram [114, 1, 1, 1, 1] [2019-08-05 11:21:46,371 INFO L418 AbstractCegarLoop]: === Iteration 116 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:46,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:46,371 INFO L82 PathProgramCache]: Analyzing trace with hash -1255252594, now seen corresponding path program 113 times [2019-08-05 11:21:46,371 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:46,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:46,395 INFO L256 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 116 conjunts are in the unsatisfiable core [2019-08-05 11:21:46,397 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:51,274 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:21:51,275 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:51,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [116] total 116 [2019-08-05 11:21:51,275 INFO L454 AbstractCegarLoop]: Interpolant automaton has 117 states [2019-08-05 11:21:51,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2019-08-05 11:21:51,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6786, Invalid=6786, Unknown=0, NotChecked=0, Total=13572 [2019-08-05 11:21:51,276 INFO L87 Difference]: Start difference. First operand 119 states and 119 transitions. Second operand 117 states. [2019-08-05 11:21:51,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:51,502 INFO L93 Difference]: Finished difference Result 120 states and 120 transitions. [2019-08-05 11:21:51,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2019-08-05 11:21:51,503 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 118 [2019-08-05 11:21:51,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:51,503 INFO L225 Difference]: With dead ends: 120 [2019-08-05 11:21:51,503 INFO L226 Difference]: Without dead ends: 120 [2019-08-05 11:21:51,504 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=6786, Invalid=6786, Unknown=0, NotChecked=0, Total=13572 [2019-08-05 11:21:51,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-08-05 11:21:51,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2019-08-05 11:21:51,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-08-05 11:21:51,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 120 transitions. [2019-08-05 11:21:51,506 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 120 transitions. Word has length 118 [2019-08-05 11:21:51,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:51,506 INFO L475 AbstractCegarLoop]: Abstraction has 120 states and 120 transitions. [2019-08-05 11:21:51,506 INFO L476 AbstractCegarLoop]: Interpolant automaton has 117 states. [2019-08-05 11:21:51,506 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 120 transitions. [2019-08-05 11:21:51,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-08-05 11:21:51,507 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:51,507 INFO L399 BasicCegarLoop]: trace histogram [115, 1, 1, 1, 1] [2019-08-05 11:21:51,507 INFO L418 AbstractCegarLoop]: === Iteration 117 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:51,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:51,507 INFO L82 PathProgramCache]: Analyzing trace with hash -257888360, now seen corresponding path program 114 times [2019-08-05 11:21:51,508 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:51,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:51,533 INFO L256 TraceCheckSpWp]: Trace formula consists of 470 conjuncts, 117 conjunts are in the unsatisfiable core [2019-08-05 11:21:51,534 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:56,357 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:21:56,357 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:56,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [117] total 117 [2019-08-05 11:21:56,358 INFO L454 AbstractCegarLoop]: Interpolant automaton has 118 states [2019-08-05 11:21:56,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2019-08-05 11:21:56,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2019-08-05 11:21:56,359 INFO L87 Difference]: Start difference. First operand 120 states and 120 transitions. Second operand 118 states. [2019-08-05 11:21:56,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:56,558 INFO L93 Difference]: Finished difference Result 121 states and 121 transitions. [2019-08-05 11:21:56,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2019-08-05 11:21:56,559 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 119 [2019-08-05 11:21:56,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:56,559 INFO L225 Difference]: With dead ends: 121 [2019-08-05 11:21:56,559 INFO L226 Difference]: Without dead ends: 121 [2019-08-05 11:21:56,560 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2019-08-05 11:21:56,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-08-05 11:21:56,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2019-08-05 11:21:56,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-08-05 11:21:56,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2019-08-05 11:21:56,562 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 119 [2019-08-05 11:21:56,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:56,562 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2019-08-05 11:21:56,562 INFO L476 AbstractCegarLoop]: Interpolant automaton has 118 states. [2019-08-05 11:21:56,562 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2019-08-05 11:21:56,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-08-05 11:21:56,563 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:56,563 INFO L399 BasicCegarLoop]: trace histogram [116, 1, 1, 1, 1] [2019-08-05 11:21:56,563 INFO L418 AbstractCegarLoop]: === Iteration 118 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:56,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:56,563 INFO L82 PathProgramCache]: Analyzing trace with hash 595631822, now seen corresponding path program 115 times [2019-08-05 11:21:56,565 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:56,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:56,587 INFO L256 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 118 conjunts are in the unsatisfiable core [2019-08-05 11:21:56,588 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:22:01,397 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:01,397 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:22:01,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [118] total 118 [2019-08-05 11:22:01,398 INFO L454 AbstractCegarLoop]: Interpolant automaton has 119 states [2019-08-05 11:22:01,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2019-08-05 11:22:01,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7021, Invalid=7021, Unknown=0, NotChecked=0, Total=14042 [2019-08-05 11:22:01,399 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 119 states. [2019-08-05 11:22:01,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:22:01,604 INFO L93 Difference]: Finished difference Result 122 states and 122 transitions. [2019-08-05 11:22:01,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2019-08-05 11:22:01,605 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 120 [2019-08-05 11:22:01,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:22:01,606 INFO L225 Difference]: With dead ends: 122 [2019-08-05 11:22:01,606 INFO L226 Difference]: Without dead ends: 122 [2019-08-05 11:22:01,606 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:01,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-08-05 11:22:01,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2019-08-05 11:22:01,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-08-05 11:22:01,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 122 transitions. [2019-08-05 11:22:01,608 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 122 transitions. Word has length 120 [2019-08-05 11:22:01,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:22:01,609 INFO L475 AbstractCegarLoop]: Abstraction has 122 states and 122 transitions. [2019-08-05 11:22:01,609 INFO L476 AbstractCegarLoop]: Interpolant automaton has 119 states. [2019-08-05 11:22:01,609 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 122 transitions. [2019-08-05 11:22:01,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-08-05 11:22:01,609 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:22:01,609 INFO L399 BasicCegarLoop]: trace histogram [117, 1, 1, 1, 1] [2019-08-05 11:22:01,610 INFO L418 AbstractCegarLoop]: === Iteration 119 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:22:01,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:22:01,610 INFO L82 PathProgramCache]: Analyzing trace with hash 1284953688, now seen corresponding path program 116 times [2019-08-05 11:22:01,610 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:22:01,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:22:01,633 INFO L256 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 119 conjunts are in the unsatisfiable core [2019-08-05 11:22:01,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... Received shutdown request... [2019-08-05 11:22:02,653 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2019-08-05 11:22:02,653 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-05 11:22:02,657 WARN L223 ceAbstractionStarter]: Timeout [2019-08-05 11:22:02,657 INFO L202 PluginConnector]: Adding new model oneLoopTwoBackbones.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 11:22:02 BoogieIcfgContainer [2019-08-05 11:22:02,657 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 11:22:02,659 INFO L168 Benchmark]: Toolchain (without parser) took 238146.99 ms. Allocated memory was 140.5 MB in the beginning and 633.9 MB in the end (delta: 493.4 MB). Free memory was 110.2 MB in the beginning and 571.6 MB in the end (delta: -461.5 MB). Peak memory consumption was 31.9 MB. Max. memory is 7.1 GB. [2019-08-05 11:22:02,660 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.26 ms. Allocated memory is still 140.5 MB. Free memory was 111.4 MB in the beginning and 111.2 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-08-05 11:22:02,660 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.25 ms. Allocated memory is still 140.5 MB. Free memory was 110.2 MB in the beginning and 108.3 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. [2019-08-05 11:22:02,661 INFO L168 Benchmark]: Boogie Preprocessor took 22.34 ms. Allocated memory is still 140.5 MB. Free memory was 108.3 MB in the beginning and 107.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-08-05 11:22:02,661 INFO L168 Benchmark]: RCFGBuilder took 394.06 ms. Allocated memory is still 140.5 MB. Free memory was 107.1 MB in the beginning and 96.8 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. [2019-08-05 11:22:02,662 INFO L168 Benchmark]: TraceAbstraction took 237692.38 ms. Allocated memory was 140.5 MB in the beginning and 633.9 MB in the end (delta: 493.4 MB). Free memory was 96.6 MB in the beginning and 571.6 MB in the end (delta: -475.0 MB). Peak memory consumption was 18.3 MB. Max. memory is 7.1 GB. [2019-08-05 11:22:02,667 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.26 ms. Allocated memory is still 140.5 MB. Free memory was 111.4 MB in the beginning and 111.2 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 33.25 ms. Allocated memory is still 140.5 MB. Free memory was 110.2 MB in the beginning and 108.3 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 22.34 ms. Allocated memory is still 140.5 MB. Free memory was 108.3 MB in the beginning and 107.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 394.06 ms. Allocated memory is still 140.5 MB. Free memory was 107.1 MB in the beginning and 96.8 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 237692.38 ms. Allocated memory was 140.5 MB in the beginning and 633.9 MB in the end (delta: 493.4 MB). Free memory was 96.6 MB in the beginning and 571.6 MB in the end (delta: -475.0 MB). Peak memory consumption was 18.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 21]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 21). 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 55 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 55 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 2 error locations. TIMEOUT Result, 237.6s OverallTime, 119 OverallIterations, 117 TraceHistogramMax, 15.5s 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, 215.6s 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.7s SatisfiabilityAnalysisTime, 218.1s InterpolantComputationTime, 7257 NumberOfCodeBlocks, 7257 NumberOfCodeBlocksAsserted, 118 NumberOfCheckSat, 7139 ConstructedInterpolants, 0 QuantifiedInterpolants, 1677927 SizeOfPredicates, 117 NumberOfNonLiveVariables, 28326 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