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/20181015-LoopsPathprograms/simple_false-unreach-call1.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:26:30,497 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:26:30,499 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:26:30,511 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:26:30,511 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:26:30,512 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:26:30,514 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:26:30,516 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:26:30,517 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:26:30,518 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:26:30,519 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:26:30,520 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:26:30,520 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:26:30,521 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:26:30,522 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:26:30,523 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:26:30,524 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:26:30,525 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:26:30,526 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:26:30,529 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:26:30,530 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:26:30,531 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:26:30,533 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:26:30,533 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:26:30,536 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:26:30,536 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:26:30,536 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:26:30,537 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:26:30,538 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:26:30,539 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:26:30,539 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:26:30,540 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:26:30,540 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:26:30,541 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:26:30,542 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:26:30,542 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:26:30,543 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:26:30,543 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:26:30,544 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:26:30,544 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:26:30,545 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:26:30,572 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:26:30,583 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:26:30,587 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:26:30,588 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:26:30,589 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:26:30,590 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181015-LoopsPathprograms/simple_false-unreach-call1.i_3.bpl [2019-08-05 10:26:30,590 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181015-LoopsPathprograms/simple_false-unreach-call1.i_3.bpl' [2019-08-05 10:26:30,626 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:26:30,628 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:26:30,629 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:26:30,629 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:26:30,629 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:26:30,645 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "simple_false-unreach-call1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:26:30" (1/1) ... [2019-08-05 10:26:30,654 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "simple_false-unreach-call1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:26:30" (1/1) ... [2019-08-05 10:26:30,662 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:26:30,662 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:26:30,663 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:26:30,663 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:26:30,673 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "simple_false-unreach-call1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:26:30" (1/1) ... [2019-08-05 10:26:30,674 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "simple_false-unreach-call1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:26:30" (1/1) ... [2019-08-05 10:26:30,676 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "simple_false-unreach-call1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:26:30" (1/1) ... [2019-08-05 10:26:30,676 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "simple_false-unreach-call1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:26:30" (1/1) ... [2019-08-05 10:26:30,689 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "simple_false-unreach-call1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:26:30" (1/1) ... [2019-08-05 10:26:30,692 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "simple_false-unreach-call1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:26:30" (1/1) ... [2019-08-05 10:26:30,693 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "simple_false-unreach-call1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:26:30" (1/1) ... [2019-08-05 10:26:30,695 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:26:30,701 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:26:30,702 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:26:30,702 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:26:30,703 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "simple_false-unreach-call1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:26:30" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-08-05 10:26:30,779 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2019-08-05 10:26:30,779 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-05 10:26:30,780 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-05 10:26:31,029 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-05 10:26:31,030 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 10:26:31,031 INFO L202 PluginConnector]: Adding new model simple_false-unreach-call1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:26:31 BoogieIcfgContainer [2019-08-05 10:26:31,031 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:26:31,036 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:26:31,036 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:26:31,040 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:26:31,040 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "simple_false-unreach-call1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:26:30" (1/2) ... [2019-08-05 10:26:31,041 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bbd4b67 and model type simple_false-unreach-call1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:26:31, skipping insertion in model container [2019-08-05 10:26:31,042 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "simple_false-unreach-call1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:26:31" (2/2) ... [2019-08-05 10:26:31,043 INFO L109 eAbstractionObserver]: Analyzing ICFG simple_false-unreach-call1.i_3.bpl [2019-08-05 10:26:31,053 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:26:31,059 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 10:26:31,074 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 10:26:31,098 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:26:31,098 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:26:31,099 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:26:31,099 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:26:31,099 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:26:31,099 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:26:31,099 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:26:31,099 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:26:31,100 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:26:31,113 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2019-08-05 10:26:31,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 10:26:31,121 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:31,122 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 10:26:31,125 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:31,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:31,131 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2019-08-05 10:26:31,181 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:31,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:31,232 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 10:26:31,236 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:31,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:26:31,283 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:26:31,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:26:31,287 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:26:31,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:26:31,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:26:31,304 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2019-08-05 10:26:31,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:31,336 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-08-05 10:26:31,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:26:31,339 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-05 10:26:31,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:31,349 INFO L225 Difference]: With dead ends: 5 [2019-08-05 10:26:31,350 INFO L226 Difference]: Without dead ends: 5 [2019-08-05 10:26:31,352 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:26:31,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-08-05 10:26:31,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-08-05 10:26:31,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-08-05 10:26:31,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-08-05 10:26:31,381 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-08-05 10:26:31,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:31,382 INFO L475 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-08-05 10:26:31,382 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:26:31,382 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-08-05 10:26:31,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 10:26:31,383 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:31,383 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 10:26:31,384 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:31,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:31,384 INFO L82 PathProgramCache]: Analyzing trace with hash 930412, now seen corresponding path program 1 times [2019-08-05 10:26:31,385 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:31,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:31,411 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:26:31,414 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:31,548 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:26:31,549 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:31,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 10:26:31,551 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:26:31,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:26:31,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:26:31,553 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2019-08-05 10:26:31,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:31,627 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-08-05 10:26:31,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:26:31,628 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-08-05 10:26:31,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:31,629 INFO L225 Difference]: With dead ends: 6 [2019-08-05 10:26:31,629 INFO L226 Difference]: Without dead ends: 6 [2019-08-05 10:26:31,630 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:26:31,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-08-05 10:26:31,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-08-05 10:26:31,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-05 10:26:31,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-08-05 10:26:31,632 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-08-05 10:26:31,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:31,632 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-08-05 10:26:31,632 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:26:31,633 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-08-05 10:26:31,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 10:26:31,633 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:31,633 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-08-05 10:26:31,633 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:31,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:31,634 INFO L82 PathProgramCache]: Analyzing trace with hash 28844579, now seen corresponding path program 2 times [2019-08-05 10:26:31,635 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:31,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:31,655 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:26:31,656 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:31,733 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:26:31,734 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:31,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:26:31,735 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:26:31,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:26:31,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:26:31,736 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2019-08-05 10:26:31,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:31,813 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-08-05 10:26:31,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:26:31,815 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-08-05 10:26:31,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:31,816 INFO L225 Difference]: With dead ends: 7 [2019-08-05 10:26:31,816 INFO L226 Difference]: Without dead ends: 7 [2019-08-05 10:26:31,817 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:26:31,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-05 10:26:31,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-05 10:26:31,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 10:26:31,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-08-05 10:26:31,819 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-08-05 10:26:31,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:31,820 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-08-05 10:26:31,820 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:26:31,820 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-08-05 10:26:31,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:26:31,820 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:31,820 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-08-05 10:26:31,821 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:31,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:31,821 INFO L82 PathProgramCache]: Analyzing trace with hash 894183756, now seen corresponding path program 3 times [2019-08-05 10:26:31,822 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:31,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:31,843 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 10:26:31,845 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:31,952 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:26:31,953 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:31,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:26:31,953 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:26:31,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:26:31,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:26:31,954 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2019-08-05 10:26:32,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:32,040 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-05 10:26:32,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:26:32,041 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-08-05 10:26:32,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:32,041 INFO L225 Difference]: With dead ends: 8 [2019-08-05 10:26:32,042 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 10:26:32,042 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:26:32,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 10:26:32,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-05 10:26:32,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 10:26:32,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-08-05 10:26:32,044 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-08-05 10:26:32,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:32,044 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-08-05 10:26:32,045 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:26:32,045 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-08-05 10:26:32,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 10:26:32,045 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:32,045 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-08-05 10:26:32,046 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:32,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:32,046 INFO L82 PathProgramCache]: Analyzing trace with hash 1949894467, now seen corresponding path program 4 times [2019-08-05 10:26:32,047 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:32,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:32,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 10:26:32,070 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:32,230 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:26:32,231 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:32,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:26:32,231 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:26:32,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:26:32,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:26:32,232 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2019-08-05 10:26:32,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:32,400 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-08-05 10:26:32,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:26:32,401 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-08-05 10:26:32,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:32,401 INFO L225 Difference]: With dead ends: 9 [2019-08-05 10:26:32,402 INFO L226 Difference]: Without dead ends: 9 [2019-08-05 10:26:32,402 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:26:32,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-05 10:26:32,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-08-05 10:26:32,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 10:26:32,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-08-05 10:26:32,404 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-08-05 10:26:32,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:32,405 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-08-05 10:26:32,405 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:26:32,405 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-08-05 10:26:32,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:26:32,406 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:32,406 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2019-08-05 10:26:32,406 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:32,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:32,407 INFO L82 PathProgramCache]: Analyzing trace with hash 317188140, now seen corresponding path program 5 times [2019-08-05 10:26:32,407 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:32,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:32,429 WARN L254 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 10:26:32,430 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:32,565 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:26:32,566 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:32,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:26:32,566 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:26:32,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:26:32,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:26:32,567 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2019-08-05 10:26:32,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:32,663 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-08-05 10:26:32,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:26:32,664 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-08-05 10:26:32,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:32,665 INFO L225 Difference]: With dead ends: 10 [2019-08-05 10:26:32,665 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 10:26:32,666 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:26:32,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 10:26:32,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-08-05 10:26:32,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 10:26:32,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-08-05 10:26:32,669 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2019-08-05 10:26:32,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:32,669 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-08-05 10:26:32,670 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:26:32,670 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-08-05 10:26:32,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 10:26:32,670 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:32,670 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2019-08-05 10:26:32,671 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:32,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:32,671 INFO L82 PathProgramCache]: Analyzing trace with hash 1242899555, now seen corresponding path program 6 times [2019-08-05 10:26:32,672 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:32,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:32,699 WARN L254 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 10:26:32,704 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:32,865 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:26:32,866 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:32,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:26:32,866 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:26:32,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:26:32,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:26:32,867 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2019-08-05 10:26:32,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:32,940 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-08-05 10:26:32,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:26:32,942 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-08-05 10:26:32,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:32,943 INFO L225 Difference]: With dead ends: 11 [2019-08-05 10:26:32,943 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 10:26:32,944 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:26:32,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 10:26:32,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-05 10:26:32,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 10:26:32,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-08-05 10:26:32,946 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2019-08-05 10:26:32,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:32,947 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-08-05 10:26:32,947 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:26:32,947 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-08-05 10:26:32,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 10:26:32,947 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:32,947 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2019-08-05 10:26:32,948 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:32,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:32,948 INFO L82 PathProgramCache]: Analyzing trace with hash -124817652, now seen corresponding path program 7 times [2019-08-05 10:26:32,949 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:32,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:32,968 WARN L254 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 10:26:32,969 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:33,323 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:26:33,323 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:33,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:26:33,324 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:26:33,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:26:33,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:26:33,324 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2019-08-05 10:26:33,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:33,427 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-08-05 10:26:33,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:26:33,428 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2019-08-05 10:26:33,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:33,429 INFO L225 Difference]: With dead ends: 12 [2019-08-05 10:26:33,430 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 10:26:33,430 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:26:33,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 10:26:33,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-08-05 10:26:33,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 10:26:33,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-08-05 10:26:33,432 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-08-05 10:26:33,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:33,433 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-08-05 10:26:33,433 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:26:33,433 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-08-05 10:26:33,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 10:26:33,433 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:33,434 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2019-08-05 10:26:33,434 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:33,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:33,434 INFO L82 PathProgramCache]: Analyzing trace with hash 425621891, now seen corresponding path program 8 times [2019-08-05 10:26:33,435 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:33,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:33,476 WARN L254 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 10:26:33,480 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:33,742 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:26:33,743 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:33,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:26:33,743 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:26:33,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:26:33,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:26:33,746 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2019-08-05 10:26:33,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:33,914 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-08-05 10:26:33,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:26:33,915 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2019-08-05 10:26:33,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:33,916 INFO L225 Difference]: With dead ends: 13 [2019-08-05 10:26:33,916 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 10:26:33,917 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:26:33,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 10:26:33,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-08-05 10:26:33,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 10:26:33,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-08-05 10:26:33,920 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2019-08-05 10:26:33,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:33,920 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-08-05 10:26:33,921 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:26:33,921 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-08-05 10:26:33,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:26:33,921 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:33,922 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2019-08-05 10:26:33,922 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:33,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:33,922 INFO L82 PathProgramCache]: Analyzing trace with hash 309378540, now seen corresponding path program 9 times [2019-08-05 10:26:33,923 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:33,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:33,943 WARN L254 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 10:26:33,945 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:34,414 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:26:34,414 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:34,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:26:34,415 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:26:34,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:26:34,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:26:34,415 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2019-08-05 10:26:34,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:34,633 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-08-05 10:26:34,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:26:34,634 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2019-08-05 10:26:34,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:34,635 INFO L225 Difference]: With dead ends: 14 [2019-08-05 10:26:34,635 INFO L226 Difference]: Without dead ends: 14 [2019-08-05 10:26:34,636 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:26:34,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-05 10:26:34,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-08-05 10:26:34,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-05 10:26:34,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-08-05 10:26:34,639 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2019-08-05 10:26:34,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:34,639 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-08-05 10:26:34,639 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:26:34,639 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-08-05 10:26:34,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 10:26:34,640 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:34,640 INFO L399 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2019-08-05 10:26:34,640 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:34,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:34,640 INFO L82 PathProgramCache]: Analyzing trace with hash 1000801955, now seen corresponding path program 10 times [2019-08-05 10:26:34,641 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:34,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:34,659 WARN L254 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 24 conjunts are in the unsatisfiable core [2019-08-05 10:26:34,660 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:34,831 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:26:34,831 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:34,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:26:34,832 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:26:34,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:26:34,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:26:34,833 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 13 states. [2019-08-05 10:26:35,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:35,009 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-08-05 10:26:35,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:26:35,009 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2019-08-05 10:26:35,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:35,010 INFO L225 Difference]: With dead ends: 15 [2019-08-05 10:26:35,011 INFO L226 Difference]: Without dead ends: 15 [2019-08-05 10:26:35,011 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:26:35,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-05 10:26:35,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-08-05 10:26:35,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 10:26:35,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-08-05 10:26:35,015 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2019-08-05 10:26:35,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:35,015 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-08-05 10:26:35,015 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:26:35,015 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-08-05 10:26:35,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 10:26:35,016 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:35,016 INFO L399 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2019-08-05 10:26:35,016 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:35,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:35,016 INFO L82 PathProgramCache]: Analyzing trace with hash 960091340, now seen corresponding path program 11 times [2019-08-05 10:26:35,017 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:35,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:35,034 WARN L254 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 26 conjunts are in the unsatisfiable core [2019-08-05 10:26:35,035 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:35,284 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:26:35,285 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:35,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:26:35,285 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:26:35,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:26:35,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:26:35,286 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 14 states. [2019-08-05 10:26:35,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:35,428 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-08-05 10:26:35,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:26:35,429 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2019-08-05 10:26:35,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:35,430 INFO L225 Difference]: With dead ends: 16 [2019-08-05 10:26:35,430 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 10:26:35,431 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:26:35,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 10:26:35,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-08-05 10:26:35,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 10:26:35,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-08-05 10:26:35,435 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2019-08-05 10:26:35,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:35,435 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-08-05 10:26:35,435 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:26:35,436 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-08-05 10:26:35,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:26:35,436 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:35,436 INFO L399 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2019-08-05 10:26:35,437 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:35,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:35,437 INFO L82 PathProgramCache]: Analyzing trace with hash -301937725, now seen corresponding path program 12 times [2019-08-05 10:26:35,438 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:35,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:35,457 WARN L254 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 28 conjunts are in the unsatisfiable core [2019-08-05 10:26:35,458 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:35,794 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:26:35,794 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:35,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:26:35,795 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 10:26:35,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 10:26:35,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:26:35,796 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 15 states. [2019-08-05 10:26:36,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:36,008 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-08-05 10:26:36,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:26:36,016 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2019-08-05 10:26:36,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:36,017 INFO L225 Difference]: With dead ends: 17 [2019-08-05 10:26:36,017 INFO L226 Difference]: Without dead ends: 17 [2019-08-05 10:26:36,018 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:26:36,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-05 10:26:36,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-08-05 10:26:36,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 10:26:36,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-08-05 10:26:36,021 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2019-08-05 10:26:36,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:36,021 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-08-05 10:26:36,021 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 10:26:36,021 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-08-05 10:26:36,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:26:36,022 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:36,022 INFO L399 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2019-08-05 10:26:36,022 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:36,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:36,023 INFO L82 PathProgramCache]: Analyzing trace with hash -770133076, now seen corresponding path program 13 times [2019-08-05 10:26:36,024 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:36,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:36,042 WARN L254 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 30 conjunts are in the unsatisfiable core [2019-08-05 10:26:36,043 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:36,268 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:26:36,268 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:36,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 10:26:36,269 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:26:36,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:26:36,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:26:36,269 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 16 states. [2019-08-05 10:26:36,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:36,527 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-08-05 10:26:36,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:26:36,527 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2019-08-05 10:26:36,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:36,528 INFO L225 Difference]: With dead ends: 18 [2019-08-05 10:26:36,528 INFO L226 Difference]: Without dead ends: 18 [2019-08-05 10:26:36,529 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:26:36,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-05 10:26:36,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-08-05 10:26:36,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-05 10:26:36,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-08-05 10:26:36,532 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2019-08-05 10:26:36,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:36,532 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-08-05 10:26:36,532 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:26:36,532 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-08-05 10:26:36,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 10:26:36,533 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:36,533 INFO L399 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2019-08-05 10:26:36,533 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:36,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:36,534 INFO L82 PathProgramCache]: Analyzing trace with hash 1895680227, now seen corresponding path program 14 times [2019-08-05 10:26:36,534 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:36,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:36,551 WARN L254 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 32 conjunts are in the unsatisfiable core [2019-08-05 10:26:36,552 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:36,696 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:26:36,697 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:36,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:26:36,698 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 10:26:36,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 10:26:36,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:26:36,699 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 17 states. [2019-08-05 10:26:36,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:36,959 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-08-05 10:26:36,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:26:36,959 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2019-08-05 10:26:36,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:36,960 INFO L225 Difference]: With dead ends: 19 [2019-08-05 10:26:36,960 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 10:26:36,961 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:26:36,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 10:26:36,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-08-05 10:26:36,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 10:26:36,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-08-05 10:26:36,964 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2019-08-05 10:26:36,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:36,965 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-08-05 10:26:36,965 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 10:26:36,965 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-08-05 10:26:36,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:26:36,966 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:36,966 INFO L399 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2019-08-05 10:26:36,966 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:36,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:36,966 INFO L82 PathProgramCache]: Analyzing trace with hash -1363453300, now seen corresponding path program 15 times [2019-08-05 10:26:36,967 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:36,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:36,983 WARN L254 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 34 conjunts are in the unsatisfiable core [2019-08-05 10:26:36,984 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:37,706 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:26:37,707 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:37,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:26:37,707 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:26:37,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:26:37,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:26:37,708 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 18 states. [2019-08-05 10:26:37,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:37,969 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-08-05 10:26:37,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 10:26:37,970 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2019-08-05 10:26:37,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:37,971 INFO L225 Difference]: With dead ends: 20 [2019-08-05 10:26:37,971 INFO L226 Difference]: Without dead ends: 20 [2019-08-05 10:26:37,972 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:26:37,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-05 10:26:37,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-08-05 10:26:37,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 10:26:37,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-08-05 10:26:37,975 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2019-08-05 10:26:37,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:37,975 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-08-05 10:26:37,975 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:26:37,977 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-08-05 10:26:37,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:26:37,977 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:37,977 INFO L399 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2019-08-05 10:26:37,978 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:37,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:37,978 INFO L82 PathProgramCache]: Analyzing trace with hash 682622467, now seen corresponding path program 16 times [2019-08-05 10:26:37,979 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:37,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:37,995 WARN L254 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 36 conjunts are in the unsatisfiable core [2019-08-05 10:26:37,996 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:38,457 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:26:38,457 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:38,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:26:38,458 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:26:38,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:26:38,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:26:38,459 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 19 states. [2019-08-05 10:26:38,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:38,714 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-08-05 10:26:38,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:26:38,715 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-08-05 10:26:38,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:38,715 INFO L225 Difference]: With dead ends: 21 [2019-08-05 10:26:38,716 INFO L226 Difference]: Without dead ends: 21 [2019-08-05 10:26:38,716 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:26:38,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-05 10:26:38,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-08-05 10:26:38,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-05 10:26:38,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-08-05 10:26:38,719 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2019-08-05 10:26:38,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:38,719 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-08-05 10:26:38,719 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:26:38,719 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-08-05 10:26:38,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:26:38,720 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:38,720 INFO L399 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2019-08-05 10:26:38,720 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:38,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:38,721 INFO L82 PathProgramCache]: Analyzing trace with hash -313538196, now seen corresponding path program 17 times [2019-08-05 10:26:38,722 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:38,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:38,736 WARN L254 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 38 conjunts are in the unsatisfiable core [2019-08-05 10:26:38,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:39,389 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:26:39,390 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:39,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:26:39,390 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:26:39,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:26:39,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:26:39,391 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 20 states. [2019-08-05 10:26:39,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:39,749 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-08-05 10:26:39,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 10:26:39,750 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2019-08-05 10:26:39,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:39,751 INFO L225 Difference]: With dead ends: 22 [2019-08-05 10:26:39,751 INFO L226 Difference]: Without dead ends: 22 [2019-08-05 10:26:39,752 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:26:39,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-05 10:26:39,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-08-05 10:26:39,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-05 10:26:39,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-08-05 10:26:39,755 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2019-08-05 10:26:39,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:39,755 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-08-05 10:26:39,755 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:26:39,756 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-08-05 10:26:39,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:26:39,756 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:39,756 INFO L399 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2019-08-05 10:26:39,756 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:39,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:39,757 INFO L82 PathProgramCache]: Analyzing trace with hash -1129747677, now seen corresponding path program 18 times [2019-08-05 10:26:39,758 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:39,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:39,771 WARN L254 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 40 conjunts are in the unsatisfiable core [2019-08-05 10:26:39,772 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:40,044 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:26:40,044 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:40,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:26:40,045 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:26:40,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:26:40,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:26:40,046 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 21 states. [2019-08-05 10:26:40,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:40,412 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-08-05 10:26:40,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:26:40,413 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2019-08-05 10:26:40,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:40,414 INFO L225 Difference]: With dead ends: 23 [2019-08-05 10:26:40,414 INFO L226 Difference]: Without dead ends: 23 [2019-08-05 10:26:40,415 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:26:40,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-08-05 10:26:40,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-08-05 10:26:40,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-05 10:26:40,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-08-05 10:26:40,418 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2019-08-05 10:26:40,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:40,419 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-08-05 10:26:40,419 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:26:40,419 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-08-05 10:26:40,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:26:40,420 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:40,420 INFO L399 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2019-08-05 10:26:40,420 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:40,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:40,421 INFO L82 PathProgramCache]: Analyzing trace with hash -662437812, now seen corresponding path program 19 times [2019-08-05 10:26:40,421 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:40,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:40,435 WARN L254 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 42 conjunts are in the unsatisfiable core [2019-08-05 10:26:40,437 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:40,690 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:26:40,690 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:40,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:26:40,690 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:26:40,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:26:40,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:26:40,691 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 22 states. [2019-08-05 10:26:41,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:41,050 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-08-05 10:26:41,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:26:41,051 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2019-08-05 10:26:41,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:41,052 INFO L225 Difference]: With dead ends: 24 [2019-08-05 10:26:41,052 INFO L226 Difference]: Without dead ends: 24 [2019-08-05 10:26:41,052 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:26:41,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-08-05 10:26:41,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-08-05 10:26:41,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-05 10:26:41,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-08-05 10:26:41,056 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2019-08-05 10:26:41,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:41,056 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-08-05 10:26:41,056 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:26:41,056 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-08-05 10:26:41,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:26:41,057 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:41,057 INFO L399 BasicCegarLoop]: trace histogram [20, 1, 1, 1] [2019-08-05 10:26:41,058 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:41,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:41,058 INFO L82 PathProgramCache]: Analyzing trace with hash 939266115, now seen corresponding path program 20 times [2019-08-05 10:26:41,059 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:41,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:41,072 WARN L254 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 44 conjunts are in the unsatisfiable core [2019-08-05 10:26:41,074 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:41,333 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:26:41,333 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:41,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:26:41,333 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:26:41,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:26:41,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:26:41,334 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 23 states. [2019-08-05 10:26:41,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:41,700 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-08-05 10:26:41,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 10:26:41,701 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2019-08-05 10:26:41,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:41,702 INFO L225 Difference]: With dead ends: 25 [2019-08-05 10:26:41,702 INFO L226 Difference]: Without dead ends: 25 [2019-08-05 10:26:41,703 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:26:41,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-05 10:26:41,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-08-05 10:26:41,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-05 10:26:41,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-08-05 10:26:41,706 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2019-08-05 10:26:41,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:41,706 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-08-05 10:26:41,706 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:26:41,707 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-08-05 10:26:41,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:26:41,707 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:41,707 INFO L399 BasicCegarLoop]: trace histogram [21, 1, 1, 1] [2019-08-05 10:26:41,708 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:41,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:41,708 INFO L82 PathProgramCache]: Analyzing trace with hash -947519700, now seen corresponding path program 21 times [2019-08-05 10:26:41,709 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:41,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:41,724 WARN L254 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 46 conjunts are in the unsatisfiable core [2019-08-05 10:26:41,726 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:42,019 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:26:42,020 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:42,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 10:26:42,020 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:26:42,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:26:42,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:26:42,021 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 24 states. [2019-08-05 10:26:42,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:42,588 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-08-05 10:26:42,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 10:26:42,591 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2019-08-05 10:26:42,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:42,591 INFO L225 Difference]: With dead ends: 26 [2019-08-05 10:26:42,591 INFO L226 Difference]: Without dead ends: 26 [2019-08-05 10:26:42,592 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:26:42,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-08-05 10:26:42,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-08-05 10:26:42,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-08-05 10:26:42,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-08-05 10:26:42,594 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2019-08-05 10:26:42,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:42,595 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-08-05 10:26:42,595 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:26:42,595 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-08-05 10:26:42,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:26:42,595 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:42,595 INFO L399 BasicCegarLoop]: trace histogram [22, 1, 1, 1] [2019-08-05 10:26:42,596 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:42,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:42,596 INFO L82 PathProgramCache]: Analyzing trace with hash 691662179, now seen corresponding path program 22 times [2019-08-05 10:26:42,597 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:42,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:42,610 WARN L254 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 48 conjunts are in the unsatisfiable core [2019-08-05 10:26:42,612 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:43,084 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:26:43,084 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:43,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 10:26:43,085 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 10:26:43,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 10:26:43,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:26:43,085 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 25 states. [2019-08-05 10:26:43,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:43,877 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-08-05 10:26:43,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:26:43,879 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2019-08-05 10:26:43,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:43,880 INFO L225 Difference]: With dead ends: 27 [2019-08-05 10:26:43,880 INFO L226 Difference]: Without dead ends: 27 [2019-08-05 10:26:43,881 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:26:43,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-08-05 10:26:43,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-08-05 10:26:43,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-05 10:26:43,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-08-05 10:26:43,883 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2019-08-05 10:26:43,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:43,884 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-08-05 10:26:43,884 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 10:26:43,884 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-08-05 10:26:43,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 10:26:43,884 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:43,884 INFO L399 BasicCegarLoop]: trace histogram [23, 1, 1, 1] [2019-08-05 10:26:43,885 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:43,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:43,885 INFO L82 PathProgramCache]: Analyzing trace with hash -33307124, now seen corresponding path program 23 times [2019-08-05 10:26:43,886 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:43,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:43,899 WARN L254 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 50 conjunts are in the unsatisfiable core [2019-08-05 10:26:43,901 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:44,208 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:26:44,209 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:44,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 10:26:44,209 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 10:26:44,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 10:26:44,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:26:44,210 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 26 states. [2019-08-05 10:26:44,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:44,989 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-08-05 10:26:44,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:26:44,989 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2019-08-05 10:26:44,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:44,990 INFO L225 Difference]: With dead ends: 28 [2019-08-05 10:26:44,990 INFO L226 Difference]: Without dead ends: 28 [2019-08-05 10:26:44,991 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:26:44,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-08-05 10:26:44,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-08-05 10:26:44,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-05 10:26:44,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-08-05 10:26:44,995 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2019-08-05 10:26:44,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:44,996 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-08-05 10:26:44,996 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 10:26:44,996 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-08-05 10:26:44,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:26:44,997 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:44,997 INFO L399 BasicCegarLoop]: trace histogram [24, 1, 1, 1] [2019-08-05 10:26:44,997 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:44,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:44,997 INFO L82 PathProgramCache]: Analyzing trace with hash -1032519037, now seen corresponding path program 24 times [2019-08-05 10:26:44,998 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:45,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:45,012 WARN L254 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 52 conjunts are in the unsatisfiable core [2019-08-05 10:26:45,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:45,351 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:26:45,352 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:45,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 10:26:45,352 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 10:26:45,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 10:26:45,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:26:45,353 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 27 states. [2019-08-05 10:26:45,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:45,837 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-08-05 10:26:45,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 10:26:45,837 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2019-08-05 10:26:45,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:45,838 INFO L225 Difference]: With dead ends: 29 [2019-08-05 10:26:45,838 INFO L226 Difference]: Without dead ends: 29 [2019-08-05 10:26:45,839 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:26:45,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-08-05 10:26:45,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-08-05 10:26:45,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-08-05 10:26:45,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-08-05 10:26:45,842 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2019-08-05 10:26:45,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:45,842 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-08-05 10:26:45,842 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 10:26:45,843 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-08-05 10:26:45,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 10:26:45,843 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:45,843 INFO L399 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2019-08-05 10:26:45,844 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:45,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:45,844 INFO L82 PathProgramCache]: Analyzing trace with hash -1943317268, now seen corresponding path program 25 times [2019-08-05 10:26:45,845 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:45,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:45,859 WARN L254 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 54 conjunts are in the unsatisfiable core [2019-08-05 10:26:45,860 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:46,495 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:26:46,495 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:46,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 10:26:46,496 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 10:26:46,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 10:26:46,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:26:46,497 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 28 states. [2019-08-05 10:26:47,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:47,071 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-08-05 10:26:47,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 10:26:47,071 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 28 [2019-08-05 10:26:47,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:47,072 INFO L225 Difference]: With dead ends: 30 [2019-08-05 10:26:47,072 INFO L226 Difference]: Without dead ends: 30 [2019-08-05 10:26:47,073 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:26:47,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-08-05 10:26:47,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-08-05 10:26:47,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-05 10:26:47,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-08-05 10:26:47,076 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2019-08-05 10:26:47,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:47,076 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-08-05 10:26:47,076 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 10:26:47,076 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-08-05 10:26:47,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 10:26:47,077 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:47,077 INFO L399 BasicCegarLoop]: trace histogram [26, 1, 1, 1] [2019-08-05 10:26:47,077 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:47,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:47,077 INFO L82 PathProgramCache]: Analyzing trace with hash -113291357, now seen corresponding path program 26 times [2019-08-05 10:26:47,078 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:47,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:47,092 WARN L254 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 56 conjunts are in the unsatisfiable core [2019-08-05 10:26:47,094 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:47,432 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:26:47,432 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:47,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 10:26:47,433 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 10:26:47,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 10:26:47,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:26:47,434 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 29 states. [2019-08-05 10:26:47,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:47,985 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-08-05 10:26:47,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 10:26:47,985 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 29 [2019-08-05 10:26:47,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:47,986 INFO L225 Difference]: With dead ends: 31 [2019-08-05 10:26:47,986 INFO L226 Difference]: Without dead ends: 31 [2019-08-05 10:26:47,987 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:26:47,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-08-05 10:26:47,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-08-05 10:26:47,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-08-05 10:26:47,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-08-05 10:26:47,990 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2019-08-05 10:26:47,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:47,990 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-08-05 10:26:47,990 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 10:26:47,990 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-08-05 10:26:47,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 10:26:47,991 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:47,991 INFO L399 BasicCegarLoop]: trace histogram [27, 1, 1, 1] [2019-08-05 10:26:47,991 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:47,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:47,992 INFO L82 PathProgramCache]: Analyzing trace with hash 782937036, now seen corresponding path program 27 times [2019-08-05 10:26:47,992 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:48,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:48,008 WARN L254 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 58 conjunts are in the unsatisfiable core [2019-08-05 10:26:48,009 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:48,695 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:26:48,695 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:48,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 10:26:48,696 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 10:26:48,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 10:26:48,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:26:48,697 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 30 states. [2019-08-05 10:26:49,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:49,299 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-08-05 10:26:49,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 10:26:49,299 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 30 [2019-08-05 10:26:49,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:49,300 INFO L225 Difference]: With dead ends: 32 [2019-08-05 10:26:49,300 INFO L226 Difference]: Without dead ends: 32 [2019-08-05 10:26:49,301 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:26:49,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-08-05 10:26:49,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-08-05 10:26:49,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-05 10:26:49,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-08-05 10:26:49,305 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2019-08-05 10:26:49,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:49,305 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-08-05 10:26:49,305 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 10:26:49,305 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-08-05 10:26:49,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-05 10:26:49,306 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:49,306 INFO L399 BasicCegarLoop]: trace histogram [28, 1, 1, 1] [2019-08-05 10:26:49,306 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:49,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:49,306 INFO L82 PathProgramCache]: Analyzing trace with hash -1498753853, now seen corresponding path program 28 times [2019-08-05 10:26:49,307 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:49,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:49,324 WARN L254 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 60 conjunts are in the unsatisfiable core [2019-08-05 10:26:49,325 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:50,195 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:26:50,195 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:50,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-05 10:26:50,196 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-05 10:26:50,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-05 10:26:50,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:26:50,196 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 31 states. [2019-08-05 10:26:50,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:50,855 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-08-05 10:26:50,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 10:26:50,856 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 31 [2019-08-05 10:26:50,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:50,856 INFO L225 Difference]: With dead ends: 33 [2019-08-05 10:26:50,857 INFO L226 Difference]: Without dead ends: 33 [2019-08-05 10:26:50,857 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:26:50,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-08-05 10:26:50,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-08-05 10:26:50,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-05 10:26:50,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-08-05 10:26:50,860 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2019-08-05 10:26:50,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:50,861 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-08-05 10:26:50,861 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-05 10:26:50,861 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-08-05 10:26:50,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 10:26:50,861 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:50,862 INFO L399 BasicCegarLoop]: trace histogram [29, 1, 1, 1] [2019-08-05 10:26:50,862 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:50,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:50,862 INFO L82 PathProgramCache]: Analyzing trace with hash 783272620, now seen corresponding path program 29 times [2019-08-05 10:26:50,863 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:50,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:50,879 WARN L254 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 62 conjunts are in the unsatisfiable core [2019-08-05 10:26:50,881 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:51,323 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:26:51,323 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:51,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-05 10:26:51,324 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 10:26:51,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 10:26:51,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:26:51,324 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 32 states. [2019-08-05 10:26:52,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:52,007 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-08-05 10:26:52,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-05 10:26:52,014 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 32 [2019-08-05 10:26:52,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:52,015 INFO L225 Difference]: With dead ends: 34 [2019-08-05 10:26:52,015 INFO L226 Difference]: Without dead ends: 34 [2019-08-05 10:26:52,016 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:26:52,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-08-05 10:26:52,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-08-05 10:26:52,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-05 10:26:52,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-08-05 10:26:52,020 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2019-08-05 10:26:52,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:52,021 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-08-05 10:26:52,021 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 10:26:52,021 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-08-05 10:26:52,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-05 10:26:52,021 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:52,022 INFO L399 BasicCegarLoop]: trace histogram [30, 1, 1, 1] [2019-08-05 10:26:52,022 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:52,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:52,023 INFO L82 PathProgramCache]: Analyzing trace with hash -1488350749, now seen corresponding path program 30 times [2019-08-05 10:26:52,023 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:52,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:52,040 WARN L254 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 64 conjunts are in the unsatisfiable core [2019-08-05 10:26:52,042 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:52,485 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:26:52,485 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:52,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-05 10:26:52,485 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-05 10:26:52,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-05 10:26:52,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:26:52,486 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 33 states. [2019-08-05 10:26:53,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:53,211 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-08-05 10:26:53,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-05 10:26:53,211 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 33 [2019-08-05 10:26:53,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:53,212 INFO L225 Difference]: With dead ends: 35 [2019-08-05 10:26:53,212 INFO L226 Difference]: Without dead ends: 35 [2019-08-05 10:26:53,213 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:26:53,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-08-05 10:26:53,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-08-05 10:26:53,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-05 10:26:53,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-08-05 10:26:53,215 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2019-08-05 10:26:53,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:53,215 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-08-05 10:26:53,215 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-05 10:26:53,215 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-08-05 10:26:53,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-05 10:26:53,216 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:53,216 INFO L399 BasicCegarLoop]: trace histogram [31, 1, 1, 1] [2019-08-05 10:26:53,216 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:53,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:53,217 INFO L82 PathProgramCache]: Analyzing trace with hash 1105768844, now seen corresponding path program 31 times [2019-08-05 10:26:53,217 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:53,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:53,234 WARN L254 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 66 conjunts are in the unsatisfiable core [2019-08-05 10:26:53,236 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:54,256 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:26:54,256 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:54,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 10:26:54,257 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 10:26:54,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 10:26:54,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:26:54,258 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 34 states. [2019-08-05 10:26:55,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:55,217 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-08-05 10:26:55,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-05 10:26:55,218 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 34 [2019-08-05 10:26:55,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:55,218 INFO L225 Difference]: With dead ends: 36 [2019-08-05 10:26:55,218 INFO L226 Difference]: Without dead ends: 36 [2019-08-05 10:26:55,219 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:26:55,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-08-05 10:26:55,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-08-05 10:26:55,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-05 10:26:55,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-08-05 10:26:55,223 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2019-08-05 10:26:55,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:55,223 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-08-05 10:26:55,223 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 10:26:55,223 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-08-05 10:26:55,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-05 10:26:55,224 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:55,224 INFO L399 BasicCegarLoop]: trace histogram [32, 1, 1, 1] [2019-08-05 10:26:55,224 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:55,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:55,224 INFO L82 PathProgramCache]: Analyzing trace with hash -80902397, now seen corresponding path program 32 times [2019-08-05 10:26:55,225 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:55,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:55,242 WARN L254 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 68 conjunts are in the unsatisfiable core [2019-08-05 10:26:55,244 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:55,720 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:26:55,720 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:55,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-05 10:26:55,721 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 10:26:55,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 10:26:55,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:26:55,722 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 35 states. [2019-08-05 10:26:56,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:56,619 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-08-05 10:26:56,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 10:26:56,620 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 35 [2019-08-05 10:26:56,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:56,620 INFO L225 Difference]: With dead ends: 37 [2019-08-05 10:26:56,620 INFO L226 Difference]: Without dead ends: 37 [2019-08-05 10:26:56,622 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:26:56,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-08-05 10:26:56,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-08-05 10:26:56,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-05 10:26:56,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-08-05 10:26:56,624 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2019-08-05 10:26:56,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:56,625 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-08-05 10:26:56,625 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 10:26:56,625 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-08-05 10:26:56,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-05 10:26:56,625 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:56,625 INFO L399 BasicCegarLoop]: trace histogram [33, 1, 1, 1] [2019-08-05 10:26:56,626 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:56,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:56,626 INFO L82 PathProgramCache]: Analyzing trace with hash 1786994796, now seen corresponding path program 33 times [2019-08-05 10:26:56,627 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:56,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:56,644 WARN L254 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 70 conjunts are in the unsatisfiable core [2019-08-05 10:26:56,646 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:57,336 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:26:57,336 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:57,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-05 10:26:57,336 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-05 10:26:57,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-05 10:26:57,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:26:57,337 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 36 states. [2019-08-05 10:26:58,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:58,216 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-08-05 10:26:58,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-05 10:26:58,216 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 36 [2019-08-05 10:26:58,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:58,217 INFO L225 Difference]: With dead ends: 38 [2019-08-05 10:26:58,217 INFO L226 Difference]: Without dead ends: 38 [2019-08-05 10:26:58,218 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:26:58,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-08-05 10:26:58,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-08-05 10:26:58,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-05 10:26:58,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-08-05 10:26:58,220 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2019-08-05 10:26:58,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:58,221 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-08-05 10:26:58,221 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-05 10:26:58,221 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-08-05 10:26:58,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-08-05 10:26:58,221 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:58,221 INFO L399 BasicCegarLoop]: trace histogram [34, 1, 1, 1] [2019-08-05 10:26:58,222 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:58,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:58,222 INFO L82 PathProgramCache]: Analyzing trace with hash -437734365, now seen corresponding path program 34 times [2019-08-05 10:26:58,222 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:58,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:58,239 WARN L254 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 72 conjunts are in the unsatisfiable core [2019-08-05 10:26:58,241 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:58,887 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:26:58,888 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:58,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-05 10:26:58,888 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-05 10:26:58,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-05 10:26:58,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:26:58,889 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 37 states. [2019-08-05 10:26:59,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:59,795 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-08-05 10:26:59,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-05 10:26:59,795 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 37 [2019-08-05 10:26:59,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:59,796 INFO L225 Difference]: With dead ends: 39 [2019-08-05 10:26:59,796 INFO L226 Difference]: Without dead ends: 39 [2019-08-05 10:26:59,800 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:26:59,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-08-05 10:26:59,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-08-05 10:26:59,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-05 10:26:59,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-08-05 10:26:59,802 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2019-08-05 10:26:59,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:59,805 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-08-05 10:26:59,805 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-05 10:26:59,806 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-08-05 10:26:59,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-05 10:26:59,806 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:59,806 INFO L399 BasicCegarLoop]: trace histogram [35, 1, 1, 1] [2019-08-05 10:26:59,806 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:59,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:59,807 INFO L82 PathProgramCache]: Analyzing trace with hash -684861620, now seen corresponding path program 35 times [2019-08-05 10:26:59,807 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:59,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:59,828 WARN L254 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 74 conjunts are in the unsatisfiable core [2019-08-05 10:26:59,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:27:01,792 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:27:01,792 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:27:01,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-05 10:27:01,793 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-05 10:27:01,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-05 10:27:01,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:27:01,794 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 38 states. [2019-08-05 10:27:02,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:27:02,758 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-08-05 10:27:02,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-05 10:27:02,759 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 38 [2019-08-05 10:27:02,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:27:02,760 INFO L225 Difference]: With dead ends: 40 [2019-08-05 10:27:02,760 INFO L226 Difference]: Without dead ends: 40 [2019-08-05 10:27:02,761 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:27:02,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-08-05 10:27:02,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-08-05 10:27:02,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-05 10:27:02,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-08-05 10:27:02,763 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2019-08-05 10:27:02,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:27:02,763 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-08-05 10:27:02,763 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-05 10:27:02,764 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-08-05 10:27:02,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-08-05 10:27:02,764 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:27:02,764 INFO L399 BasicCegarLoop]: trace histogram [36, 1, 1, 1] [2019-08-05 10:27:02,764 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:27:02,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:27:02,764 INFO L82 PathProgramCache]: Analyzing trace with hash 244128067, now seen corresponding path program 36 times [2019-08-05 10:27:02,765 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:27:02,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:27:02,785 WARN L254 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 76 conjunts are in the unsatisfiable core [2019-08-05 10:27:02,787 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:27:03,400 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:27:03,400 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:27:03,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-05 10:27:03,401 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-05 10:27:03,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-05 10:27:03,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:27:03,402 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 39 states. [2019-08-05 10:27:04,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:27:04,431 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-08-05 10:27:04,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-05 10:27:04,431 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 39 [2019-08-05 10:27:04,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:27:04,432 INFO L225 Difference]: With dead ends: 41 [2019-08-05 10:27:04,432 INFO L226 Difference]: Without dead ends: 41 [2019-08-05 10:27:04,433 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:27:04,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-08-05 10:27:04,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-08-05 10:27:04,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-05 10:27:04,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-08-05 10:27:04,436 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2019-08-05 10:27:04,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:27:04,436 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-08-05 10:27:04,436 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-05 10:27:04,436 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-08-05 10:27:04,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 10:27:04,444 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:27:04,444 INFO L399 BasicCegarLoop]: trace histogram [37, 1, 1, 1] [2019-08-05 10:27:04,445 INFO L418 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:27:04,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:27:04,445 INFO L82 PathProgramCache]: Analyzing trace with hash -1021962708, now seen corresponding path program 37 times [2019-08-05 10:27:04,447 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:27:04,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:27:04,468 WARN L254 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 78 conjunts are in the unsatisfiable core [2019-08-05 10:27:04,469 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:27:05,508 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:27:05,508 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:27:05,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-05 10:27:05,508 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-05 10:27:05,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-05 10:27:05,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:27:05,509 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 40 states. [2019-08-05 10:27:06,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:27:06,601 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-08-05 10:27:06,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-05 10:27:06,601 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 40 [2019-08-05 10:27:06,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:27:06,602 INFO L225 Difference]: With dead ends: 42 [2019-08-05 10:27:06,602 INFO L226 Difference]: Without dead ends: 42 [2019-08-05 10:27:06,603 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:27:06,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-08-05 10:27:06,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-08-05 10:27:06,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-05 10:27:06,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-08-05 10:27:06,605 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2019-08-05 10:27:06,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:27:06,606 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-08-05 10:27:06,606 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-05 10:27:06,606 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-08-05 10:27:06,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-08-05 10:27:06,606 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:27:06,607 INFO L399 BasicCegarLoop]: trace histogram [38, 1, 1, 1] [2019-08-05 10:27:06,607 INFO L418 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:27:06,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:27:06,607 INFO L82 PathProgramCache]: Analyzing trace with hash -1616071069, now seen corresponding path program 38 times [2019-08-05 10:27:06,608 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:27:06,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:27:06,626 WARN L254 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 80 conjunts are in the unsatisfiable core [2019-08-05 10:27:06,627 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:27:07,591 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:27:07,592 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:27:07,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-05 10:27:07,592 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-05 10:27:07,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-05 10:27:07,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:27:07,593 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 41 states. [2019-08-05 10:27:08,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:27:08,763 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-08-05 10:27:08,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-05 10:27:08,763 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 41 [2019-08-05 10:27:08,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:27:08,764 INFO L225 Difference]: With dead ends: 43 [2019-08-05 10:27:08,764 INFO L226 Difference]: Without dead ends: 43 [2019-08-05 10:27:08,765 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:27:08,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-08-05 10:27:08,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-08-05 10:27:08,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-05 10:27:08,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-08-05 10:27:08,767 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2019-08-05 10:27:08,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:27:08,768 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-08-05 10:27:08,768 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-05 10:27:08,768 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-08-05 10:27:08,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-05 10:27:08,768 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:27:08,769 INFO L399 BasicCegarLoop]: trace histogram [39, 1, 1, 1] [2019-08-05 10:27:08,769 INFO L418 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:27:08,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:27:08,769 INFO L82 PathProgramCache]: Analyzing trace with hash 1441406220, now seen corresponding path program 39 times [2019-08-05 10:27:08,770 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:27:08,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:27:08,789 WARN L254 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 82 conjunts are in the unsatisfiable core [2019-08-05 10:27:08,790 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:27:09,527 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:27:09,528 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:27:09,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-05 10:27:09,528 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-05 10:27:09,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-05 10:27:09,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:27:09,529 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 42 states. [2019-08-05 10:27:10,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:27:10,968 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-08-05 10:27:10,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-05 10:27:10,969 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 42 [2019-08-05 10:27:10,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:27:10,969 INFO L225 Difference]: With dead ends: 44 [2019-08-05 10:27:10,969 INFO L226 Difference]: Without dead ends: 44 [2019-08-05 10:27:10,971 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:27:10,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-08-05 10:27:10,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-08-05 10:27:10,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-05 10:27:10,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-08-05 10:27:10,973 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2019-08-05 10:27:10,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:27:10,973 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-08-05 10:27:10,973 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-05 10:27:10,973 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-08-05 10:27:10,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-08-05 10:27:10,973 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:27:10,973 INFO L399 BasicCegarLoop]: trace histogram [40, 1, 1, 1] [2019-08-05 10:27:10,974 INFO L418 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:27:10,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:27:10,974 INFO L82 PathProgramCache]: Analyzing trace with hash 1733921667, now seen corresponding path program 40 times [2019-08-05 10:27:10,974 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:27:10,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:27:10,993 WARN L254 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 84 conjunts are in the unsatisfiable core [2019-08-05 10:27:10,994 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:27:11,758 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:27:11,759 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:27:11,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-05 10:27:11,759 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-05 10:27:11,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-05 10:27:11,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:27:11,760 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 43 states. [2019-08-05 10:27:13,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:27:13,184 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-08-05 10:27:13,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-05 10:27:13,184 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 43 [2019-08-05 10:27:13,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:27:13,185 INFO L225 Difference]: With dead ends: 45 [2019-08-05 10:27:13,185 INFO L226 Difference]: Without dead ends: 45 [2019-08-05 10:27:13,186 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:27:13,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-05 10:27:13,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-08-05 10:27:13,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-05 10:27:13,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-08-05 10:27:13,188 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2019-08-05 10:27:13,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:27:13,189 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-08-05 10:27:13,189 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-05 10:27:13,189 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-08-05 10:27:13,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-08-05 10:27:13,189 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:27:13,189 INFO L399 BasicCegarLoop]: trace histogram [41, 1, 1, 1] [2019-08-05 10:27:13,189 INFO L418 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:27:13,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:27:13,190 INFO L82 PathProgramCache]: Analyzing trace with hash -2083001364, now seen corresponding path program 41 times [2019-08-05 10:27:13,191 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:27:13,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:27:13,211 WARN L254 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 86 conjunts are in the unsatisfiable core [2019-08-05 10:27:13,212 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:27:13,985 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:27:13,985 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:27:13,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-05 10:27:13,985 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-05 10:27:13,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-05 10:27:13,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:27:13,987 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 44 states. [2019-08-05 10:27:15,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:27:15,334 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-08-05 10:27:15,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-05 10:27:15,334 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 44 [2019-08-05 10:27:15,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:27:15,335 INFO L225 Difference]: With dead ends: 46 [2019-08-05 10:27:15,335 INFO L226 Difference]: Without dead ends: 46 [2019-08-05 10:27:15,336 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:27:15,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-08-05 10:27:15,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-08-05 10:27:15,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-05 10:27:15,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-08-05 10:27:15,338 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2019-08-05 10:27:15,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:27:15,338 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-08-05 10:27:15,338 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-05 10:27:15,338 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-08-05 10:27:15,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-08-05 10:27:15,339 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:27:15,339 INFO L399 BasicCegarLoop]: trace histogram [42, 1, 1, 1] [2019-08-05 10:27:15,339 INFO L418 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:27:15,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:27:15,339 INFO L82 PathProgramCache]: Analyzing trace with hash -148531037, now seen corresponding path program 42 times [2019-08-05 10:27:15,340 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:27:15,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:27:15,360 WARN L254 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 88 conjunts are in the unsatisfiable core [2019-08-05 10:27:15,361 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:27:16,283 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:27:16,283 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:27:16,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-05 10:27:16,284 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-05 10:27:16,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-05 10:27:16,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:27:16,285 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 45 states. [2019-08-05 10:27:17,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:27:17,663 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-08-05 10:27:17,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-05 10:27:17,663 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 45 [2019-08-05 10:27:17,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:27:17,664 INFO L225 Difference]: With dead ends: 47 [2019-08-05 10:27:17,664 INFO L226 Difference]: Without dead ends: 47 [2019-08-05 10:27:17,665 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:27:17,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-08-05 10:27:17,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-08-05 10:27:17,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-08-05 10:27:17,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-08-05 10:27:17,668 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2019-08-05 10:27:17,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:27:17,668 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-08-05 10:27:17,668 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-05 10:27:17,668 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-08-05 10:27:17,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-08-05 10:27:17,668 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:27:17,669 INFO L399 BasicCegarLoop]: trace histogram [43, 1, 1, 1] [2019-08-05 10:27:17,669 INFO L418 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:27:17,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:27:17,669 INFO L82 PathProgramCache]: Analyzing trace with hash -309493044, now seen corresponding path program 43 times [2019-08-05 10:27:17,670 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:27:17,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:27:17,690 WARN L254 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 90 conjunts are in the unsatisfiable core [2019-08-05 10:27:17,692 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:27:18,485 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:27:18,485 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:27:18,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-05 10:27:18,486 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-05 10:27:18,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-05 10:27:18,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:27:18,486 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 46 states. [2019-08-05 10:27:19,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:27:19,957 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-08-05 10:27:19,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-05 10:27:19,957 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 46 [2019-08-05 10:27:19,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:27:19,958 INFO L225 Difference]: With dead ends: 48 [2019-08-05 10:27:19,958 INFO L226 Difference]: Without dead ends: 48 [2019-08-05 10:27:19,959 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:27:19,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-08-05 10:27:19,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-08-05 10:27:19,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-05 10:27:19,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-08-05 10:27:19,961 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2019-08-05 10:27:19,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:27:19,961 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-08-05 10:27:19,962 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-05 10:27:19,962 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-08-05 10:27:19,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 10:27:19,962 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:27:19,962 INFO L399 BasicCegarLoop]: trace histogram [44, 1, 1, 1] [2019-08-05 10:27:19,963 INFO L418 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:27:19,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:27:19,963 INFO L82 PathProgramCache]: Analyzing trace with hash -1004347965, now seen corresponding path program 44 times [2019-08-05 10:27:19,964 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:27:19,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:27:19,984 WARN L254 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 92 conjunts are in the unsatisfiable core [2019-08-05 10:27:19,986 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:27:21,420 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:27:21,420 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:27:21,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-05 10:27:21,421 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-05 10:27:21,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-05 10:27:21,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:27:21,421 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 47 states. [2019-08-05 10:27:22,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:27:22,955 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-08-05 10:27:22,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-05 10:27:22,955 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 47 [2019-08-05 10:27:22,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:27:22,956 INFO L225 Difference]: With dead ends: 49 [2019-08-05 10:27:22,956 INFO L226 Difference]: Without dead ends: 49 [2019-08-05 10:27:22,957 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:27:22,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-08-05 10:27:22,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-08-05 10:27:22,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-08-05 10:27:22,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-08-05 10:27:22,959 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2019-08-05 10:27:22,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:27:22,960 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-08-05 10:27:22,960 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-05 10:27:22,960 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-08-05 10:27:22,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-08-05 10:27:22,960 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:27:22,960 INFO L399 BasicCegarLoop]: trace histogram [45, 1, 1, 1] [2019-08-05 10:27:22,961 INFO L418 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:27:22,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:27:22,961 INFO L82 PathProgramCache]: Analyzing trace with hash -1070014036, now seen corresponding path program 45 times [2019-08-05 10:27:22,962 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:27:22,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:27:22,984 WARN L254 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 94 conjunts are in the unsatisfiable core [2019-08-05 10:27:22,986 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:27:24,435 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:27:24,436 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:27:24,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-05 10:27:24,436 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-05 10:27:24,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-05 10:27:24,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:27:24,436 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 48 states. [2019-08-05 10:27:26,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:27:26,196 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-08-05 10:27:26,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-05 10:27:26,197 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 48 [2019-08-05 10:27:26,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:27:26,198 INFO L225 Difference]: With dead ends: 50 [2019-08-05 10:27:26,198 INFO L226 Difference]: Without dead ends: 50 [2019-08-05 10:27:26,199 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:27:26,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-08-05 10:27:26,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-08-05 10:27:26,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-08-05 10:27:26,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-08-05 10:27:26,201 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2019-08-05 10:27:26,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:27:26,202 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2019-08-05 10:27:26,202 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-05 10:27:26,202 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-08-05 10:27:26,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-08-05 10:27:26,202 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:27:26,202 INFO L399 BasicCegarLoop]: trace histogram [46, 1, 1, 1] [2019-08-05 10:27:26,202 INFO L418 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:27:26,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:27:26,203 INFO L82 PathProgramCache]: Analyzing trace with hash 1189305059, now seen corresponding path program 46 times [2019-08-05 10:27:26,203 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:27:26,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:27:26,226 WARN L254 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 96 conjunts are in the unsatisfiable core [2019-08-05 10:27:26,227 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:27:27,153 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:27:27,153 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:27:27,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-08-05 10:27:27,154 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-05 10:27:27,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-05 10:27:27,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:27:27,155 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 49 states. [2019-08-05 10:27:28,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:27:28,787 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-08-05 10:27:28,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-08-05 10:27:28,788 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 49 [2019-08-05 10:27:28,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:27:28,789 INFO L225 Difference]: With dead ends: 51 [2019-08-05 10:27:28,789 INFO L226 Difference]: Without dead ends: 51 [2019-08-05 10:27:28,790 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:27:28,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-05 10:27:28,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-08-05 10:27:28,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-08-05 10:27:28,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-08-05 10:27:28,791 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2019-08-05 10:27:28,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:27:28,792 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-08-05 10:27:28,792 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-05 10:27:28,792 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-08-05 10:27:28,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-08-05 10:27:28,793 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:27:28,793 INFO L399 BasicCegarLoop]: trace histogram [47, 1, 1, 1] [2019-08-05 10:27:28,793 INFO L418 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:27:28,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:27:28,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1786247028, now seen corresponding path program 47 times [2019-08-05 10:27:28,794 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:27:28,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:27:28,816 WARN L254 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 98 conjunts are in the unsatisfiable core [2019-08-05 10:27:28,818 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:27:29,745 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:27:29,745 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:27:29,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-05 10:27:29,746 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-05 10:27:29,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-05 10:27:29,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:27:29,746 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 50 states. [2019-08-05 10:27:31,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:27:31,626 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-08-05 10:27:31,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-05 10:27:31,626 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 50 [2019-08-05 10:27:31,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:27:31,627 INFO L225 Difference]: With dead ends: 52 [2019-08-05 10:27:31,627 INFO L226 Difference]: Without dead ends: 52 [2019-08-05 10:27:31,628 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:27:31,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-08-05 10:27:31,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-08-05 10:27:31,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-05 10:27:31,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-08-05 10:27:31,631 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2019-08-05 10:27:31,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:27:31,631 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-08-05 10:27:31,631 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-05 10:27:31,631 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-08-05 10:27:31,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-08-05 10:27:31,632 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:27:31,632 INFO L399 BasicCegarLoop]: trace histogram [48, 1, 1, 1] [2019-08-05 10:27:31,632 INFO L418 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:27:31,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:27:31,633 INFO L82 PathProgramCache]: Analyzing trace with hash 460918787, now seen corresponding path program 48 times [2019-08-05 10:27:31,633 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:27:31,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:27:31,657 WARN L254 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 100 conjunts are in the unsatisfiable core [2019-08-05 10:27:31,658 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:27:32,650 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:27:32,650 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:27:32,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-08-05 10:27:32,651 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-05 10:27:32,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-05 10:27:32,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:27:32,651 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 51 states. [2019-08-05 10:27:34,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:27:34,429 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-08-05 10:27:34,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-05 10:27:34,429 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 51 [2019-08-05 10:27:34,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:27:34,430 INFO L225 Difference]: With dead ends: 53 [2019-08-05 10:27:34,430 INFO L226 Difference]: Without dead ends: 53 [2019-08-05 10:27:34,431 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:27:34,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-08-05 10:27:34,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-08-05 10:27:34,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-08-05 10:27:34,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-08-05 10:27:34,433 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2019-08-05 10:27:34,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:27:34,433 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-08-05 10:27:34,433 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-08-05 10:27:34,433 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-08-05 10:27:34,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-08-05 10:27:34,434 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:27:34,434 INFO L399 BasicCegarLoop]: trace histogram [49, 1, 1, 1] [2019-08-05 10:27:34,434 INFO L418 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:27:34,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:27:34,434 INFO L82 PathProgramCache]: Analyzing trace with hash 1403582316, now seen corresponding path program 49 times [2019-08-05 10:27:34,435 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:27:34,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:27:34,459 WARN L254 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 102 conjunts are in the unsatisfiable core [2019-08-05 10:27:34,460 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:27:35,512 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:27:35,512 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:27:35,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-05 10:27:35,513 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-05 10:27:35,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-05 10:27:35,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:27:35,515 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 52 states. [2019-08-05 10:27:37,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:27:37,544 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-08-05 10:27:37,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-05 10:27:37,545 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 52 [2019-08-05 10:27:37,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:27:37,546 INFO L225 Difference]: With dead ends: 54 [2019-08-05 10:27:37,546 INFO L226 Difference]: Without dead ends: 54 [2019-08-05 10:27:37,546 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:27:37,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-05 10:27:37,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-08-05 10:27:37,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-08-05 10:27:37,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2019-08-05 10:27:37,548 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2019-08-05 10:27:37,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:27:37,548 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2019-08-05 10:27:37,548 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-05 10:27:37,548 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2019-08-05 10:27:37,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-08-05 10:27:37,549 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:27:37,549 INFO L399 BasicCegarLoop]: trace histogram [50, 1, 1, 1] [2019-08-05 10:27:37,549 INFO L418 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:27:37,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:27:37,550 INFO L82 PathProgramCache]: Analyzing trace with hash 561380643, now seen corresponding path program 50 times [2019-08-05 10:27:37,550 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:27:37,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:27:37,575 WARN L254 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 104 conjunts are in the unsatisfiable core [2019-08-05 10:27:37,576 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:27:38,619 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:27:38,619 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:27:38,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-08-05 10:27:38,620 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-08-05 10:27:38,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-08-05 10:27:38,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:27:38,621 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 53 states. [2019-08-05 10:27:40,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:27:40,567 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-08-05 10:27:40,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-08-05 10:27:40,567 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 53 [2019-08-05 10:27:40,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:27:40,568 INFO L225 Difference]: With dead ends: 55 [2019-08-05 10:27:40,568 INFO L226 Difference]: Without dead ends: 55 [2019-08-05 10:27:40,569 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:27:40,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-08-05 10:27:40,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-08-05 10:27:40,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-08-05 10:27:40,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-08-05 10:27:40,571 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2019-08-05 10:27:40,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:27:40,572 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-08-05 10:27:40,572 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-08-05 10:27:40,572 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-08-05 10:27:40,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 10:27:40,573 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:27:40,573 INFO L399 BasicCegarLoop]: trace histogram [51, 1, 1, 1] [2019-08-05 10:27:40,573 INFO L418 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:27:40,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:27:40,573 INFO L82 PathProgramCache]: Analyzing trace with hash 222932556, now seen corresponding path program 51 times [2019-08-05 10:27:40,574 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:27:40,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:27:40,599 WARN L254 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 106 conjunts are in the unsatisfiable core [2019-08-05 10:27:40,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:27:41,953 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:27:41,953 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:27:41,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-05 10:27:41,953 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-08-05 10:27:41,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-08-05 10:27:41,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:27:41,954 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 54 states. [2019-08-05 10:27:43,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:27:43,979 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-08-05 10:27:43,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-05 10:27:43,979 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 54 [2019-08-05 10:27:43,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:27:43,980 INFO L225 Difference]: With dead ends: 56 [2019-08-05 10:27:43,980 INFO L226 Difference]: Without dead ends: 56 [2019-08-05 10:27:43,981 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:27:43,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-08-05 10:27:43,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-08-05 10:27:43,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-08-05 10:27:43,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-08-05 10:27:43,983 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2019-08-05 10:27:43,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:27:43,984 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-08-05 10:27:43,984 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-08-05 10:27:43,984 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-08-05 10:27:43,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-08-05 10:27:43,984 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:27:43,984 INFO L399 BasicCegarLoop]: trace histogram [52, 1, 1, 1] [2019-08-05 10:27:43,985 INFO L418 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:27:43,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:27:43,985 INFO L82 PathProgramCache]: Analyzing trace with hash -1679023549, now seen corresponding path program 52 times [2019-08-05 10:27:43,985 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:27:44,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:27:44,010 WARN L254 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 108 conjunts are in the unsatisfiable core [2019-08-05 10:27:44,012 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:27:45,121 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:27:45,121 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:27:45,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-08-05 10:27:45,122 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-08-05 10:27:45,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-08-05 10:27:45,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:27:45,122 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 55 states. [2019-08-05 10:27:47,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:27:47,301 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-08-05 10:27:47,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-05 10:27:47,301 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 55 [2019-08-05 10:27:47,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:27:47,302 INFO L225 Difference]: With dead ends: 57 [2019-08-05 10:27:47,302 INFO L226 Difference]: Without dead ends: 57 [2019-08-05 10:27:47,303 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:27:47,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-05 10:27:47,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-08-05 10:27:47,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-08-05 10:27:47,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-08-05 10:27:47,306 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2019-08-05 10:27:47,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:27:47,306 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-08-05 10:27:47,306 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-08-05 10:27:47,306 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-08-05 10:27:47,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-08-05 10:27:47,307 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:27:47,307 INFO L399 BasicCegarLoop]: trace histogram [53, 1, 1, 1] [2019-08-05 10:27:47,307 INFO L418 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:27:47,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:27:47,307 INFO L82 PathProgramCache]: Analyzing trace with hash -510120660, now seen corresponding path program 53 times [2019-08-05 10:27:47,308 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:27:47,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:27:47,334 WARN L254 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 110 conjunts are in the unsatisfiable core [2019-08-05 10:27:47,336 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:27:48,514 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:27:48,515 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:27:48,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-08-05 10:27:48,515 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-08-05 10:27:48,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-08-05 10:27:48,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:27:48,515 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 56 states. [2019-08-05 10:27:50,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:27:50,679 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-08-05 10:27:50,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-08-05 10:27:50,680 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 56 [2019-08-05 10:27:50,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:27:50,681 INFO L225 Difference]: With dead ends: 58 [2019-08-05 10:27:50,681 INFO L226 Difference]: Without dead ends: 58 [2019-08-05 10:27:50,681 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:27:50,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-08-05 10:27:50,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-08-05 10:27:50,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-08-05 10:27:50,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-08-05 10:27:50,684 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2019-08-05 10:27:50,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:27:50,684 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-08-05 10:27:50,684 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-08-05 10:27:50,684 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-08-05 10:27:50,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-08-05 10:27:50,685 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:27:50,685 INFO L399 BasicCegarLoop]: trace histogram [54, 1, 1, 1] [2019-08-05 10:27:50,685 INFO L418 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:27:50,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:27:50,685 INFO L82 PathProgramCache]: Analyzing trace with hash 1366130531, now seen corresponding path program 54 times [2019-08-05 10:27:50,686 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:27:50,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:27:50,713 WARN L254 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 112 conjunts are in the unsatisfiable core [2019-08-05 10:27:50,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:27:52,154 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:27:52,155 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:27:52,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2019-08-05 10:27:52,155 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-08-05 10:27:52,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-08-05 10:27:52,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:27:52,156 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 57 states. [2019-08-05 10:27:54,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:27:54,451 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-08-05 10:27:54,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-08-05 10:27:54,452 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 57 [2019-08-05 10:27:54,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:27:54,453 INFO L225 Difference]: With dead ends: 59 [2019-08-05 10:27:54,453 INFO L226 Difference]: Without dead ends: 59 [2019-08-05 10:27:54,454 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:27:54,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-08-05 10:27:54,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-08-05 10:27:54,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-08-05 10:27:54,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2019-08-05 10:27:54,456 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2019-08-05 10:27:54,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:27:54,456 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2019-08-05 10:27:54,457 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-08-05 10:27:54,457 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2019-08-05 10:27:54,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-08-05 10:27:54,457 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:27:54,457 INFO L399 BasicCegarLoop]: trace histogram [55, 1, 1, 1] [2019-08-05 10:27:54,457 INFO L418 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:27:54,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:27:54,458 INFO L82 PathProgramCache]: Analyzing trace with hash -599624692, now seen corresponding path program 55 times [2019-08-05 10:27:54,458 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:27:54,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:27:54,483 WARN L254 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 114 conjunts are in the unsatisfiable core [2019-08-05 10:27:54,484 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:27:55,699 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:27:55,699 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:27:55,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-08-05 10:27:55,700 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-08-05 10:27:55,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-08-05 10:27:55,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 10:27:55,700 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 58 states. [2019-08-05 10:27:58,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:27:58,205 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-08-05 10:27:58,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-08-05 10:27:58,207 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 58 [2019-08-05 10:27:58,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:27:58,207 INFO L225 Difference]: With dead ends: 60 [2019-08-05 10:27:58,208 INFO L226 Difference]: Without dead ends: 60 [2019-08-05 10:27:58,208 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 10:27:58,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-05 10:27:58,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-08-05 10:27:58,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-08-05 10:27:58,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2019-08-05 10:27:58,210 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2019-08-05 10:27:58,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:27:58,211 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2019-08-05 10:27:58,211 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-08-05 10:27:58,211 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2019-08-05 10:27:58,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-08-05 10:27:58,211 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:27:58,211 INFO L399 BasicCegarLoop]: trace histogram [56, 1, 1, 1] [2019-08-05 10:27:58,212 INFO L418 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:27:58,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:27:58,212 INFO L82 PathProgramCache]: Analyzing trace with hash -1408494461, now seen corresponding path program 56 times [2019-08-05 10:27:58,212 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:27:58,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:27:58,238 WARN L254 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 116 conjunts are in the unsatisfiable core [2019-08-05 10:27:58,240 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:27:59,562 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:27:59,562 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:27:59,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2019-08-05 10:27:59,563 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-08-05 10:27:59,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-08-05 10:27:59,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:27:59,563 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 59 states. [2019-08-05 10:28:02,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:28:02,119 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-08-05 10:28:02,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-08-05 10:28:02,120 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 59 [2019-08-05 10:28:02,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:28:02,120 INFO L225 Difference]: With dead ends: 61 [2019-08-05 10:28:02,121 INFO L226 Difference]: Without dead ends: 61 [2019-08-05 10:28:02,121 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:28:02,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-08-05 10:28:02,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-08-05 10:28:02,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-08-05 10:28:02,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-08-05 10:28:02,124 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2019-08-05 10:28:02,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:28:02,124 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-08-05 10:28:02,124 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-08-05 10:28:02,125 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-08-05 10:28:02,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-08-05 10:28:02,125 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:28:02,125 INFO L399 BasicCegarLoop]: trace histogram [57, 1, 1, 1] [2019-08-05 10:28:02,125 INFO L418 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:28:02,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:28:02,126 INFO L82 PathProgramCache]: Analyzing trace with hash -713653524, now seen corresponding path program 57 times [2019-08-05 10:28:02,126 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:28:02,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:28:02,157 WARN L254 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 118 conjunts are in the unsatisfiable core [2019-08-05 10:28:02,159 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:28:03,500 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:28:03,500 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:28:03,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2019-08-05 10:28:03,501 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-08-05 10:28:03,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-08-05 10:28:03,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:28:03,501 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 60 states. [2019-08-05 10:28:05,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:28:05,987 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-08-05 10:28:05,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-08-05 10:28:05,988 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 60 [2019-08-05 10:28:05,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:28:05,989 INFO L225 Difference]: With dead ends: 62 [2019-08-05 10:28:05,989 INFO L226 Difference]: Without dead ends: 62 [2019-08-05 10:28:05,989 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:28:05,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-08-05 10:28:05,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-08-05 10:28:05,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-08-05 10:28:05,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2019-08-05 10:28:05,991 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2019-08-05 10:28:05,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:28:05,992 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2019-08-05 10:28:05,992 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-08-05 10:28:05,992 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-08-05 10:28:05,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 10:28:05,992 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:28:05,992 INFO L399 BasicCegarLoop]: trace histogram [58, 1, 1, 1] [2019-08-05 10:28:05,993 INFO L418 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:28:05,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:28:05,993 INFO L82 PathProgramCache]: Analyzing trace with hash -648420957, now seen corresponding path program 58 times [2019-08-05 10:28:05,994 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:28:06,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:28:06,022 WARN L254 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 120 conjunts are in the unsatisfiable core [2019-08-05 10:28:06,023 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:28:07,542 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:28:07,542 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:28:07,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2019-08-05 10:28:07,542 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-08-05 10:28:07,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-08-05 10:28:07,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 10:28:07,543 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 61 states. [2019-08-05 10:28:10,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:28:10,131 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-08-05 10:28:10,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-08-05 10:28:10,131 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 61 [2019-08-05 10:28:10,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:28:10,132 INFO L225 Difference]: With dead ends: 63 [2019-08-05 10:28:10,132 INFO L226 Difference]: Without dead ends: 63 [2019-08-05 10:28:10,132 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 10:28:10,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-05 10:28:10,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-08-05 10:28:10,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-08-05 10:28:10,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2019-08-05 10:28:10,134 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2019-08-05 10:28:10,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:28:10,135 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2019-08-05 10:28:10,135 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-08-05 10:28:10,135 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2019-08-05 10:28:10,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-08-05 10:28:10,135 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:28:10,136 INFO L399 BasicCegarLoop]: trace histogram [59, 1, 1, 1] [2019-08-05 10:28:10,136 INFO L418 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:28:10,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:28:10,136 INFO L82 PathProgramCache]: Analyzing trace with hash 1373788620, now seen corresponding path program 59 times [2019-08-05 10:28:10,137 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:28:10,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:28:10,159 WARN L254 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 122 conjunts are in the unsatisfiable core [2019-08-05 10:28:10,160 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:28:11,578 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:28:11,578 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:28:11,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2019-08-05 10:28:11,579 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-08-05 10:28:11,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-08-05 10:28:11,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 10:28:11,579 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 62 states. [2019-08-05 10:28:14,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:28:14,378 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2019-08-05 10:28:14,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-08-05 10:28:14,379 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 62 [2019-08-05 10:28:14,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:28:14,380 INFO L225 Difference]: With dead ends: 64 [2019-08-05 10:28:14,380 INFO L226 Difference]: Without dead ends: 64 [2019-08-05 10:28:14,380 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 10:28:14,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-08-05 10:28:14,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-08-05 10:28:14,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-08-05 10:28:14,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2019-08-05 10:28:14,383 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2019-08-05 10:28:14,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:28:14,383 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2019-08-05 10:28:14,383 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-08-05 10:28:14,383 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2019-08-05 10:28:14,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-08-05 10:28:14,383 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:28:14,384 INFO L399 BasicCegarLoop]: trace histogram [60, 1, 1, 1] [2019-08-05 10:28:14,384 INFO L418 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:28:14,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:28:14,384 INFO L82 PathProgramCache]: Analyzing trace with hash -362223933, now seen corresponding path program 60 times [2019-08-05 10:28:14,385 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:28:14,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:28:14,423 WARN L254 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 124 conjunts are in the unsatisfiable core [2019-08-05 10:28:14,424 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:28:15,831 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:28:15,831 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:28:15,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2019-08-05 10:28:15,832 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-08-05 10:28:15,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-08-05 10:28:15,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 10:28:15,832 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 63 states. [2019-08-05 10:28:18,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:28:18,710 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-08-05 10:28:18,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-08-05 10:28:18,710 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 63 [2019-08-05 10:28:18,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:28:18,711 INFO L225 Difference]: With dead ends: 65 [2019-08-05 10:28:18,711 INFO L226 Difference]: Without dead ends: 65 [2019-08-05 10:28:18,712 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 10:28:18,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-08-05 10:28:18,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-08-05 10:28:18,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-08-05 10:28:18,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-08-05 10:28:18,714 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2019-08-05 10:28:18,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:28:18,714 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-08-05 10:28:18,714 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-08-05 10:28:18,715 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-08-05 10:28:18,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-08-05 10:28:18,715 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:28:18,715 INFO L399 BasicCegarLoop]: trace histogram [61, 1, 1, 1] [2019-08-05 10:28:18,716 INFO L418 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:28:18,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:28:18,716 INFO L82 PathProgramCache]: Analyzing trace with hash 1655961772, now seen corresponding path program 61 times [2019-08-05 10:28:18,717 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:28:18,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:28:18,748 WARN L254 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 126 conjunts are in the unsatisfiable core [2019-08-05 10:28:18,749 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:28:20,185 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:28:20,185 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:28:20,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2019-08-05 10:28:20,186 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-08-05 10:28:20,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-08-05 10:28:20,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 10:28:20,186 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 64 states. [2019-08-05 10:28:23,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:28:23,131 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-08-05 10:28:23,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-08-05 10:28:23,131 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 64 [2019-08-05 10:28:23,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:28:23,132 INFO L225 Difference]: With dead ends: 66 [2019-08-05 10:28:23,132 INFO L226 Difference]: Without dead ends: 66 [2019-08-05 10:28:23,133 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 10:28:23,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-05 10:28:23,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-08-05 10:28:23,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-08-05 10:28:23,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2019-08-05 10:28:23,135 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2019-08-05 10:28:23,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:28:23,135 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2019-08-05 10:28:23,135 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-08-05 10:28:23,135 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-08-05 10:28:23,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-08-05 10:28:23,136 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:28:23,136 INFO L399 BasicCegarLoop]: trace histogram [62, 1, 1, 1] [2019-08-05 10:28:23,136 INFO L418 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:28:23,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:28:23,137 INFO L82 PathProgramCache]: Analyzing trace with hash -204790813, now seen corresponding path program 62 times [2019-08-05 10:28:23,138 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:28:23,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:28:23,172 WARN L254 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 128 conjunts are in the unsatisfiable core [2019-08-05 10:28:23,173 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:28:25,035 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:28:25,036 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:28:25,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2019-08-05 10:28:25,036 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-08-05 10:28:25,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-08-05 10:28:25,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 10:28:25,037 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 65 states. [2019-08-05 10:28:28,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:28:28,119 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2019-08-05 10:28:28,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-08-05 10:28:28,119 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 65 [2019-08-05 10:28:28,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:28:28,120 INFO L225 Difference]: With dead ends: 67 [2019-08-05 10:28:28,120 INFO L226 Difference]: Without dead ends: 67 [2019-08-05 10:28:28,121 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 10:28:28,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-08-05 10:28:28,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-08-05 10:28:28,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-08-05 10:28:28,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-08-05 10:28:28,123 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2019-08-05 10:28:28,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:28:28,123 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2019-08-05 10:28:28,123 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-08-05 10:28:28,123 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-08-05 10:28:28,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-08-05 10:28:28,124 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:28:28,124 INFO L399 BasicCegarLoop]: trace histogram [63, 1, 1, 1] [2019-08-05 10:28:28,124 INFO L418 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:28:28,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:28:28,125 INFO L82 PathProgramCache]: Analyzing trace with hash -2053546100, now seen corresponding path program 63 times [2019-08-05 10:28:28,125 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:28:28,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:28:28,155 WARN L254 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 130 conjunts are in the unsatisfiable core [2019-08-05 10:28:28,157 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:28:29,695 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:28:29,696 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:28:29,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2019-08-05 10:28:29,696 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-08-05 10:28:29,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-08-05 10:28:29,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 10:28:29,697 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 66 states. [2019-08-05 10:28:32,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:28:32,841 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-08-05 10:28:32,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-08-05 10:28:32,842 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 66 [2019-08-05 10:28:32,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:28:32,843 INFO L225 Difference]: With dead ends: 68 [2019-08-05 10:28:32,843 INFO L226 Difference]: Without dead ends: 68 [2019-08-05 10:28:32,843 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 10:28:32,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-08-05 10:28:32,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-08-05 10:28:32,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-08-05 10:28:32,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2019-08-05 10:28:32,846 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2019-08-05 10:28:32,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:28:32,846 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2019-08-05 10:28:32,846 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-08-05 10:28:32,847 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2019-08-05 10:28:32,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-08-05 10:28:32,847 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:28:32,847 INFO L399 BasicCegarLoop]: trace histogram [64, 1, 1, 1] [2019-08-05 10:28:32,847 INFO L418 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:28:32,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:28:32,848 INFO L82 PathProgramCache]: Analyzing trace with hash 764582147, now seen corresponding path program 64 times [2019-08-05 10:28:32,848 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:28:32,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:28:32,873 WARN L254 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 132 conjunts are in the unsatisfiable core [2019-08-05 10:28:32,874 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:28:34,528 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:28:34,528 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:28:34,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2019-08-05 10:28:34,528 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-08-05 10:28:34,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-08-05 10:28:34,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:28:34,529 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 67 states. [2019-08-05 10:28:37,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:28:37,822 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2019-08-05 10:28:37,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-08-05 10:28:37,822 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 67 [2019-08-05 10:28:37,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:28:37,823 INFO L225 Difference]: With dead ends: 69 [2019-08-05 10:28:37,823 INFO L226 Difference]: Without dead ends: 69 [2019-08-05 10:28:37,823 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:28:37,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-05 10:28:37,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-08-05 10:28:37,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-05 10:28:37,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2019-08-05 10:28:37,826 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2019-08-05 10:28:37,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:28:37,826 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2019-08-05 10:28:37,826 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-08-05 10:28:37,826 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2019-08-05 10:28:37,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 10:28:37,827 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:28:37,827 INFO L399 BasicCegarLoop]: trace histogram [65, 1, 1, 1] [2019-08-05 10:28:37,827 INFO L418 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:28:37,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:28:37,827 INFO L82 PathProgramCache]: Analyzing trace with hash -2067755412, now seen corresponding path program 65 times [2019-08-05 10:28:37,828 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:28:37,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:28:37,854 WARN L254 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 134 conjunts are in the unsatisfiable core [2019-08-05 10:28:37,855 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:28:39,497 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:28:39,497 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:28:39,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2019-08-05 10:28:39,497 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-08-05 10:28:39,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-08-05 10:28:39,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:28:39,498 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 68 states. [2019-08-05 10:28:42,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:28:42,990 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-08-05 10:28:42,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-08-05 10:28:42,991 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 68 [2019-08-05 10:28:42,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:28:42,992 INFO L225 Difference]: With dead ends: 70 [2019-08-05 10:28:42,992 INFO L226 Difference]: Without dead ends: 70 [2019-08-05 10:28:42,992 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:28:42,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-08-05 10:28:42,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-08-05 10:28:42,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-08-05 10:28:42,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2019-08-05 10:28:42,994 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2019-08-05 10:28:42,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:28:42,995 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2019-08-05 10:28:42,995 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-08-05 10:28:42,995 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2019-08-05 10:28:42,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-08-05 10:28:42,995 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:28:42,995 INFO L399 BasicCegarLoop]: trace histogram [66, 1, 1, 1] [2019-08-05 10:28:42,996 INFO L418 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:28:42,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:28:42,996 INFO L82 PathProgramCache]: Analyzing trace with hash 324093475, now seen corresponding path program 66 times [2019-08-05 10:28:42,996 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:28:43,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:28:43,044 WARN L254 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 136 conjunts are in the unsatisfiable core [2019-08-05 10:28:43,046 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:28:44,700 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:28:44,700 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:28:44,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2019-08-05 10:28:44,701 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-08-05 10:28:44,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-08-05 10:28:44,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 10:28:44,701 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 69 states. [2019-08-05 10:28:48,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:28:48,248 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2019-08-05 10:28:48,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-08-05 10:28:48,248 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 69 [2019-08-05 10:28:48,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:28:48,249 INFO L225 Difference]: With dead ends: 71 [2019-08-05 10:28:48,250 INFO L226 Difference]: Without dead ends: 71 [2019-08-05 10:28:48,250 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 10:28:48,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-08-05 10:28:48,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-08-05 10:28:48,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-08-05 10:28:48,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2019-08-05 10:28:48,253 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2019-08-05 10:28:48,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:28:48,253 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2019-08-05 10:28:48,253 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-08-05 10:28:48,253 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-08-05 10:28:48,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-08-05 10:28:48,253 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:28:48,253 INFO L399 BasicCegarLoop]: trace histogram [67, 1, 1, 1] [2019-08-05 10:28:48,254 INFO L418 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:28:48,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:28:48,254 INFO L82 PathProgramCache]: Analyzing trace with hash 1456964940, now seen corresponding path program 67 times [2019-08-05 10:28:48,254 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:28:48,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:28:48,282 WARN L254 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 138 conjunts are in the unsatisfiable core [2019-08-05 10:28:48,284 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:28:49,993 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:28:49,993 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:28:49,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2019-08-05 10:28:49,994 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-08-05 10:28:49,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-08-05 10:28:49,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 10:28:49,994 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 70 states. [2019-08-05 10:28:53,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:28:53,559 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2019-08-05 10:28:53,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-08-05 10:28:53,560 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 70 [2019-08-05 10:28:53,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:28:53,561 INFO L225 Difference]: With dead ends: 72 [2019-08-05 10:28:53,561 INFO L226 Difference]: Without dead ends: 72 [2019-08-05 10:28:53,561 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 10:28:53,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-08-05 10:28:53,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-08-05 10:28:53,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-08-05 10:28:53,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2019-08-05 10:28:53,564 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2019-08-05 10:28:53,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:28:53,564 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2019-08-05 10:28:53,564 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-08-05 10:28:53,565 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2019-08-05 10:28:53,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-08-05 10:28:53,565 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:28:53,565 INFO L399 BasicCegarLoop]: trace histogram [68, 1, 1, 1] [2019-08-05 10:28:53,565 INFO L418 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:28:53,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:28:53,566 INFO L82 PathProgramCache]: Analyzing trace with hash -2078725309, now seen corresponding path program 68 times [2019-08-05 10:28:53,566 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:28:53,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:28:53,605 WARN L254 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 140 conjunts are in the unsatisfiable core [2019-08-05 10:28:53,607 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:28:55,625 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:28:55,625 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:28:55,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2019-08-05 10:28:55,626 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-08-05 10:28:55,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-08-05 10:28:55,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 10:28:55,626 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 71 states. [2019-08-05 10:28:59,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:28:59,299 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2019-08-05 10:28:59,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-08-05 10:28:59,300 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 71 [2019-08-05 10:28:59,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:28:59,301 INFO L225 Difference]: With dead ends: 73 [2019-08-05 10:28:59,301 INFO L226 Difference]: Without dead ends: 73 [2019-08-05 10:28:59,302 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 10:28:59,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-08-05 10:28:59,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-08-05 10:28:59,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-08-05 10:28:59,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-08-05 10:28:59,304 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2019-08-05 10:28:59,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:28:59,304 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2019-08-05 10:28:59,304 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-08-05 10:28:59,304 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-08-05 10:28:59,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-08-05 10:28:59,305 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:28:59,305 INFO L399 BasicCegarLoop]: trace histogram [69, 1, 1, 1] [2019-08-05 10:28:59,305 INFO L418 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:28:59,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:28:59,306 INFO L82 PathProgramCache]: Analyzing trace with hash -15973332, now seen corresponding path program 69 times [2019-08-05 10:28:59,306 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:28:59,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:28:59,352 WARN L254 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 142 conjunts are in the unsatisfiable core [2019-08-05 10:28:59,355 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:29:01,240 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:29:01,241 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:29:01,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2019-08-05 10:29:01,241 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-08-05 10:29:01,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-08-05 10:29:01,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 10:29:01,242 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 72 states. [2019-08-05 10:29:05,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:29:05,009 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-08-05 10:29:05,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-08-05 10:29:05,017 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 72 [2019-08-05 10:29:05,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:29:05,018 INFO L225 Difference]: With dead ends: 74 [2019-08-05 10:29:05,018 INFO L226 Difference]: Without dead ends: 74 [2019-08-05 10:29:05,019 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 10:29:05,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-08-05 10:29:05,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-08-05 10:29:05,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-08-05 10:29:05,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2019-08-05 10:29:05,020 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2019-08-05 10:29:05,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:29:05,021 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2019-08-05 10:29:05,021 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-08-05 10:29:05,021 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2019-08-05 10:29:05,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-08-05 10:29:05,021 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:29:05,022 INFO L399 BasicCegarLoop]: trace histogram [70, 1, 1, 1] [2019-08-05 10:29:05,022 INFO L418 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:29:05,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:29:05,022 INFO L82 PathProgramCache]: Analyzing trace with hash -495171485, now seen corresponding path program 70 times [2019-08-05 10:29:05,023 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:29:05,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:29:05,075 WARN L254 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 144 conjunts are in the unsatisfiable core [2019-08-05 10:29:05,076 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:29:07,115 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:29:07,116 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:29:07,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2019-08-05 10:29:07,116 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-08-05 10:29:07,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-08-05 10:29:07,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 10:29:07,117 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 73 states. [2019-08-05 10:29:10,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:29:10,981 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-08-05 10:29:10,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-08-05 10:29:10,981 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 73 [2019-08-05 10:29:10,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:29:10,982 INFO L225 Difference]: With dead ends: 75 [2019-08-05 10:29:10,982 INFO L226 Difference]: Without dead ends: 75 [2019-08-05 10:29:10,983 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 10:29:10,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-08-05 10:29:10,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-08-05 10:29:10,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-05 10:29:10,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2019-08-05 10:29:10,985 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2019-08-05 10:29:10,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:29:10,985 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2019-08-05 10:29:10,986 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-08-05 10:29:10,986 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2019-08-05 10:29:10,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-08-05 10:29:10,986 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:29:10,986 INFO L399 BasicCegarLoop]: trace histogram [71, 1, 1, 1] [2019-08-05 10:29:10,986 INFO L418 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:29:10,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:29:10,987 INFO L82 PathProgramCache]: Analyzing trace with hash 1829554956, now seen corresponding path program 71 times [2019-08-05 10:29:10,987 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:29:11,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:29:11,032 WARN L254 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 146 conjunts are in the unsatisfiable core [2019-08-05 10:29:11,033 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:29:13,474 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:29:13,474 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:29:13,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2019-08-05 10:29:13,474 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-08-05 10:29:13,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-08-05 10:29:13,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 10:29:13,475 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 74 states. [2019-08-05 10:29:17,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:29:17,312 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2019-08-05 10:29:17,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-08-05 10:29:17,313 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 74 [2019-08-05 10:29:17,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:29:17,314 INFO L225 Difference]: With dead ends: 76 [2019-08-05 10:29:17,314 INFO L226 Difference]: Without dead ends: 76 [2019-08-05 10:29:17,315 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 10:29:17,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-08-05 10:29:17,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-08-05 10:29:17,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-08-05 10:29:17,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2019-08-05 10:29:17,317 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2019-08-05 10:29:17,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:29:17,318 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2019-08-05 10:29:17,318 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-08-05 10:29:17,318 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2019-08-05 10:29:17,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-08-05 10:29:17,318 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:29:17,318 INFO L399 BasicCegarLoop]: trace histogram [72, 1, 1, 1] [2019-08-05 10:29:17,319 INFO L418 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:29:17,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:29:17,319 INFO L82 PathProgramCache]: Analyzing trace with hash 881630595, now seen corresponding path program 72 times [2019-08-05 10:29:17,320 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:29:17,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:29:17,367 WARN L254 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 148 conjunts are in the unsatisfiable core [2019-08-05 10:29:17,369 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:29:19,738 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:29:19,738 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:29:19,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2019-08-05 10:29:19,739 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-08-05 10:29:19,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-08-05 10:29:19,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 10:29:19,739 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 75 states. [2019-08-05 10:29:23,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:29:23,910 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2019-08-05 10:29:23,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-08-05 10:29:23,910 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 75 [2019-08-05 10:29:23,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:29:23,911 INFO L225 Difference]: With dead ends: 77 [2019-08-05 10:29:23,911 INFO L226 Difference]: Without dead ends: 77 [2019-08-05 10:29:23,912 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 10:29:23,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-08-05 10:29:23,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-08-05 10:29:23,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-05 10:29:23,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-08-05 10:29:23,914 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2019-08-05 10:29:23,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:29:23,914 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-08-05 10:29:23,914 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-08-05 10:29:23,914 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-08-05 10:29:23,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-08-05 10:29:23,915 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:29:23,915 INFO L399 BasicCegarLoop]: trace histogram [73, 1, 1, 1] [2019-08-05 10:29:23,915 INFO L418 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:29:23,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:29:23,915 INFO L82 PathProgramCache]: Analyzing trace with hash 1560746476, now seen corresponding path program 73 times [2019-08-05 10:29:23,916 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:29:23,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:29:23,948 WARN L254 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 150 conjunts are in the unsatisfiable core [2019-08-05 10:29:23,949 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:29:25,972 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:29:25,972 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:29:25,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2019-08-05 10:29:25,972 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-08-05 10:29:25,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-08-05 10:29:25,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 10:29:25,973 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 76 states. [2019-08-05 10:29:30,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:29:30,179 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2019-08-05 10:29:30,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-08-05 10:29:30,180 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 76 [2019-08-05 10:29:30,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:29:30,181 INFO L225 Difference]: With dead ends: 78 [2019-08-05 10:29:30,181 INFO L226 Difference]: Without dead ends: 78 [2019-08-05 10:29:30,181 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 10:29:30,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-08-05 10:29:30,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-08-05 10:29:30,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-08-05 10:29:30,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2019-08-05 10:29:30,184 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2019-08-05 10:29:30,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:29:30,185 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2019-08-05 10:29:30,185 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-08-05 10:29:30,185 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2019-08-05 10:29:30,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 10:29:30,185 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:29:30,185 INFO L399 BasicCegarLoop]: trace histogram [74, 1, 1, 1] [2019-08-05 10:29:30,186 INFO L418 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:29:30,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:29:30,186 INFO L82 PathProgramCache]: Analyzing trace with hash 1138502307, now seen corresponding path program 74 times [2019-08-05 10:29:30,187 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:29:30,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:29:30,239 WARN L254 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 152 conjunts are in the unsatisfiable core [2019-08-05 10:29:30,241 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:29:32,639 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:29:32,639 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:29:32,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2019-08-05 10:29:32,640 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-08-05 10:29:32,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-08-05 10:29:32,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 10:29:32,640 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 77 states. [2019-08-05 10:29:36,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:29:36,965 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2019-08-05 10:29:36,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-08-05 10:29:36,966 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 77 [2019-08-05 10:29:36,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:29:36,967 INFO L225 Difference]: With dead ends: 79 [2019-08-05 10:29:36,967 INFO L226 Difference]: Without dead ends: 79 [2019-08-05 10:29:36,967 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 10:29:36,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-08-05 10:29:36,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-08-05 10:29:36,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-08-05 10:29:36,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2019-08-05 10:29:36,970 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77 [2019-08-05 10:29:36,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:29:36,970 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2019-08-05 10:29:36,970 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-08-05 10:29:36,970 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2019-08-05 10:29:36,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-08-05 10:29:36,971 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:29:36,971 INFO L399 BasicCegarLoop]: trace histogram [75, 1, 1, 1] [2019-08-05 10:29:36,971 INFO L418 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:29:36,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:29:36,971 INFO L82 PathProgramCache]: Analyzing trace with hash 933834956, now seen corresponding path program 75 times [2019-08-05 10:29:36,972 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:29:37,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:29:37,010 WARN L254 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 154 conjunts are in the unsatisfiable core [2019-08-05 10:29:37,011 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:29:39,423 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:29:39,423 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:29:39,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2019-08-05 10:29:39,424 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-08-05 10:29:39,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-08-05 10:29:39,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 10:29:39,424 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 78 states. [2019-08-05 10:29:43,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:29:43,624 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2019-08-05 10:29:43,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-08-05 10:29:43,625 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 78 [2019-08-05 10:29:43,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:29:43,625 INFO L225 Difference]: With dead ends: 80 [2019-08-05 10:29:43,625 INFO L226 Difference]: Without dead ends: 80 [2019-08-05 10:29:43,626 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 10:29:43,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-08-05 10:29:43,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-08-05 10:29:43,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-08-05 10:29:43,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2019-08-05 10:29:43,628 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 78 [2019-08-05 10:29:43,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:29:43,628 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2019-08-05 10:29:43,628 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-08-05 10:29:43,628 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2019-08-05 10:29:43,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-08-05 10:29:43,629 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:29:43,629 INFO L399 BasicCegarLoop]: trace histogram [76, 1, 1, 1] [2019-08-05 10:29:43,629 INFO L418 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:29:43,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:29:43,629 INFO L82 PathProgramCache]: Analyzing trace with hash -1115885629, now seen corresponding path program 76 times [2019-08-05 10:29:43,630 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:29:43,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:29:43,673 WARN L254 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 156 conjunts are in the unsatisfiable core [2019-08-05 10:29:43,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:29:46,170 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:29:46,170 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:29:46,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2019-08-05 10:29:46,171 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-08-05 10:29:46,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-08-05 10:29:46,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 10:29:46,171 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 79 states. [2019-08-05 10:29:50,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:29:50,440 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2019-08-05 10:29:50,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-08-05 10:29:50,440 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 79 [2019-08-05 10:29:50,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:29:50,441 INFO L225 Difference]: With dead ends: 81 [2019-08-05 10:29:50,441 INFO L226 Difference]: Without dead ends: 81 [2019-08-05 10:29:50,441 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 10:29:50,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-08-05 10:29:50,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-08-05 10:29:50,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-08-05 10:29:50,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-08-05 10:29:50,444 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 79 [2019-08-05 10:29:50,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:29:50,444 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2019-08-05 10:29:50,445 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-08-05 10:29:50,445 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-08-05 10:29:50,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-08-05 10:29:50,445 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:29:50,445 INFO L399 BasicCegarLoop]: trace histogram [77, 1, 1, 1] [2019-08-05 10:29:50,445 INFO L418 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:29:50,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:29:50,446 INFO L82 PathProgramCache]: Analyzing trace with hash -232714324, now seen corresponding path program 77 times [2019-08-05 10:29:50,446 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:29:50,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:29:50,488 WARN L254 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 158 conjunts are in the unsatisfiable core [2019-08-05 10:29:50,490 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:29:52,777 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:29:52,778 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:29:52,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2019-08-05 10:29:52,778 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-08-05 10:29:52,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-08-05 10:29:52,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=6163, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 10:29:52,779 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 80 states. [2019-08-05 10:29:57,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:29:57,765 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2019-08-05 10:29:57,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-08-05 10:29:57,766 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 80 [2019-08-05 10:29:57,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:29:57,767 INFO L225 Difference]: With dead ends: 82 [2019-08-05 10:29:57,767 INFO L226 Difference]: Without dead ends: 82 [2019-08-05 10:29:57,767 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=157, Invalid=6163, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 10:29:57,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-08-05 10:29:57,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2019-08-05 10:29:57,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-08-05 10:29:57,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2019-08-05 10:29:57,770 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 80 [2019-08-05 10:29:57,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:29:57,770 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2019-08-05 10:29:57,770 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-08-05 10:29:57,770 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2019-08-05 10:29:57,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-08-05 10:29:57,771 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:29:57,771 INFO L399 BasicCegarLoop]: trace histogram [78, 1, 1, 1] [2019-08-05 10:29:57,771 INFO L418 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:29:57,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:29:57,771 INFO L82 PathProgramCache]: Analyzing trace with hash 1375792355, now seen corresponding path program 78 times [2019-08-05 10:29:57,772 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:29:57,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:29:57,814 WARN L254 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 160 conjunts are in the unsatisfiable core [2019-08-05 10:29:57,816 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:30:00,457 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:30:00,457 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:30:00,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2019-08-05 10:30:00,458 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-08-05 10:30:00,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-08-05 10:30:00,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=6321, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 10:30:00,458 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 81 states. [2019-08-05 10:30:05,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:30:05,225 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2019-08-05 10:30:05,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-08-05 10:30:05,225 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 81 [2019-08-05 10:30:05,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:30:05,226 INFO L225 Difference]: With dead ends: 83 [2019-08-05 10:30:05,226 INFO L226 Difference]: Without dead ends: 83 [2019-08-05 10:30:05,227 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=159, Invalid=6321, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 10:30:05,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-08-05 10:30:05,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-08-05 10:30:05,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-08-05 10:30:05,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2019-08-05 10:30:05,230 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 81 [2019-08-05 10:30:05,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:30:05,230 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2019-08-05 10:30:05,230 INFO L476 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-08-05 10:30:05,230 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2019-08-05 10:30:05,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-08-05 10:30:05,231 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:30:05,231 INFO L399 BasicCegarLoop]: trace histogram [79, 1, 1, 1] [2019-08-05 10:30:05,231 INFO L418 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:30:05,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:30:05,232 INFO L82 PathProgramCache]: Analyzing trace with hash -300108148, now seen corresponding path program 79 times [2019-08-05 10:30:05,232 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:30:05,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:30:05,271 WARN L254 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 162 conjunts are in the unsatisfiable core [2019-08-05 10:30:05,273 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:30:07,694 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:30:07,695 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:30:07,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2019-08-05 10:30:07,695 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-08-05 10:30:07,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-08-05 10:30:07,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=6481, Unknown=0, NotChecked=0, Total=6642 [2019-08-05 10:30:07,696 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 82 states. [2019-08-05 10:30:12,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:30:12,629 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2019-08-05 10:30:12,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-08-05 10:30:12,629 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 82 [2019-08-05 10:30:12,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:30:12,630 INFO L225 Difference]: With dead ends: 84 [2019-08-05 10:30:12,630 INFO L226 Difference]: Without dead ends: 84 [2019-08-05 10:30:12,631 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=161, Invalid=6481, Unknown=0, NotChecked=0, Total=6642 [2019-08-05 10:30:12,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-08-05 10:30:12,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2019-08-05 10:30:12,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-08-05 10:30:12,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2019-08-05 10:30:12,633 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 82 [2019-08-05 10:30:12,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:30:12,633 INFO L475 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2019-08-05 10:30:12,633 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-08-05 10:30:12,633 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2019-08-05 10:30:12,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-08-05 10:30:12,634 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:30:12,634 INFO L399 BasicCegarLoop]: trace histogram [80, 1, 1, 1] [2019-08-05 10:30:12,634 INFO L418 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:30:12,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:30:12,635 INFO L82 PathProgramCache]: Analyzing trace with hash -713416189, now seen corresponding path program 80 times [2019-08-05 10:30:12,635 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:30:12,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:30:12,673 WARN L254 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 164 conjunts are in the unsatisfiable core [2019-08-05 10:30:12,675 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:30:16,380 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:30:16,380 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:30:16,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2019-08-05 10:30:16,381 INFO L454 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-08-05 10:30:16,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-08-05 10:30:16,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=6643, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 10:30:16,381 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 83 states. [2019-08-05 10:30:21,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:30:21,420 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2019-08-05 10:30:21,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-08-05 10:30:21,420 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 83 [2019-08-05 10:30:21,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:30:21,421 INFO L225 Difference]: With dead ends: 85 [2019-08-05 10:30:21,421 INFO L226 Difference]: Without dead ends: 85 [2019-08-05 10:30:21,422 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=163, Invalid=6643, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 10:30:21,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-08-05 10:30:21,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-08-05 10:30:21,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-08-05 10:30:21,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2019-08-05 10:30:21,424 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 83 [2019-08-05 10:30:21,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:30:21,424 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2019-08-05 10:30:21,424 INFO L476 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-08-05 10:30:21,425 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2019-08-05 10:30:21,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-08-05 10:30:21,425 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:30:21,425 INFO L399 BasicCegarLoop]: trace histogram [81, 1, 1, 1] [2019-08-05 10:30:21,425 INFO L418 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:30:21,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:30:21,426 INFO L82 PathProgramCache]: Analyzing trace with hash -641063572, now seen corresponding path program 81 times [2019-08-05 10:30:21,426 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:30:21,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:30:21,493 WARN L254 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 166 conjunts are in the unsatisfiable core [2019-08-05 10:30:21,495 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:30:24,029 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:30:24,029 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:30:24,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2019-08-05 10:30:24,029 INFO L454 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-08-05 10:30:24,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-08-05 10:30:24,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=6807, Unknown=0, NotChecked=0, Total=6972 [2019-08-05 10:30:24,030 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 84 states. [2019-08-05 10:30:29,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:30:29,290 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2019-08-05 10:30:29,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-08-05 10:30:29,291 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 84 [2019-08-05 10:30:29,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:30:29,291 INFO L225 Difference]: With dead ends: 86 [2019-08-05 10:30:29,291 INFO L226 Difference]: Without dead ends: 86 [2019-08-05 10:30:29,292 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=165, Invalid=6807, Unknown=0, NotChecked=0, Total=6972 [2019-08-05 10:30:29,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-08-05 10:30:29,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2019-08-05 10:30:29,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-08-05 10:30:29,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2019-08-05 10:30:29,295 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 84 [2019-08-05 10:30:29,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:30:29,295 INFO L475 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2019-08-05 10:30:29,295 INFO L476 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-08-05 10:30:29,295 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2019-08-05 10:30:29,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 10:30:29,296 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:30:29,296 INFO L399 BasicCegarLoop]: trace histogram [82, 1, 1, 1] [2019-08-05 10:30:29,296 INFO L418 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:30:29,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:30:29,297 INFO L82 PathProgramCache]: Analyzing trace with hash 1601867555, now seen corresponding path program 82 times [2019-08-05 10:30:29,297 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:30:29,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:30:29,360 WARN L254 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 168 conjunts are in the unsatisfiable core [2019-08-05 10:30:29,361 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:30:33,264 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:30:33,264 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:30:33,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2019-08-05 10:30:33,265 INFO L454 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-08-05 10:30:33,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-08-05 10:30:33,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=6973, Unknown=0, NotChecked=0, Total=7140 [2019-08-05 10:30:33,265 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 85 states. [2019-08-05 10:30:38,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:30:38,752 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2019-08-05 10:30:38,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-08-05 10:30:38,753 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 85 [2019-08-05 10:30:38,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:30:38,753 INFO L225 Difference]: With dead ends: 87 [2019-08-05 10:30:38,754 INFO L226 Difference]: Without dead ends: 87 [2019-08-05 10:30:38,754 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=167, Invalid=6973, Unknown=0, NotChecked=0, Total=7140 [2019-08-05 10:30:38,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-08-05 10:30:38,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-08-05 10:30:38,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-08-05 10:30:38,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2019-08-05 10:30:38,756 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 85 [2019-08-05 10:30:38,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:30:38,757 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2019-08-05 10:30:38,757 INFO L476 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-08-05 10:30:38,757 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2019-08-05 10:30:38,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-08-05 10:30:38,758 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:30:38,758 INFO L399 BasicCegarLoop]: trace histogram [83, 1, 1, 1] [2019-08-05 10:30:38,758 INFO L418 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:30:38,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:30:38,759 INFO L82 PathProgramCache]: Analyzing trace with hash -1881711540, now seen corresponding path program 83 times [2019-08-05 10:30:38,759 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:30:38,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:30:38,803 WARN L254 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 170 conjunts are in the unsatisfiable core [2019-08-05 10:30:38,805 INFO L279 TraceCheckSpWp]: Computing forward predicates... Received shutdown request... [2019-08-05 10:30:40,190 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2019-08-05 10:30:40,190 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-05 10:30:40,194 WARN L223 ceAbstractionStarter]: Timeout [2019-08-05 10:30:40,194 INFO L202 PluginConnector]: Adding new model simple_false-unreach-call1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:30:40 BoogieIcfgContainer [2019-08-05 10:30:40,194 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:30:40,196 INFO L168 Benchmark]: Toolchain (without parser) took 249567.65 ms. Allocated memory was 139.5 MB in the beginning and 188.2 MB in the end (delta: 48.8 MB). Free memory was 106.4 MB in the beginning and 67.9 MB in the end (delta: 38.6 MB). Peak memory consumption was 87.3 MB. Max. memory is 7.1 GB. [2019-08-05 10:30:40,196 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 139.5 MB. Free memory was 107.9 MB in the beginning and 107.7 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-08-05 10:30:40,197 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.34 ms. Allocated memory is still 139.5 MB. Free memory was 106.4 MB in the beginning and 104.7 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2019-08-05 10:30:40,198 INFO L168 Benchmark]: Boogie Preprocessor took 38.54 ms. Allocated memory is still 139.5 MB. Free memory was 104.7 MB in the beginning and 103.7 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-08-05 10:30:40,198 INFO L168 Benchmark]: RCFGBuilder took 329.63 ms. Allocated memory is still 139.5 MB. Free memory was 103.5 MB in the beginning and 94.0 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. [2019-08-05 10:30:40,199 INFO L168 Benchmark]: TraceAbstraction took 249158.29 ms. Allocated memory was 139.5 MB in the beginning and 188.2 MB in the end (delta: 48.8 MB). Free memory was 93.8 MB in the beginning and 67.9 MB in the end (delta: 25.9 MB). Peak memory consumption was 74.7 MB. Max. memory is 7.1 GB. [2019-08-05 10:30:40,202 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.20 ms. Allocated memory is still 139.5 MB. Free memory was 107.9 MB in the beginning and 107.7 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 33.34 ms. Allocated memory is still 139.5 MB. Free memory was 106.4 MB in the beginning and 104.7 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.54 ms. Allocated memory is still 139.5 MB. Free memory was 104.7 MB in the beginning and 103.7 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 329.63 ms. Allocated memory is still 139.5 MB. Free memory was 103.5 MB in the beginning and 94.0 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 249158.29 ms. Allocated memory was 139.5 MB in the beginning and 188.2 MB in the end (delta: 48.8 MB). Free memory was 93.8 MB in the beginning and 67.9 MB in the end (delta: 25.9 MB). Peak memory consumption was 74.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 31]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 31). Cancelled while BasicCegarLoop was analyzing trace of length 87 with TraceHistMax 83,while TraceCheckSpWp was constructing forward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 57 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 5 locations, 1 error locations. TIMEOUT Result, 249.1s OverallTime, 84 OverallIterations, 83 TraceHistogramMax, 152.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 249 SDtfs, 0 SDslu, 3486 SDs, 0 SdLazy, 201026 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 125.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3569 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 3486 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 91.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=87occurred in iteration=83, 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, 83 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 92.6s InterpolantComputationTime, 3652 NumberOfCodeBlocks, 3652 NumberOfCodeBlocksAsserted, 83 NumberOfCheckSat, 3569 ConstructedInterpolants, 0 QuantifiedInterpolants, 596189 SizeOfPredicates, 83 NumberOfNonLiveVariables, 11288 ConjunctsInSsa, 7138 ConjunctsInUnsatCore, 83 InterpolantComputations, 1 PerfectInterpolantSequences, 0/95284 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown