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/20170304-DifficultPathPrograms/hhk2008.c.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:25:52,559 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:25:52,561 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:25:52,573 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:25:52,573 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:25:52,574 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:25:52,576 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:25:52,578 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:25:52,579 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:25:52,580 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:25:52,581 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:25:52,581 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:25:52,582 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:25:52,583 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:25:52,584 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:25:52,585 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:25:52,586 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:25:52,587 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:25:52,589 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:25:52,591 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:25:52,592 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:25:52,594 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:25:52,595 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:25:52,596 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:25:52,598 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:25:52,598 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:25:52,599 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:25:52,600 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:25:52,600 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:25:52,601 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:25:52,601 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:25:52,602 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:25:52,603 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:25:52,604 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:25:52,605 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:25:52,605 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:25:52,606 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:25:52,606 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:25:52,606 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:25:52,607 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:25:52,608 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:25:52,635 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:25:52,647 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:25:52,651 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:25:52,652 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:25:52,653 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:25:52,654 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/hhk2008.c.i_3.bpl [2019-08-05 10:25:52,654 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/hhk2008.c.i_3.bpl' [2019-08-05 10:25:52,690 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:25:52,691 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:25:52,692 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:25:52,692 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:25:52,692 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:25:52,708 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "hhk2008.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:25:52" (1/1) ... [2019-08-05 10:25:52,717 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "hhk2008.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:25:52" (1/1) ... [2019-08-05 10:25:52,724 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:25:52,725 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:25:52,725 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:25:52,725 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:25:52,736 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "hhk2008.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:25:52" (1/1) ... [2019-08-05 10:25:52,736 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "hhk2008.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:25:52" (1/1) ... [2019-08-05 10:25:52,737 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "hhk2008.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:25:52" (1/1) ... [2019-08-05 10:25:52,737 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "hhk2008.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:25:52" (1/1) ... [2019-08-05 10:25:52,741 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "hhk2008.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:25:52" (1/1) ... [2019-08-05 10:25:52,742 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "hhk2008.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:25:52" (1/1) ... [2019-08-05 10:25:52,743 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "hhk2008.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:25:52" (1/1) ... [2019-08-05 10:25:52,745 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:25:52,745 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:25:52,746 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:25:52,746 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:25:52,747 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "hhk2008.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:25:52" (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:25:52,816 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-05 10:25:52,816 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-05 10:25:53,073 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-05 10:25:53,073 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-08-05 10:25:53,075 INFO L202 PluginConnector]: Adding new model hhk2008.c.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:25:53 BoogieIcfgContainer [2019-08-05 10:25:53,076 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:25:53,077 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:25:53,077 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:25:53,083 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:25:53,083 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "hhk2008.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:25:52" (1/2) ... [2019-08-05 10:25:53,085 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ed2580 and model type hhk2008.c.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:25:53, skipping insertion in model container [2019-08-05 10:25:53,085 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "hhk2008.c.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:25:53" (2/2) ... [2019-08-05 10:25:53,090 INFO L109 eAbstractionObserver]: Analyzing ICFG hhk2008.c.i_3.bpl [2019-08-05 10:25:53,099 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:25:53,107 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 10:25:53,123 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 10:25:53,149 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:25:53,150 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:25:53,150 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:25:53,151 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:25:53,151 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:25:53,152 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:25:53,152 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:25:53,152 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:25:53,153 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:25:53,167 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2019-08-05 10:25:53,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 10:25:53,189 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:25:53,190 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 10:25:53,192 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:25:53,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:25:53,199 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2019-08-05 10:25:53,255 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:25:53,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:25:53,310 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:25:53,314 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:25:53,442 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:25:53,445 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:25:53,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:25:53,451 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:25:53,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:25:53,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:25:53,471 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2019-08-05 10:25:53,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:25:53,532 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-08-05 10:25:53,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:25:53,535 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-05 10:25:53,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:25:53,545 INFO L225 Difference]: With dead ends: 5 [2019-08-05 10:25:53,545 INFO L226 Difference]: Without dead ends: 5 [2019-08-05 10:25:53,547 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:25:53,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-08-05 10:25:53,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-08-05 10:25:53,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-08-05 10:25:53,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-08-05 10:25:53,581 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-08-05 10:25:53,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:25:53,582 INFO L475 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-08-05 10:25:53,582 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:25:53,582 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-08-05 10:25:53,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 10:25:53,583 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:25:53,583 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 10:25:53,583 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:25:53,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:25:53,584 INFO L82 PathProgramCache]: Analyzing trace with hash 930412, now seen corresponding path program 1 times [2019-08-05 10:25:53,585 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:25:53,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:25:53,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 10:25:53,619 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:25:53,735 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:25:53,736 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:25:53,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 10:25:53,738 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:25:53,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:25:53,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:25:53,739 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2019-08-05 10:25:53,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:25:53,783 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-08-05 10:25:53,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:25:53,784 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-08-05 10:25:53,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:25:53,785 INFO L225 Difference]: With dead ends: 6 [2019-08-05 10:25:53,785 INFO L226 Difference]: Without dead ends: 6 [2019-08-05 10:25:53,786 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:25:53,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-08-05 10:25:53,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-08-05 10:25:53,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-05 10:25:53,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-08-05 10:25:53,788 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-08-05 10:25:53,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:25:53,788 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-08-05 10:25:53,788 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:25:53,788 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-08-05 10:25:53,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 10:25:53,789 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:25:53,789 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-08-05 10:25:53,790 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:25:53,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:25:53,790 INFO L82 PathProgramCache]: Analyzing trace with hash 28844579, now seen corresponding path program 2 times [2019-08-05 10:25:53,791 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:25:53,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:25:53,811 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 10:25:53,812 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:25:53,931 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:25:53,932 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:25:53,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:25:53,932 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:25:53,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:25:53,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:25:53,933 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2019-08-05 10:25:54,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:25:54,009 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-08-05 10:25:54,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:25:54,010 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-08-05 10:25:54,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:25:54,010 INFO L225 Difference]: With dead ends: 7 [2019-08-05 10:25:54,010 INFO L226 Difference]: Without dead ends: 7 [2019-08-05 10:25:54,011 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:25:54,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-05 10:25:54,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-05 10:25:54,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 10:25:54,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-08-05 10:25:54,014 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-08-05 10:25:54,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:25:54,014 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-08-05 10:25:54,014 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:25:54,014 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-08-05 10:25:54,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:25:54,015 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:25:54,015 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-08-05 10:25:54,015 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:25:54,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:25:54,016 INFO L82 PathProgramCache]: Analyzing trace with hash 894183756, now seen corresponding path program 3 times [2019-08-05 10:25:54,017 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:25:54,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:25:54,038 WARN L254 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 10:25:54,039 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:25:54,267 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:25:54,267 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:25:54,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:25:54,268 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:25:54,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:25:54,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:25:54,269 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2019-08-05 10:25:54,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:25:54,482 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-05 10:25:54,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:25:54,483 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-08-05 10:25:54,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:25:54,484 INFO L225 Difference]: With dead ends: 8 [2019-08-05 10:25:54,484 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 10:25:54,484 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:25:54,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 10:25:54,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-05 10:25:54,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 10:25:54,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-08-05 10:25:54,487 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-08-05 10:25:54,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:25:54,487 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-08-05 10:25:54,487 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:25:54,487 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-08-05 10:25:54,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 10:25:54,488 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:25:54,488 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-08-05 10:25:54,488 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:25:54,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:25:54,489 INFO L82 PathProgramCache]: Analyzing trace with hash 1949894467, now seen corresponding path program 4 times [2019-08-05 10:25:54,490 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:25:54,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:25:54,511 WARN L254 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 10:25:54,512 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:25:54,705 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:25:54,705 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:25:54,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:25:54,706 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:25:54,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:25:54,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:25:54,707 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2019-08-05 10:25:54,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:25:54,887 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-08-05 10:25:54,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:25:54,888 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-08-05 10:25:54,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:25:54,888 INFO L225 Difference]: With dead ends: 9 [2019-08-05 10:25:54,888 INFO L226 Difference]: Without dead ends: 9 [2019-08-05 10:25:54,889 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:25:54,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-05 10:25:54,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-08-05 10:25:54,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 10:25:54,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-08-05 10:25:54,891 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-08-05 10:25:54,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:25:54,892 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-08-05 10:25:54,892 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:25:54,892 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-08-05 10:25:54,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:25:54,893 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:25:54,893 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2019-08-05 10:25:54,893 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:25:54,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:25:54,894 INFO L82 PathProgramCache]: Analyzing trace with hash 317188140, now seen corresponding path program 5 times [2019-08-05 10:25:54,895 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:25:54,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:25:54,939 WARN L254 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 10:25:54,943 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:25:55,146 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:25:55,146 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:25:55,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:25:55,147 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:25:55,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:25:55,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:25:55,148 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2019-08-05 10:25:55,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:25:55,229 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-08-05 10:25:55,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:25:55,229 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-08-05 10:25:55,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:25:55,231 INFO L225 Difference]: With dead ends: 10 [2019-08-05 10:25:55,232 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 10:25:55,233 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:25:55,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 10:25:55,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-08-05 10:25:55,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 10:25:55,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-08-05 10:25:55,235 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2019-08-05 10:25:55,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:25:55,235 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-08-05 10:25:55,235 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:25:55,236 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-08-05 10:25:55,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 10:25:55,237 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:25:55,237 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2019-08-05 10:25:55,237 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:25:55,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:25:55,238 INFO L82 PathProgramCache]: Analyzing trace with hash 1242899555, now seen corresponding path program 6 times [2019-08-05 10:25:55,239 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:25:55,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:25:55,259 WARN L254 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 33 conjunts are in the unsatisfiable core [2019-08-05 10:25:55,261 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:25:55,691 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:25:55,691 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:25:55,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:25:55,692 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:25:55,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:25:55,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:25:55,693 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2019-08-05 10:25:55,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:25:55,803 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-08-05 10:25:55,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:25:55,803 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-08-05 10:25:55,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:25:55,804 INFO L225 Difference]: With dead ends: 11 [2019-08-05 10:25:55,804 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 10:25:55,805 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:25:55,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 10:25:55,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-05 10:25:55,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 10:25:55,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-08-05 10:25:55,807 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2019-08-05 10:25:55,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:25:55,808 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-08-05 10:25:55,808 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:25:55,808 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-08-05 10:25:55,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 10:25:55,808 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:25:55,808 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2019-08-05 10:25:55,809 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:25:55,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:25:55,809 INFO L82 PathProgramCache]: Analyzing trace with hash -124817652, now seen corresponding path program 7 times [2019-08-05 10:25:55,810 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:25:55,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:25:55,829 WARN L254 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-05 10:25:55,831 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:25:56,011 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:25:56,011 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:25:56,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:25:56,012 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:25:56,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:25:56,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:25:56,013 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2019-08-05 10:25:56,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:25:56,116 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-08-05 10:25:56,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:25:56,117 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2019-08-05 10:25:56,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:25:56,118 INFO L225 Difference]: With dead ends: 12 [2019-08-05 10:25:56,119 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 10:25:56,119 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:25:56,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 10:25:56,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-08-05 10:25:56,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 10:25:56,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-08-05 10:25:56,121 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-08-05 10:25:56,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:25:56,122 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-08-05 10:25:56,122 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:25:56,122 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-08-05 10:25:56,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 10:25:56,122 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:25:56,123 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2019-08-05 10:25:56,123 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:25:56,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:25:56,123 INFO L82 PathProgramCache]: Analyzing trace with hash 425621891, now seen corresponding path program 8 times [2019-08-05 10:25:56,124 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:25:56,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:25:56,145 WARN L254 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 41 conjunts are in the unsatisfiable core [2019-08-05 10:25:56,147 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:25:56,430 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:25:56,431 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:25:56,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:25:56,432 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:25:56,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:25:56,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:25:56,433 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2019-08-05 10:25:56,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:25:56,573 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-08-05 10:25:56,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:25:56,574 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2019-08-05 10:25:56,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:25:56,575 INFO L225 Difference]: With dead ends: 13 [2019-08-05 10:25:56,575 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 10:25:56,575 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:25:56,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 10:25:56,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-08-05 10:25:56,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 10:25:56,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-08-05 10:25:56,579 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2019-08-05 10:25:56,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:25:56,579 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-08-05 10:25:56,579 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:25:56,579 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-08-05 10:25:56,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:25:56,580 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:25:56,580 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2019-08-05 10:25:56,580 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:25:56,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:25:56,581 INFO L82 PathProgramCache]: Analyzing trace with hash 309378540, now seen corresponding path program 9 times [2019-08-05 10:25:56,581 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:25:56,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:25:56,605 WARN L254 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 45 conjunts are in the unsatisfiable core [2019-08-05 10:25:56,606 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:25:56,845 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:25:56,845 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:25:56,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:25:56,846 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:25:56,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:25:56,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:25:56,846 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2019-08-05 10:25:56,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:25:56,948 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-08-05 10:25:56,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:25:56,949 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2019-08-05 10:25:56,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:25:56,950 INFO L225 Difference]: With dead ends: 14 [2019-08-05 10:25:56,950 INFO L226 Difference]: Without dead ends: 14 [2019-08-05 10:25:56,951 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:25:56,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-05 10:25:56,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-08-05 10:25:56,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-05 10:25:56,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-08-05 10:25:56,953 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2019-08-05 10:25:56,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:25:56,954 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-08-05 10:25:56,954 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:25:56,954 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-08-05 10:25:56,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 10:25:56,955 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:25:56,955 INFO L399 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2019-08-05 10:25:56,955 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:25:56,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:25:56,955 INFO L82 PathProgramCache]: Analyzing trace with hash 1000801955, now seen corresponding path program 10 times [2019-08-05 10:25:56,956 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:25:56,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:25:56,977 WARN L254 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 49 conjunts are in the unsatisfiable core [2019-08-05 10:25:56,978 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:25:57,195 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:25:57,195 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:25:57,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:25:57,196 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:25:57,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:25:57,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:25:57,196 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 13 states. [2019-08-05 10:25:57,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:25:57,347 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-08-05 10:25:57,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:25:57,347 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2019-08-05 10:25:57,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:25:57,348 INFO L225 Difference]: With dead ends: 15 [2019-08-05 10:25:57,348 INFO L226 Difference]: Without dead ends: 15 [2019-08-05 10:25:57,349 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:25:57,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-05 10:25:57,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-08-05 10:25:57,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 10:25:57,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-08-05 10:25:57,351 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2019-08-05 10:25:57,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:25:57,351 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-08-05 10:25:57,351 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:25:57,351 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-08-05 10:25:57,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 10:25:57,352 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:25:57,352 INFO L399 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2019-08-05 10:25:57,352 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:25:57,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:25:57,352 INFO L82 PathProgramCache]: Analyzing trace with hash 960091340, now seen corresponding path program 11 times [2019-08-05 10:25:57,353 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:25:57,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:25:57,377 WARN L254 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 53 conjunts are in the unsatisfiable core [2019-08-05 10:25:57,378 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:25:57,612 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:25:57,613 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:25:57,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:25:57,613 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:25:57,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:25:57,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:25:57,614 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 14 states. [2019-08-05 10:25:57,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:25:57,839 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-08-05 10:25:57,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:25:57,840 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2019-08-05 10:25:57,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:25:57,841 INFO L225 Difference]: With dead ends: 16 [2019-08-05 10:25:57,841 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 10:25:57,842 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:25:57,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 10:25:57,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-08-05 10:25:57,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 10:25:57,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-08-05 10:25:57,845 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2019-08-05 10:25:57,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:25:57,845 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-08-05 10:25:57,845 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:25:57,845 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-08-05 10:25:57,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:25:57,846 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:25:57,846 INFO L399 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2019-08-05 10:25:57,846 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:25:57,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:25:57,847 INFO L82 PathProgramCache]: Analyzing trace with hash -301937725, now seen corresponding path program 12 times [2019-08-05 10:25:57,847 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:25:57,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:25:57,867 WARN L254 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 57 conjunts are in the unsatisfiable core [2019-08-05 10:25:57,868 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:25:58,280 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:25:58,281 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:25:58,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:25:58,281 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 10:25:58,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 10:25:58,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:25:58,282 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 15 states. [2019-08-05 10:25:58,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:25:58,530 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-08-05 10:25:58,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:25:58,535 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2019-08-05 10:25:58,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:25:58,536 INFO L225 Difference]: With dead ends: 17 [2019-08-05 10:25:58,536 INFO L226 Difference]: Without dead ends: 17 [2019-08-05 10:25:58,537 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:25:58,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-05 10:25:58,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-08-05 10:25:58,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 10:25:58,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-08-05 10:25:58,539 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2019-08-05 10:25:58,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:25:58,540 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-08-05 10:25:58,540 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 10:25:58,540 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-08-05 10:25:58,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:25:58,540 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:25:58,541 INFO L399 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2019-08-05 10:25:58,541 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:25:58,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:25:58,541 INFO L82 PathProgramCache]: Analyzing trace with hash -770133076, now seen corresponding path program 13 times [2019-08-05 10:25:58,542 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:25:58,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:25:58,560 WARN L254 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 61 conjunts are in the unsatisfiable core [2019-08-05 10:25:58,561 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:25:58,875 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:25:58,876 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:25:58,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 10:25:58,876 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:25:58,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:25:58,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:25:58,878 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 16 states. [2019-08-05 10:25:59,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:25:59,057 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-08-05 10:25:59,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:25:59,059 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2019-08-05 10:25:59,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:25:59,060 INFO L225 Difference]: With dead ends: 18 [2019-08-05 10:25:59,060 INFO L226 Difference]: Without dead ends: 18 [2019-08-05 10:25:59,061 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:25:59,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-05 10:25:59,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-08-05 10:25:59,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-05 10:25:59,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-08-05 10:25:59,063 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2019-08-05 10:25:59,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:25:59,064 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-08-05 10:25:59,064 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:25:59,064 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-08-05 10:25:59,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 10:25:59,064 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:25:59,065 INFO L399 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2019-08-05 10:25:59,065 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:25:59,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:25:59,065 INFO L82 PathProgramCache]: Analyzing trace with hash 1895680227, now seen corresponding path program 14 times [2019-08-05 10:25:59,066 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:25:59,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:25:59,082 WARN L254 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 65 conjunts are in the unsatisfiable core [2019-08-05 10:25:59,083 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:25:59,512 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:25:59,512 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:25:59,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:25:59,513 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 10:25:59,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 10:25:59,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:25:59,513 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 17 states. [2019-08-05 10:25:59,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:25:59,833 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-08-05 10:25:59,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:25:59,833 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2019-08-05 10:25:59,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:25:59,834 INFO L225 Difference]: With dead ends: 19 [2019-08-05 10:25:59,834 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 10:25:59,834 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:25:59,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 10:25:59,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-08-05 10:25:59,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 10:25:59,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-08-05 10:25:59,838 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2019-08-05 10:25:59,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:25:59,839 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-08-05 10:25:59,839 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 10:25:59,839 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-08-05 10:25:59,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:25:59,840 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:25:59,840 INFO L399 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2019-08-05 10:25:59,840 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:25:59,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:25:59,840 INFO L82 PathProgramCache]: Analyzing trace with hash -1363453300, now seen corresponding path program 15 times [2019-08-05 10:25:59,841 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:25:59,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:25:59,856 WARN L254 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 69 conjunts are in the unsatisfiable core [2019-08-05 10:25:59,858 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:00,222 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:00,222 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:00,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:26:00,222 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:26:00,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:26:00,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:26:00,223 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 18 states. [2019-08-05 10:26:00,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:00,487 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-08-05 10:26:00,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 10:26:00,487 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2019-08-05 10:26:00,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:00,488 INFO L225 Difference]: With dead ends: 20 [2019-08-05 10:26:00,488 INFO L226 Difference]: Without dead ends: 20 [2019-08-05 10:26:00,489 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:26:00,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-05 10:26:00,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-08-05 10:26:00,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 10:26:00,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-08-05 10:26:00,492 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2019-08-05 10:26:00,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:00,493 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-08-05 10:26:00,493 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:26:00,493 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-08-05 10:26:00,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:26:00,494 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:00,494 INFO L399 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2019-08-05 10:26:00,494 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:00,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:00,494 INFO L82 PathProgramCache]: Analyzing trace with hash 682622467, now seen corresponding path program 16 times [2019-08-05 10:26:00,495 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:00,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:00,510 WARN L254 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 73 conjunts are in the unsatisfiable core [2019-08-05 10:26:00,512 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:00,997 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:00,997 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:00,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:26:00,997 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:26:00,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:26:00,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:26:00,998 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 19 states. [2019-08-05 10:26:01,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:01,262 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-08-05 10:26:01,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:26:01,263 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-08-05 10:26:01,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:01,264 INFO L225 Difference]: With dead ends: 21 [2019-08-05 10:26:01,264 INFO L226 Difference]: Without dead ends: 21 [2019-08-05 10:26:01,265 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:01,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-05 10:26:01,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-08-05 10:26:01,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-05 10:26:01,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-08-05 10:26:01,267 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2019-08-05 10:26:01,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:01,267 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-08-05 10:26:01,268 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:26:01,268 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-08-05 10:26:01,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:26:01,268 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:01,268 INFO L399 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2019-08-05 10:26:01,269 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:01,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:01,269 INFO L82 PathProgramCache]: Analyzing trace with hash -313538196, now seen corresponding path program 17 times [2019-08-05 10:26:01,270 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:01,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:01,284 WARN L254 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 77 conjunts are in the unsatisfiable core [2019-08-05 10:26:01,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:01,601 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:01,601 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:01,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:26:01,602 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:26:01,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:26:01,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:26:01,602 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 20 states. [2019-08-05 10:26:01,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:01,923 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-08-05 10:26:01,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 10:26:01,924 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2019-08-05 10:26:01,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:01,924 INFO L225 Difference]: With dead ends: 22 [2019-08-05 10:26:01,924 INFO L226 Difference]: Without dead ends: 22 [2019-08-05 10:26:01,925 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:26:01,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-05 10:26:01,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-08-05 10:26:01,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-05 10:26:01,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-08-05 10:26:01,928 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2019-08-05 10:26:01,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:01,928 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-08-05 10:26:01,928 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:26:01,928 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-08-05 10:26:01,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:26:01,929 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:01,929 INFO L399 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2019-08-05 10:26:01,929 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:01,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:01,929 INFO L82 PathProgramCache]: Analyzing trace with hash -1129747677, now seen corresponding path program 18 times [2019-08-05 10:26:01,930 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:01,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:01,945 WARN L254 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 81 conjunts are in the unsatisfiable core [2019-08-05 10:26:01,947 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:02,376 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:02,377 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:02,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:26:02,377 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:26:02,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:26:02,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:26:02,378 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 21 states. [2019-08-05 10:26:02,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:02,718 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-08-05 10:26:02,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:26:02,719 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2019-08-05 10:26:02,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:02,720 INFO L225 Difference]: With dead ends: 23 [2019-08-05 10:26:02,720 INFO L226 Difference]: Without dead ends: 23 [2019-08-05 10:26:02,721 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:26:02,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-08-05 10:26:02,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-08-05 10:26:02,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-05 10:26:02,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-08-05 10:26:02,724 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2019-08-05 10:26:02,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:02,725 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-08-05 10:26:02,725 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:26:02,725 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-08-05 10:26:02,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:26:02,726 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:02,726 INFO L399 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2019-08-05 10:26:02,726 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:02,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:02,727 INFO L82 PathProgramCache]: Analyzing trace with hash -662437812, now seen corresponding path program 19 times [2019-08-05 10:26:02,728 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:02,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:02,744 WARN L254 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 85 conjunts are in the unsatisfiable core [2019-08-05 10:26:02,746 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:03,148 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:03,149 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:03,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:26:03,149 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:26:03,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:26:03,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:26:03,150 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 22 states. [2019-08-05 10:26:03,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:03,613 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-08-05 10:26:03,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:26:03,613 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2019-08-05 10:26:03,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:03,614 INFO L225 Difference]: With dead ends: 24 [2019-08-05 10:26:03,614 INFO L226 Difference]: Without dead ends: 24 [2019-08-05 10:26:03,615 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:26:03,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-08-05 10:26:03,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-08-05 10:26:03,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-05 10:26:03,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-08-05 10:26:03,618 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2019-08-05 10:26:03,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:03,618 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-08-05 10:26:03,618 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:26:03,618 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-08-05 10:26:03,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:26:03,619 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:03,619 INFO L399 BasicCegarLoop]: trace histogram [20, 1, 1, 1] [2019-08-05 10:26:03,619 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:03,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:03,620 INFO L82 PathProgramCache]: Analyzing trace with hash 939266115, now seen corresponding path program 20 times [2019-08-05 10:26:03,621 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:03,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:03,635 WARN L254 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 89 conjunts are in the unsatisfiable core [2019-08-05 10:26:03,637 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:04,115 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:04,115 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:04,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:26:04,116 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:26:04,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:26:04,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:26:04,117 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 23 states. [2019-08-05 10:26:04,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:04,602 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-08-05 10:26:04,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 10:26:04,602 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2019-08-05 10:26:04,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:04,603 INFO L225 Difference]: With dead ends: 25 [2019-08-05 10:26:04,603 INFO L226 Difference]: Without dead ends: 25 [2019-08-05 10:26:04,604 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:26:04,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-05 10:26:04,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-08-05 10:26:04,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-05 10:26:04,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-08-05 10:26:04,608 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2019-08-05 10:26:04,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:04,608 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-08-05 10:26:04,609 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:26:04,609 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-08-05 10:26:04,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:26:04,609 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:04,610 INFO L399 BasicCegarLoop]: trace histogram [21, 1, 1, 1] [2019-08-05 10:26:04,610 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:04,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:04,610 INFO L82 PathProgramCache]: Analyzing trace with hash -947519700, now seen corresponding path program 21 times [2019-08-05 10:26:04,611 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:04,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:04,626 WARN L254 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 93 conjunts are in the unsatisfiable core [2019-08-05 10:26:04,627 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:06,088 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:06,088 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:06,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 10:26:06,089 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:26:06,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:26:06,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:26:06,090 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 24 states. [2019-08-05 10:26:06,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:06,529 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-08-05 10:26:06,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 10:26:06,532 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2019-08-05 10:26:06,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:06,532 INFO L225 Difference]: With dead ends: 26 [2019-08-05 10:26:06,533 INFO L226 Difference]: Without dead ends: 26 [2019-08-05 10:26:06,533 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:26:06,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-08-05 10:26:06,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-08-05 10:26:06,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-08-05 10:26:06,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-08-05 10:26:06,536 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2019-08-05 10:26:06,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:06,537 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-08-05 10:26:06,537 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:26:06,537 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-08-05 10:26:06,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:26:06,538 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:06,538 INFO L399 BasicCegarLoop]: trace histogram [22, 1, 1, 1] [2019-08-05 10:26:06,538 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:06,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:06,538 INFO L82 PathProgramCache]: Analyzing trace with hash 691662179, now seen corresponding path program 22 times [2019-08-05 10:26:06,539 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:06,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:06,554 WARN L254 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 97 conjunts are in the unsatisfiable core [2019-08-05 10:26:06,556 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:07,122 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:07,123 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:07,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 10:26:07,123 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 10:26:07,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 10:26:07,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:26:07,124 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 25 states. [2019-08-05 10:26:07,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:07,903 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-08-05 10:26:07,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:26:07,904 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2019-08-05 10:26:07,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:07,905 INFO L225 Difference]: With dead ends: 27 [2019-08-05 10:26:07,905 INFO L226 Difference]: Without dead ends: 27 [2019-08-05 10:26:07,905 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:26:07,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-08-05 10:26:07,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-08-05 10:26:07,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-05 10:26:07,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-08-05 10:26:07,908 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2019-08-05 10:26:07,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:07,908 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-08-05 10:26:07,908 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 10:26:07,908 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-08-05 10:26:07,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 10:26:07,909 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:07,909 INFO L399 BasicCegarLoop]: trace histogram [23, 1, 1, 1] [2019-08-05 10:26:07,909 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:07,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:07,910 INFO L82 PathProgramCache]: Analyzing trace with hash -33307124, now seen corresponding path program 23 times [2019-08-05 10:26:07,910 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:07,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:07,927 WARN L254 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 101 conjunts are in the unsatisfiable core [2019-08-05 10:26:07,929 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:08,552 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:08,552 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:08,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 10:26:08,553 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 10:26:08,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 10:26:08,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:26:08,554 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 26 states. [2019-08-05 10:26:09,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:09,358 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-08-05 10:26:09,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:26:09,359 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2019-08-05 10:26:09,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:09,359 INFO L225 Difference]: With dead ends: 28 [2019-08-05 10:26:09,360 INFO L226 Difference]: Without dead ends: 28 [2019-08-05 10:26:09,361 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:26:09,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-08-05 10:26:09,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-08-05 10:26:09,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-05 10:26:09,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-08-05 10:26:09,364 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2019-08-05 10:26:09,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:09,364 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-08-05 10:26:09,364 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 10:26:09,364 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-08-05 10:26:09,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:26:09,365 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:09,365 INFO L399 BasicCegarLoop]: trace histogram [24, 1, 1, 1] [2019-08-05 10:26:09,366 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:09,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:09,366 INFO L82 PathProgramCache]: Analyzing trace with hash -1032519037, now seen corresponding path program 24 times [2019-08-05 10:26:09,367 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:09,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:09,383 WARN L254 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 105 conjunts are in the unsatisfiable core [2019-08-05 10:26:09,385 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:10,585 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:10,586 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:10,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 10:26:10,586 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 10:26:10,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 10:26:10,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:26:10,587 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 27 states. [2019-08-05 10:26:11,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:11,104 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-08-05 10:26:11,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 10:26:11,105 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2019-08-05 10:26:11,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:11,105 INFO L225 Difference]: With dead ends: 29 [2019-08-05 10:26:11,106 INFO L226 Difference]: Without dead ends: 29 [2019-08-05 10:26:11,106 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:26:11,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-08-05 10:26:11,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-08-05 10:26:11,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-08-05 10:26:11,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-08-05 10:26:11,110 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2019-08-05 10:26:11,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:11,110 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-08-05 10:26:11,110 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 10:26:11,110 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-08-05 10:26:11,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 10:26:11,111 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:11,111 INFO L399 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2019-08-05 10:26:11,111 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:11,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:11,112 INFO L82 PathProgramCache]: Analyzing trace with hash -1943317268, now seen corresponding path program 25 times [2019-08-05 10:26:11,113 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:11,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:11,129 WARN L254 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 109 conjunts are in the unsatisfiable core [2019-08-05 10:26:11,131 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:11,686 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:11,687 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:11,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 10:26:11,687 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 10:26:11,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 10:26:11,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:26:11,688 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 28 states. [2019-08-05 10:26:13,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:13,369 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-08-05 10:26:13,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 10:26:13,370 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 28 [2019-08-05 10:26:13,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:13,371 INFO L225 Difference]: With dead ends: 30 [2019-08-05 10:26:13,371 INFO L226 Difference]: Without dead ends: 30 [2019-08-05 10:26:13,372 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:26:13,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-08-05 10:26:13,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-08-05 10:26:13,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-05 10:26:13,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-08-05 10:26:13,375 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2019-08-05 10:26:13,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:13,375 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-08-05 10:26:13,375 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 10:26:13,375 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-08-05 10:26:13,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 10:26:13,375 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:13,375 INFO L399 BasicCegarLoop]: trace histogram [26, 1, 1, 1] [2019-08-05 10:26:13,376 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:13,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:13,376 INFO L82 PathProgramCache]: Analyzing trace with hash -113291357, now seen corresponding path program 26 times [2019-08-05 10:26:13,377 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:13,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:13,392 WARN L254 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 113 conjunts are in the unsatisfiable core [2019-08-05 10:26:13,394 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:14,130 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:14,130 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:14,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 10:26:14,130 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 10:26:14,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 10:26:14,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:26:14,131 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 29 states. [2019-08-05 10:26:14,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:14,728 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-08-05 10:26:14,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 10:26:14,729 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 29 [2019-08-05 10:26:14,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:14,729 INFO L225 Difference]: With dead ends: 31 [2019-08-05 10:26:14,729 INFO L226 Difference]: Without dead ends: 31 [2019-08-05 10:26:14,730 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:26:14,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-08-05 10:26:14,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-08-05 10:26:14,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-08-05 10:26:14,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-08-05 10:26:14,733 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2019-08-05 10:26:14,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:14,734 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-08-05 10:26:14,734 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 10:26:14,734 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-08-05 10:26:14,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 10:26:14,735 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:14,735 INFO L399 BasicCegarLoop]: trace histogram [27, 1, 1, 1] [2019-08-05 10:26:14,735 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:14,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:14,735 INFO L82 PathProgramCache]: Analyzing trace with hash 782937036, now seen corresponding path program 27 times [2019-08-05 10:26:14,736 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:14,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:14,750 WARN L254 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 117 conjunts are in the unsatisfiable core [2019-08-05 10:26:14,752 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:15,390 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:15,391 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:15,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 10:26:15,391 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 10:26:15,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 10:26:15,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:26:15,392 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 30 states. [2019-08-05 10:26:16,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:16,034 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-08-05 10:26:16,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 10:26:16,034 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 30 [2019-08-05 10:26:16,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:16,035 INFO L225 Difference]: With dead ends: 32 [2019-08-05 10:26:16,035 INFO L226 Difference]: Without dead ends: 32 [2019-08-05 10:26:16,036 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:16,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-08-05 10:26:16,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-08-05 10:26:16,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-05 10:26:16,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-08-05 10:26:16,039 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2019-08-05 10:26:16,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:16,040 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-08-05 10:26:16,040 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 10:26:16,040 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-08-05 10:26:16,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-05 10:26:16,040 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:16,041 INFO L399 BasicCegarLoop]: trace histogram [28, 1, 1, 1] [2019-08-05 10:26:16,041 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:16,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:16,041 INFO L82 PathProgramCache]: Analyzing trace with hash -1498753853, now seen corresponding path program 28 times [2019-08-05 10:26:16,042 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:16,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:16,058 WARN L254 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 121 conjunts are in the unsatisfiable core [2019-08-05 10:26:16,060 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:16,672 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:16,672 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:16,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-05 10:26:16,672 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-05 10:26:16,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-05 10:26:16,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:26:16,673 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 31 states. [2019-08-05 10:26:17,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:17,365 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-08-05 10:26:17,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 10:26:17,366 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 31 [2019-08-05 10:26:17,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:17,366 INFO L225 Difference]: With dead ends: 33 [2019-08-05 10:26:17,366 INFO L226 Difference]: Without dead ends: 33 [2019-08-05 10:26:17,367 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:26:17,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-08-05 10:26:17,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-08-05 10:26:17,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-05 10:26:17,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-08-05 10:26:17,371 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2019-08-05 10:26:17,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:17,371 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-08-05 10:26:17,371 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-05 10:26:17,371 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-08-05 10:26:17,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 10:26:17,372 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:17,372 INFO L399 BasicCegarLoop]: trace histogram [29, 1, 1, 1] [2019-08-05 10:26:17,372 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:17,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:17,372 INFO L82 PathProgramCache]: Analyzing trace with hash 783272620, now seen corresponding path program 29 times [2019-08-05 10:26:17,373 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:17,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:17,392 WARN L254 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 125 conjunts are in the unsatisfiable core [2019-08-05 10:26:17,394 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:18,041 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:18,041 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:18,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-05 10:26:18,041 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 10:26:18,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 10:26:18,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:26:18,042 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 32 states. [2019-08-05 10:26:18,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:18,769 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-08-05 10:26:18,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-05 10:26:18,770 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 32 [2019-08-05 10:26:18,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:18,770 INFO L225 Difference]: With dead ends: 34 [2019-08-05 10:26:18,770 INFO L226 Difference]: Without dead ends: 34 [2019-08-05 10:26:18,772 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:26:18,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-08-05 10:26:18,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-08-05 10:26:18,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-05 10:26:18,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-08-05 10:26:18,775 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2019-08-05 10:26:18,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:18,775 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-08-05 10:26:18,775 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 10:26:18,775 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-08-05 10:26:18,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-05 10:26:18,776 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:18,776 INFO L399 BasicCegarLoop]: trace histogram [30, 1, 1, 1] [2019-08-05 10:26:18,776 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:18,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:18,777 INFO L82 PathProgramCache]: Analyzing trace with hash -1488350749, now seen corresponding path program 30 times [2019-08-05 10:26:18,777 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:18,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:18,792 WARN L254 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 129 conjunts are in the unsatisfiable core [2019-08-05 10:26:18,794 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:19,719 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:19,719 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:19,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-05 10:26:19,720 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-05 10:26:19,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-05 10:26:19,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:26:19,721 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 33 states. [2019-08-05 10:26:20,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:20,499 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-08-05 10:26:20,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-05 10:26:20,501 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 33 [2019-08-05 10:26:20,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:20,501 INFO L225 Difference]: With dead ends: 35 [2019-08-05 10:26:20,501 INFO L226 Difference]: Without dead ends: 35 [2019-08-05 10:26:20,502 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:26:20,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-08-05 10:26:20,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-08-05 10:26:20,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-05 10:26:20,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-08-05 10:26:20,504 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2019-08-05 10:26:20,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:20,505 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-08-05 10:26:20,505 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-05 10:26:20,505 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-08-05 10:26:20,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-05 10:26:20,505 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:20,506 INFO L399 BasicCegarLoop]: trace histogram [31, 1, 1, 1] [2019-08-05 10:26:20,506 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:20,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:20,506 INFO L82 PathProgramCache]: Analyzing trace with hash 1105768844, now seen corresponding path program 31 times [2019-08-05 10:26:20,507 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:20,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:20,527 WARN L254 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 133 conjunts are in the unsatisfiable core [2019-08-05 10:26:20,528 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:21,482 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:21,482 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:21,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 10:26:21,483 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 10:26:21,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 10:26:21,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:26:21,484 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 34 states. [2019-08-05 10:26:22,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:22,317 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-08-05 10:26:22,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-05 10:26:22,317 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 34 [2019-08-05 10:26:22,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:22,318 INFO L225 Difference]: With dead ends: 36 [2019-08-05 10:26:22,318 INFO L226 Difference]: Without dead ends: 36 [2019-08-05 10:26:22,319 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:26:22,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-08-05 10:26:22,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-08-05 10:26:22,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-05 10:26:22,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-08-05 10:26:22,323 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2019-08-05 10:26:22,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:22,323 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-08-05 10:26:22,323 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 10:26:22,323 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-08-05 10:26:22,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-05 10:26:22,324 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:22,324 INFO L399 BasicCegarLoop]: trace histogram [32, 1, 1, 1] [2019-08-05 10:26:22,324 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:22,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:22,325 INFO L82 PathProgramCache]: Analyzing trace with hash -80902397, now seen corresponding path program 32 times [2019-08-05 10:26:22,325 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:22,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:22,343 WARN L254 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 137 conjunts are in the unsatisfiable core [2019-08-05 10:26:22,344 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:23,037 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:23,037 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:23,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-05 10:26:23,038 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 10:26:23,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 10:26:23,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:26:23,039 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 35 states. [2019-08-05 10:26:23,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:23,931 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-08-05 10:26:23,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 10:26:23,932 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 35 [2019-08-05 10:26:23,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:23,933 INFO L225 Difference]: With dead ends: 37 [2019-08-05 10:26:23,933 INFO L226 Difference]: Without dead ends: 37 [2019-08-05 10:26:23,934 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:26:23,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-08-05 10:26:23,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-08-05 10:26:23,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-05 10:26:23,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-08-05 10:26:23,936 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2019-08-05 10:26:23,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:23,936 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-08-05 10:26:23,937 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 10:26:23,937 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-08-05 10:26:23,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-05 10:26:23,937 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:23,937 INFO L399 BasicCegarLoop]: trace histogram [33, 1, 1, 1] [2019-08-05 10:26:23,938 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:23,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:23,938 INFO L82 PathProgramCache]: Analyzing trace with hash 1786994796, now seen corresponding path program 33 times [2019-08-05 10:26:23,938 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:23,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:23,956 WARN L254 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 141 conjunts are in the unsatisfiable core [2019-08-05 10:26:23,958 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:25,043 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:25,043 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:25,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-05 10:26:25,044 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-05 10:26:25,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-05 10:26:25,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:26:25,045 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 36 states. [2019-08-05 10:26:25,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:25,970 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-08-05 10:26:25,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-05 10:26:25,971 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 36 [2019-08-05 10:26:25,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:25,971 INFO L225 Difference]: With dead ends: 38 [2019-08-05 10:26:25,971 INFO L226 Difference]: Without dead ends: 38 [2019-08-05 10:26:25,972 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:26:25,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-08-05 10:26:25,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-08-05 10:26:25,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-05 10:26:25,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-08-05 10:26:25,974 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2019-08-05 10:26:25,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:25,974 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-08-05 10:26:25,974 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-05 10:26:25,974 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-08-05 10:26:25,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-08-05 10:26:25,975 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:25,975 INFO L399 BasicCegarLoop]: trace histogram [34, 1, 1, 1] [2019-08-05 10:26:25,975 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:25,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:25,975 INFO L82 PathProgramCache]: Analyzing trace with hash -437734365, now seen corresponding path program 34 times [2019-08-05 10:26:25,976 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:25,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:25,996 WARN L254 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 145 conjunts are in the unsatisfiable core [2019-08-05 10:26:25,997 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:26,910 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:26,910 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:26,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-05 10:26:26,911 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-05 10:26:26,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-05 10:26:26,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:26:26,911 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 37 states. [2019-08-05 10:26:27,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:27,900 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-08-05 10:26:27,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-05 10:26:27,900 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 37 [2019-08-05 10:26:27,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:27,901 INFO L225 Difference]: With dead ends: 39 [2019-08-05 10:26:27,901 INFO L226 Difference]: Without dead ends: 39 [2019-08-05 10:26:27,902 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:26:27,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-08-05 10:26:27,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-08-05 10:26:27,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-05 10:26:27,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-08-05 10:26:27,905 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2019-08-05 10:26:27,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:27,906 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-08-05 10:26:27,906 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-05 10:26:27,906 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-08-05 10:26:27,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-05 10:26:27,906 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:27,906 INFO L399 BasicCegarLoop]: trace histogram [35, 1, 1, 1] [2019-08-05 10:26:27,907 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:27,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:27,907 INFO L82 PathProgramCache]: Analyzing trace with hash -684861620, now seen corresponding path program 35 times [2019-08-05 10:26:27,908 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:27,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:27,927 WARN L254 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 149 conjunts are in the unsatisfiable core [2019-08-05 10:26:27,929 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:29,038 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:26:29,038 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:29,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-05 10:26:29,038 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-05 10:26:29,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-05 10:26:29,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:26:29,039 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 38 states. [2019-08-05 10:26:30,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:30,149 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-08-05 10:26:30,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-05 10:26:30,149 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 38 [2019-08-05 10:26:30,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:30,150 INFO L225 Difference]: With dead ends: 40 [2019-08-05 10:26:30,150 INFO L226 Difference]: Without dead ends: 40 [2019-08-05 10:26:30,151 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:26:30,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-08-05 10:26:30,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-08-05 10:26:30,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-05 10:26:30,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-08-05 10:26:30,154 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2019-08-05 10:26:30,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:30,154 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-08-05 10:26:30,154 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-05 10:26:30,154 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-08-05 10:26:30,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-08-05 10:26:30,155 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:30,155 INFO L399 BasicCegarLoop]: trace histogram [36, 1, 1, 1] [2019-08-05 10:26:30,155 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:30,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:30,155 INFO L82 PathProgramCache]: Analyzing trace with hash 244128067, now seen corresponding path program 36 times [2019-08-05 10:26:30,156 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:30,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:30,179 WARN L254 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 153 conjunts are in the unsatisfiable core [2019-08-05 10:26:30,180 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:31,073 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:26:31,073 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:31,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-05 10:26:31,074 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-05 10:26:31,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-05 10:26:31,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:26:31,075 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 39 states. [2019-08-05 10:26:32,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:32,171 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-08-05 10:26:32,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-05 10:26:32,172 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 39 [2019-08-05 10:26:32,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:32,172 INFO L225 Difference]: With dead ends: 41 [2019-08-05 10:26:32,173 INFO L226 Difference]: Without dead ends: 41 [2019-08-05 10:26:32,173 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:26:32,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-08-05 10:26:32,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-08-05 10:26:32,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-05 10:26:32,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-08-05 10:26:32,176 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2019-08-05 10:26:32,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:32,176 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-08-05 10:26:32,176 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-05 10:26:32,177 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-08-05 10:26:32,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 10:26:32,177 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:32,177 INFO L399 BasicCegarLoop]: trace histogram [37, 1, 1, 1] [2019-08-05 10:26:32,177 INFO L418 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:32,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:32,178 INFO L82 PathProgramCache]: Analyzing trace with hash -1021962708, now seen corresponding path program 37 times [2019-08-05 10:26:32,178 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:32,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:32,199 WARN L254 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 157 conjunts are in the unsatisfiable core [2019-08-05 10:26:32,200 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:33,100 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:26:33,100 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:33,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-05 10:26:33,100 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-05 10:26:33,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-05 10:26:33,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:26:33,101 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 40 states. [2019-08-05 10:26:34,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:34,280 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-08-05 10:26:34,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-05 10:26:34,280 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 40 [2019-08-05 10:26:34,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:34,281 INFO L225 Difference]: With dead ends: 42 [2019-08-05 10:26:34,281 INFO L226 Difference]: Without dead ends: 42 [2019-08-05 10:26:34,281 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:26:34,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-08-05 10:26:34,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-08-05 10:26:34,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-05 10:26:34,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-08-05 10:26:34,283 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2019-08-05 10:26:34,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:34,283 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-08-05 10:26:34,283 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-05 10:26:34,283 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-08-05 10:26:34,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-08-05 10:26:34,284 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:34,284 INFO L399 BasicCegarLoop]: trace histogram [38, 1, 1, 1] [2019-08-05 10:26:34,284 INFO L418 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:34,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:34,285 INFO L82 PathProgramCache]: Analyzing trace with hash -1616071069, now seen corresponding path program 38 times [2019-08-05 10:26:34,285 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:34,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:34,311 WARN L254 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 161 conjunts are in the unsatisfiable core [2019-08-05 10:26:34,313 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:35,400 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:26:35,400 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:35,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-05 10:26:35,401 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-05 10:26:35,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-05 10:26:35,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:26:35,402 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 41 states. [2019-08-05 10:26:36,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:36,616 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-08-05 10:26:36,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-05 10:26:36,617 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 41 [2019-08-05 10:26:36,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:36,617 INFO L225 Difference]: With dead ends: 43 [2019-08-05 10:26:36,618 INFO L226 Difference]: Without dead ends: 43 [2019-08-05 10:26:36,619 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:26:36,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-08-05 10:26:36,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-08-05 10:26:36,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-05 10:26:36,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-08-05 10:26:36,622 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2019-08-05 10:26:36,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:36,622 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-08-05 10:26:36,622 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-05 10:26:36,622 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-08-05 10:26:36,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-05 10:26:36,623 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:36,623 INFO L399 BasicCegarLoop]: trace histogram [39, 1, 1, 1] [2019-08-05 10:26:36,623 INFO L418 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:36,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:36,623 INFO L82 PathProgramCache]: Analyzing trace with hash 1441406220, now seen corresponding path program 39 times [2019-08-05 10:26:36,624 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:36,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:36,644 WARN L254 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 165 conjunts are in the unsatisfiable core [2019-08-05 10:26:36,645 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:37,696 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:26:37,696 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:37,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-05 10:26:37,696 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-05 10:26:37,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-05 10:26:37,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:26:37,698 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 42 states. [2019-08-05 10:26:38,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:38,975 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-08-05 10:26:38,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-05 10:26:38,976 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 42 [2019-08-05 10:26:38,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:38,976 INFO L225 Difference]: With dead ends: 44 [2019-08-05 10:26:38,976 INFO L226 Difference]: Without dead ends: 44 [2019-08-05 10:26:38,977 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:26:38,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-08-05 10:26:38,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-08-05 10:26:38,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-05 10:26:38,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-08-05 10:26:38,980 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2019-08-05 10:26:38,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:38,980 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-08-05 10:26:38,980 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-05 10:26:38,980 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-08-05 10:26:38,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-08-05 10:26:38,980 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:38,981 INFO L399 BasicCegarLoop]: trace histogram [40, 1, 1, 1] [2019-08-05 10:26:38,981 INFO L418 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:38,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:38,981 INFO L82 PathProgramCache]: Analyzing trace with hash 1733921667, now seen corresponding path program 40 times [2019-08-05 10:26:38,982 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:39,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:39,004 WARN L254 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 169 conjunts are in the unsatisfiable core [2019-08-05 10:26:39,006 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:40,283 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:26:40,283 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:40,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-05 10:26:40,284 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-05 10:26:40,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-05 10:26:40,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:26:40,285 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 43 states. [2019-08-05 10:26:41,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:41,647 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-08-05 10:26:41,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-05 10:26:41,648 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 43 [2019-08-05 10:26:41,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:41,649 INFO L225 Difference]: With dead ends: 45 [2019-08-05 10:26:41,649 INFO L226 Difference]: Without dead ends: 45 [2019-08-05 10:26:41,650 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:26:41,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-05 10:26:41,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-08-05 10:26:41,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-05 10:26:41,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-08-05 10:26:41,652 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2019-08-05 10:26:41,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:41,652 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-08-05 10:26:41,653 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-05 10:26:41,653 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-08-05 10:26:41,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-08-05 10:26:41,653 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:41,653 INFO L399 BasicCegarLoop]: trace histogram [41, 1, 1, 1] [2019-08-05 10:26:41,653 INFO L418 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:41,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:41,654 INFO L82 PathProgramCache]: Analyzing trace with hash -2083001364, now seen corresponding path program 41 times [2019-08-05 10:26:41,654 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:41,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:41,677 WARN L254 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 173 conjunts are in the unsatisfiable core [2019-08-05 10:26:41,678 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:42,881 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:26:42,882 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:42,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-05 10:26:42,882 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-05 10:26:42,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-05 10:26:42,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:26:42,883 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 44 states. [2019-08-05 10:26:44,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:44,293 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-08-05 10:26:44,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-05 10:26:44,294 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 44 [2019-08-05 10:26:44,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:44,295 INFO L225 Difference]: With dead ends: 46 [2019-08-05 10:26:44,295 INFO L226 Difference]: Without dead ends: 46 [2019-08-05 10:26:44,296 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:26:44,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-08-05 10:26:44,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-08-05 10:26:44,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-05 10:26:44,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-08-05 10:26:44,298 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2019-08-05 10:26:44,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:44,298 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-08-05 10:26:44,298 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-05 10:26:44,298 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-08-05 10:26:44,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-08-05 10:26:44,299 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:44,299 INFO L399 BasicCegarLoop]: trace histogram [42, 1, 1, 1] [2019-08-05 10:26:44,299 INFO L418 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:44,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:44,299 INFO L82 PathProgramCache]: Analyzing trace with hash -148531037, now seen corresponding path program 42 times [2019-08-05 10:26:44,300 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:44,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:44,323 WARN L254 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 177 conjunts are in the unsatisfiable core [2019-08-05 10:26:44,324 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:45,727 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:26:45,728 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:45,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-05 10:26:45,728 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-05 10:26:45,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-05 10:26:45,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:26:45,729 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 45 states. [2019-08-05 10:26:47,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:47,208 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-08-05 10:26:47,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-05 10:26:47,208 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 45 [2019-08-05 10:26:47,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:47,209 INFO L225 Difference]: With dead ends: 47 [2019-08-05 10:26:47,209 INFO L226 Difference]: Without dead ends: 47 [2019-08-05 10:26:47,210 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:26:47,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-08-05 10:26:47,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-08-05 10:26:47,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-08-05 10:26:47,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-08-05 10:26:47,213 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2019-08-05 10:26:47,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:47,213 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-08-05 10:26:47,213 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-05 10:26:47,213 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-08-05 10:26:47,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-08-05 10:26:47,214 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:47,214 INFO L399 BasicCegarLoop]: trace histogram [43, 1, 1, 1] [2019-08-05 10:26:47,214 INFO L418 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:47,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:47,214 INFO L82 PathProgramCache]: Analyzing trace with hash -309493044, now seen corresponding path program 43 times [2019-08-05 10:26:47,215 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:47,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:47,238 WARN L254 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 181 conjunts are in the unsatisfiable core [2019-08-05 10:26:47,240 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:48,432 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:26:48,432 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:48,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-05 10:26:48,432 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-05 10:26:48,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-05 10:26:48,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:26:48,433 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 46 states. [2019-08-05 10:26:50,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:50,051 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-08-05 10:26:50,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-05 10:26:50,052 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 46 [2019-08-05 10:26:50,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:50,052 INFO L225 Difference]: With dead ends: 48 [2019-08-05 10:26:50,052 INFO L226 Difference]: Without dead ends: 48 [2019-08-05 10:26:50,053 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:26:50,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-08-05 10:26:50,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-08-05 10:26:50,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-05 10:26:50,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-08-05 10:26:50,056 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2019-08-05 10:26:50,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:50,056 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-08-05 10:26:50,056 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-05 10:26:50,056 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-08-05 10:26:50,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 10:26:50,057 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:50,057 INFO L399 BasicCegarLoop]: trace histogram [44, 1, 1, 1] [2019-08-05 10:26:50,057 INFO L418 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:50,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:50,058 INFO L82 PathProgramCache]: Analyzing trace with hash -1004347965, now seen corresponding path program 44 times [2019-08-05 10:26:50,058 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:50,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:50,080 WARN L254 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 185 conjunts are in the unsatisfiable core [2019-08-05 10:26:50,082 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:51,331 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:26:51,331 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:51,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-05 10:26:51,332 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-05 10:26:51,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-05 10:26:51,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:26:51,332 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 47 states. [2019-08-05 10:26:52,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:52,951 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-08-05 10:26:52,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-05 10:26:52,952 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 47 [2019-08-05 10:26:52,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:52,953 INFO L225 Difference]: With dead ends: 49 [2019-08-05 10:26:52,953 INFO L226 Difference]: Without dead ends: 49 [2019-08-05 10:26:52,954 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:26:52,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-08-05 10:26:52,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-08-05 10:26:52,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-08-05 10:26:52,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-08-05 10:26:52,956 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2019-08-05 10:26:52,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:52,956 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-08-05 10:26:52,956 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-05 10:26:52,956 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-08-05 10:26:52,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-08-05 10:26:52,957 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:52,957 INFO L399 BasicCegarLoop]: trace histogram [45, 1, 1, 1] [2019-08-05 10:26:52,957 INFO L418 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:52,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:52,957 INFO L82 PathProgramCache]: Analyzing trace with hash -1070014036, now seen corresponding path program 45 times [2019-08-05 10:26:52,958 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:52,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:52,981 WARN L254 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 189 conjunts are in the unsatisfiable core [2019-08-05 10:26:52,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:54,274 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:26:54,274 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:54,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-05 10:26:54,274 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-05 10:26:54,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-05 10:26:54,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:26:54,275 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 48 states. [2019-08-05 10:26:56,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:56,083 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-08-05 10:26:56,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-05 10:26:56,083 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 48 [2019-08-05 10:26:56,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:56,084 INFO L225 Difference]: With dead ends: 50 [2019-08-05 10:26:56,084 INFO L226 Difference]: Without dead ends: 50 [2019-08-05 10:26:56,085 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:26:56,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-08-05 10:26:56,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-08-05 10:26:56,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-08-05 10:26:56,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-08-05 10:26:56,087 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2019-08-05 10:26:56,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:56,087 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2019-08-05 10:26:56,087 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-05 10:26:56,087 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-08-05 10:26:56,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-08-05 10:26:56,088 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:56,088 INFO L399 BasicCegarLoop]: trace histogram [46, 1, 1, 1] [2019-08-05 10:26:56,088 INFO L418 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:56,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:56,088 INFO L82 PathProgramCache]: Analyzing trace with hash 1189305059, now seen corresponding path program 46 times [2019-08-05 10:26:56,089 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:56,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:56,115 WARN L254 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 193 conjunts are in the unsatisfiable core [2019-08-05 10:26:56,117 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:57,974 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:26:57,974 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:57,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-08-05 10:26:57,975 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-05 10:26:57,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-05 10:26:57,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:26:57,975 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 49 states. [2019-08-05 10:26:59,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:59,755 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-08-05 10:26:59,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-08-05 10:26:59,755 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 49 [2019-08-05 10:26:59,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:59,756 INFO L225 Difference]: With dead ends: 51 [2019-08-05 10:26:59,756 INFO L226 Difference]: Without dead ends: 51 [2019-08-05 10:26:59,757 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:26:59,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-05 10:26:59,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-08-05 10:26:59,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-08-05 10:26:59,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-08-05 10:26:59,759 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2019-08-05 10:26:59,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:59,759 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-08-05 10:26:59,759 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-05 10:26:59,760 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-08-05 10:26:59,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-08-05 10:26:59,760 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:59,760 INFO L399 BasicCegarLoop]: trace histogram [47, 1, 1, 1] [2019-08-05 10:26:59,761 INFO L418 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:59,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:59,761 INFO L82 PathProgramCache]: Analyzing trace with hash -1786247028, now seen corresponding path program 47 times [2019-08-05 10:26:59,761 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:59,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:59,789 WARN L254 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 197 conjunts are in the unsatisfiable core [2019-08-05 10:26:59,791 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:27:01,389 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:01,390 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:27:01,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-05 10:27:01,390 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-05 10:27:01,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-05 10:27:01,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:27:01,391 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 50 states. [2019-08-05 10:27:03,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:27:03,213 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-08-05 10:27:03,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-05 10:27:03,214 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 50 [2019-08-05 10:27:03,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:27:03,215 INFO L225 Difference]: With dead ends: 52 [2019-08-05 10:27:03,215 INFO L226 Difference]: Without dead ends: 52 [2019-08-05 10:27:03,216 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:27:03,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-08-05 10:27:03,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-08-05 10:27:03,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-05 10:27:03,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-08-05 10:27:03,218 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2019-08-05 10:27:03,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:27:03,219 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-08-05 10:27:03,219 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-05 10:27:03,219 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-08-05 10:27:03,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-08-05 10:27:03,219 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:27:03,220 INFO L399 BasicCegarLoop]: trace histogram [48, 1, 1, 1] [2019-08-05 10:27:03,220 INFO L418 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:27:03,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:27:03,220 INFO L82 PathProgramCache]: Analyzing trace with hash 460918787, now seen corresponding path program 48 times [2019-08-05 10:27:03,221 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:27:03,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:27:03,248 WARN L254 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 201 conjunts are in the unsatisfiable core [2019-08-05 10:27:03,249 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:27:04,746 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:04,746 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:27:04,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-08-05 10:27:04,747 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-05 10:27:04,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-05 10:27:04,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:27:04,747 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 51 states. [2019-08-05 10:27:06,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:27:06,718 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-08-05 10:27:06,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-05 10:27:06,719 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 51 [2019-08-05 10:27:06,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:27:06,719 INFO L225 Difference]: With dead ends: 53 [2019-08-05 10:27:06,720 INFO L226 Difference]: Without dead ends: 53 [2019-08-05 10:27:06,720 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:27:06,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-08-05 10:27:06,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-08-05 10:27:06,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-08-05 10:27:06,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-08-05 10:27:06,723 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2019-08-05 10:27:06,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:27:06,723 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-08-05 10:27:06,723 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-08-05 10:27:06,723 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-08-05 10:27:06,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-08-05 10:27:06,723 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:27:06,724 INFO L399 BasicCegarLoop]: trace histogram [49, 1, 1, 1] [2019-08-05 10:27:06,724 INFO L418 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:27:06,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:27:06,724 INFO L82 PathProgramCache]: Analyzing trace with hash 1403582316, now seen corresponding path program 49 times [2019-08-05 10:27:06,725 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:27:06,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:27:06,748 WARN L254 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 205 conjunts are in the unsatisfiable core [2019-08-05 10:27:06,749 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:27:08,241 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:08,241 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:27:08,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-05 10:27:08,241 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-05 10:27:08,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-05 10:27:08,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:27:08,242 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 52 states. [2019-08-05 10:27:10,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:27:10,342 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-08-05 10:27:10,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-05 10:27:10,342 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 52 [2019-08-05 10:27:10,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:27:10,343 INFO L225 Difference]: With dead ends: 54 [2019-08-05 10:27:10,343 INFO L226 Difference]: Without dead ends: 54 [2019-08-05 10:27:10,343 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:27:10,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-05 10:27:10,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-08-05 10:27:10,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-08-05 10:27:10,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2019-08-05 10:27:10,345 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2019-08-05 10:27:10,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:27:10,345 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2019-08-05 10:27:10,345 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-05 10:27:10,345 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2019-08-05 10:27:10,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-08-05 10:27:10,346 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:27:10,346 INFO L399 BasicCegarLoop]: trace histogram [50, 1, 1, 1] [2019-08-05 10:27:10,346 INFO L418 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:27:10,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:27:10,346 INFO L82 PathProgramCache]: Analyzing trace with hash 561380643, now seen corresponding path program 50 times [2019-08-05 10:27:10,347 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:27:10,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:27:10,376 WARN L254 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 209 conjunts are in the unsatisfiable core [2019-08-05 10:27:10,378 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:27:12,073 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:12,074 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:27:12,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-08-05 10:27:12,074 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-08-05 10:27:12,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-08-05 10:27:12,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:27:12,075 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 53 states. [2019-08-05 10:27:14,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:27:14,140 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-08-05 10:27:14,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-08-05 10:27:14,140 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 53 [2019-08-05 10:27:14,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:27:14,141 INFO L225 Difference]: With dead ends: 55 [2019-08-05 10:27:14,142 INFO L226 Difference]: Without dead ends: 55 [2019-08-05 10:27:14,142 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:27:14,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-08-05 10:27:14,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-08-05 10:27:14,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-08-05 10:27:14,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-08-05 10:27:14,144 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2019-08-05 10:27:14,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:27:14,144 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-08-05 10:27:14,145 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-08-05 10:27:14,145 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-08-05 10:27:14,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 10:27:14,145 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:27:14,145 INFO L399 BasicCegarLoop]: trace histogram [51, 1, 1, 1] [2019-08-05 10:27:14,145 INFO L418 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:27:14,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:27:14,146 INFO L82 PathProgramCache]: Analyzing trace with hash 222932556, now seen corresponding path program 51 times [2019-08-05 10:27:14,147 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:27:14,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:27:14,177 WARN L254 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 213 conjunts are in the unsatisfiable core [2019-08-05 10:27:14,179 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:27:15,956 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:15,956 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:27:15,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-05 10:27:15,957 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-08-05 10:27:15,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-08-05 10:27:15,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:27:15,957 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 54 states. [2019-08-05 10:27:18,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:27:18,113 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-08-05 10:27:18,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-05 10:27:18,113 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 54 [2019-08-05 10:27:18,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:27:18,114 INFO L225 Difference]: With dead ends: 56 [2019-08-05 10:27:18,114 INFO L226 Difference]: Without dead ends: 56 [2019-08-05 10:27:18,115 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:27:18,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-08-05 10:27:18,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-08-05 10:27:18,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-08-05 10:27:18,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-08-05 10:27:18,117 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2019-08-05 10:27:18,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:27:18,117 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-08-05 10:27:18,118 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-08-05 10:27:18,118 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-08-05 10:27:18,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-08-05 10:27:18,118 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:27:18,118 INFO L399 BasicCegarLoop]: trace histogram [52, 1, 1, 1] [2019-08-05 10:27:18,119 INFO L418 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:27:18,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:27:18,119 INFO L82 PathProgramCache]: Analyzing trace with hash -1679023549, now seen corresponding path program 52 times [2019-08-05 10:27:18,120 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:27:18,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:27:18,140 WARN L254 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 217 conjunts are in the unsatisfiable core [2019-08-05 10:27:18,142 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:27:19,745 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:19,745 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:27:19,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-08-05 10:27:19,746 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-08-05 10:27:19,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-08-05 10:27:19,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:27:19,746 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 55 states. [2019-08-05 10:27:22,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:27:22,121 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-08-05 10:27:22,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-05 10:27:22,122 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 55 [2019-08-05 10:27:22,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:27:22,123 INFO L225 Difference]: With dead ends: 57 [2019-08-05 10:27:22,123 INFO L226 Difference]: Without dead ends: 57 [2019-08-05 10:27:22,124 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:27:22,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-05 10:27:22,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-08-05 10:27:22,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-08-05 10:27:22,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-08-05 10:27:22,126 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2019-08-05 10:27:22,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:27:22,127 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-08-05 10:27:22,127 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-08-05 10:27:22,127 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-08-05 10:27:22,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-08-05 10:27:22,127 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:27:22,128 INFO L399 BasicCegarLoop]: trace histogram [53, 1, 1, 1] [2019-08-05 10:27:22,128 INFO L418 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:27:22,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:27:22,128 INFO L82 PathProgramCache]: Analyzing trace with hash -510120660, now seen corresponding path program 53 times [2019-08-05 10:27:22,129 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:27:22,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:27:22,159 WARN L254 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 221 conjunts are in the unsatisfiable core [2019-08-05 10:27:22,161 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:27:24,853 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:24,853 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:27:24,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-08-05 10:27:24,853 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-08-05 10:27:24,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-08-05 10:27:24,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:27:24,854 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 56 states. [2019-08-05 10:27:27,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:27:27,261 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-08-05 10:27:27,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-08-05 10:27:27,262 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 56 [2019-08-05 10:27:27,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:27:27,263 INFO L225 Difference]: With dead ends: 58 [2019-08-05 10:27:27,263 INFO L226 Difference]: Without dead ends: 58 [2019-08-05 10:27:27,264 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:27:27,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-08-05 10:27:27,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-08-05 10:27:27,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-08-05 10:27:27,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-08-05 10:27:27,266 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2019-08-05 10:27:27,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:27:27,266 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-08-05 10:27:27,266 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-08-05 10:27:27,267 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-08-05 10:27:27,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-08-05 10:27:27,267 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:27:27,267 INFO L399 BasicCegarLoop]: trace histogram [54, 1, 1, 1] [2019-08-05 10:27:27,267 INFO L418 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:27:27,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:27:27,267 INFO L82 PathProgramCache]: Analyzing trace with hash 1366130531, now seen corresponding path program 54 times [2019-08-05 10:27:27,268 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:27:27,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:27:27,300 WARN L254 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 225 conjunts are in the unsatisfiable core [2019-08-05 10:27:27,302 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:27:29,092 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:29,092 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:27:29,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2019-08-05 10:27:29,093 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-08-05 10:27:29,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-08-05 10:27:29,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:27:29,093 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 57 states. [2019-08-05 10:27:31,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:27:31,620 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-08-05 10:27:31,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-08-05 10:27:31,621 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 57 [2019-08-05 10:27:31,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:27:31,622 INFO L225 Difference]: With dead ends: 59 [2019-08-05 10:27:31,622 INFO L226 Difference]: Without dead ends: 59 [2019-08-05 10:27:31,622 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:27:31,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-08-05 10:27:31,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-08-05 10:27:31,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-08-05 10:27:31,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2019-08-05 10:27:31,624 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2019-08-05 10:27:31,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:27:31,625 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2019-08-05 10:27:31,625 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-08-05 10:27:31,625 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2019-08-05 10:27:31,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-08-05 10:27:31,625 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:27:31,626 INFO L399 BasicCegarLoop]: trace histogram [55, 1, 1, 1] [2019-08-05 10:27:31,626 INFO L418 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:27:31,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:27:31,626 INFO L82 PathProgramCache]: Analyzing trace with hash -599624692, now seen corresponding path program 55 times [2019-08-05 10:27:31,627 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:27:31,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:27:31,650 WARN L254 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 229 conjunts are in the unsatisfiable core [2019-08-05 10:27:31,652 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:27:33,458 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:33,458 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:27:33,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-08-05 10:27:33,459 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-08-05 10:27:33,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-08-05 10:27:33,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 10:27:33,459 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 58 states. [2019-08-05 10:27:36,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:27:36,030 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-08-05 10:27:36,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-08-05 10:27:36,031 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 58 [2019-08-05 10:27:36,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:27:36,031 INFO L225 Difference]: With dead ends: 60 [2019-08-05 10:27:36,032 INFO L226 Difference]: Without dead ends: 60 [2019-08-05 10:27:36,032 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 10:27:36,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-05 10:27:36,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-08-05 10:27:36,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-08-05 10:27:36,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2019-08-05 10:27:36,035 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2019-08-05 10:27:36,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:27:36,035 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2019-08-05 10:27:36,036 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-08-05 10:27:36,036 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2019-08-05 10:27:36,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-08-05 10:27:36,036 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:27:36,036 INFO L399 BasicCegarLoop]: trace histogram [56, 1, 1, 1] [2019-08-05 10:27:36,036 INFO L418 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:27:36,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:27:36,037 INFO L82 PathProgramCache]: Analyzing trace with hash -1408494461, now seen corresponding path program 56 times [2019-08-05 10:27:36,037 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:27:36,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:27:36,071 WARN L254 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 233 conjunts are in the unsatisfiable core [2019-08-05 10:27:36,073 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:27:38,080 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:38,080 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:27:38,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2019-08-05 10:27:38,085 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-08-05 10:27:38,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-08-05 10:27:38,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:27:38,086 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 59 states. [2019-08-05 10:27:40,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:27:40,631 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-08-05 10:27:40,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-08-05 10:27:40,632 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 59 [2019-08-05 10:27:40,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:27:40,633 INFO L225 Difference]: With dead ends: 61 [2019-08-05 10:27:40,633 INFO L226 Difference]: Without dead ends: 61 [2019-08-05 10:27:40,633 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:27:40,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-08-05 10:27:40,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-08-05 10:27:40,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-08-05 10:27:40,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-08-05 10:27:40,636 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2019-08-05 10:27:40,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:27:40,636 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-08-05 10:27:40,636 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-08-05 10:27:40,636 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-08-05 10:27:40,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-08-05 10:27:40,637 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:27:40,637 INFO L399 BasicCegarLoop]: trace histogram [57, 1, 1, 1] [2019-08-05 10:27:40,637 INFO L418 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:27:40,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:27:40,638 INFO L82 PathProgramCache]: Analyzing trace with hash -713653524, now seen corresponding path program 57 times [2019-08-05 10:27:40,638 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:27:40,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:27:40,674 WARN L254 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 237 conjunts are in the unsatisfiable core [2019-08-05 10:27:40,676 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:27:42,706 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:27:42,706 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:27:42,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2019-08-05 10:27:42,706 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-08-05 10:27:42,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-08-05 10:27:42,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:27:42,707 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 60 states. [2019-08-05 10:27:45,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:27:45,340 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-08-05 10:27:45,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-08-05 10:27:45,340 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 60 [2019-08-05 10:27:45,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:27:45,341 INFO L225 Difference]: With dead ends: 62 [2019-08-05 10:27:45,341 INFO L226 Difference]: Without dead ends: 62 [2019-08-05 10:27:45,342 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:27:45,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-08-05 10:27:45,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-08-05 10:27:45,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-08-05 10:27:45,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2019-08-05 10:27:45,345 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2019-08-05 10:27:45,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:27:45,345 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2019-08-05 10:27:45,345 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-08-05 10:27:45,345 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-08-05 10:27:45,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 10:27:45,346 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:27:45,346 INFO L399 BasicCegarLoop]: trace histogram [58, 1, 1, 1] [2019-08-05 10:27:45,346 INFO L418 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:27:45,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:27:45,346 INFO L82 PathProgramCache]: Analyzing trace with hash -648420957, now seen corresponding path program 58 times [2019-08-05 10:27:45,347 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:27:45,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:27:45,382 WARN L254 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 241 conjunts are in the unsatisfiable core [2019-08-05 10:27:45,384 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:27:47,697 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:27:47,698 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:27:47,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2019-08-05 10:27:47,698 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-08-05 10:27:47,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-08-05 10:27:47,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 10:27:47,698 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 61 states. [2019-08-05 10:27:50,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:27:50,423 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-08-05 10:27:50,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-08-05 10:27:50,424 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 61 [2019-08-05 10:27:50,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:27:50,425 INFO L225 Difference]: With dead ends: 63 [2019-08-05 10:27:50,425 INFO L226 Difference]: Without dead ends: 63 [2019-08-05 10:27:50,425 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 10:27:50,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-05 10:27:50,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-08-05 10:27:50,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-08-05 10:27:50,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2019-08-05 10:27:50,427 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2019-08-05 10:27:50,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:27:50,428 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2019-08-05 10:27:50,428 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-08-05 10:27:50,428 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2019-08-05 10:27:50,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-08-05 10:27:50,428 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:27:50,428 INFO L399 BasicCegarLoop]: trace histogram [59, 1, 1, 1] [2019-08-05 10:27:50,429 INFO L418 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:27:50,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:27:50,429 INFO L82 PathProgramCache]: Analyzing trace with hash 1373788620, now seen corresponding path program 59 times [2019-08-05 10:27:50,430 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:27:50,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:27:50,463 WARN L254 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 245 conjunts are in the unsatisfiable core [2019-08-05 10:27:50,464 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:27:52,764 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:27:52,764 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:27:52,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2019-08-05 10:27:52,765 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-08-05 10:27:52,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-08-05 10:27:52,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 10:27:52,765 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 62 states. [2019-08-05 10:27:55,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:27:55,583 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2019-08-05 10:27:55,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-08-05 10:27:55,584 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 62 [2019-08-05 10:27:55,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:27:55,584 INFO L225 Difference]: With dead ends: 64 [2019-08-05 10:27:55,585 INFO L226 Difference]: Without dead ends: 64 [2019-08-05 10:27:55,585 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 10:27:55,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-08-05 10:27:55,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-08-05 10:27:55,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-08-05 10:27:55,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2019-08-05 10:27:55,587 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2019-08-05 10:27:55,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:27:55,588 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2019-08-05 10:27:55,588 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-08-05 10:27:55,588 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2019-08-05 10:27:55,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-08-05 10:27:55,588 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:27:55,588 INFO L399 BasicCegarLoop]: trace histogram [60, 1, 1, 1] [2019-08-05 10:27:55,588 INFO L418 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:27:55,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:27:55,589 INFO L82 PathProgramCache]: Analyzing trace with hash -362223933, now seen corresponding path program 60 times [2019-08-05 10:27:55,589 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:27:55,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:27:55,626 WARN L254 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 249 conjunts are in the unsatisfiable core [2019-08-05 10:27:55,628 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:27:58,035 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:27:58,035 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:27:58,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2019-08-05 10:27:58,036 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-08-05 10:27:58,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-08-05 10:27:58,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 10:27:58,036 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 63 states. [2019-08-05 10:28:00,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:28:00,962 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-08-05 10:28:00,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-08-05 10:28:00,962 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 63 [2019-08-05 10:28:00,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:28:00,963 INFO L225 Difference]: With dead ends: 65 [2019-08-05 10:28:00,963 INFO L226 Difference]: Without dead ends: 65 [2019-08-05 10:28:00,964 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 10:28:00,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-08-05 10:28:00,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-08-05 10:28:00,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-08-05 10:28:00,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-08-05 10:28:00,966 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2019-08-05 10:28:00,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:28:00,966 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-08-05 10:28:00,966 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-08-05 10:28:00,967 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-08-05 10:28:00,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-08-05 10:28:00,967 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:28:00,967 INFO L399 BasicCegarLoop]: trace histogram [61, 1, 1, 1] [2019-08-05 10:28:00,967 INFO L418 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:28:00,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:28:00,968 INFO L82 PathProgramCache]: Analyzing trace with hash 1655961772, now seen corresponding path program 61 times [2019-08-05 10:28:00,968 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:28:00,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:28:00,997 WARN L254 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 253 conjunts are in the unsatisfiable core [2019-08-05 10:28:00,999 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:28:03,343 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:03,343 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:28:03,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2019-08-05 10:28:03,344 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-08-05 10:28:03,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-08-05 10:28:03,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 10:28:03,344 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 64 states. [2019-08-05 10:28:06,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:28:06,362 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-08-05 10:28:06,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-08-05 10:28:06,362 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 64 [2019-08-05 10:28:06,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:28:06,362 INFO L225 Difference]: With dead ends: 66 [2019-08-05 10:28:06,362 INFO L226 Difference]: Without dead ends: 66 [2019-08-05 10:28:06,363 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 10:28:06,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-05 10:28:06,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-08-05 10:28:06,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-08-05 10:28:06,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2019-08-05 10:28:06,365 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2019-08-05 10:28:06,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:28:06,365 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2019-08-05 10:28:06,365 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-08-05 10:28:06,365 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-08-05 10:28:06,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-08-05 10:28:06,366 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:28:06,366 INFO L399 BasicCegarLoop]: trace histogram [62, 1, 1, 1] [2019-08-05 10:28:06,366 INFO L418 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:28:06,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:28:06,366 INFO L82 PathProgramCache]: Analyzing trace with hash -204790813, now seen corresponding path program 62 times [2019-08-05 10:28:06,367 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:28:06,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:28:06,406 WARN L254 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 257 conjunts are in the unsatisfiable core [2019-08-05 10:28:06,408 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:28:08,787 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:08,787 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:28:08,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2019-08-05 10:28:08,787 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-08-05 10:28:08,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-08-05 10:28:08,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 10:28:08,788 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 65 states. [2019-08-05 10:28:12,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:28:12,037 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2019-08-05 10:28:12,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-08-05 10:28:12,038 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 65 [2019-08-05 10:28:12,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:28:12,039 INFO L225 Difference]: With dead ends: 67 [2019-08-05 10:28:12,039 INFO L226 Difference]: Without dead ends: 67 [2019-08-05 10:28:12,039 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 10:28:12,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-08-05 10:28:12,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-08-05 10:28:12,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-08-05 10:28:12,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-08-05 10:28:12,042 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2019-08-05 10:28:12,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:28:12,042 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2019-08-05 10:28:12,042 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-08-05 10:28:12,042 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-08-05 10:28:12,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-08-05 10:28:12,043 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:28:12,043 INFO L399 BasicCegarLoop]: trace histogram [63, 1, 1, 1] [2019-08-05 10:28:12,043 INFO L418 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:28:12,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:28:12,044 INFO L82 PathProgramCache]: Analyzing trace with hash -2053546100, now seen corresponding path program 63 times [2019-08-05 10:28:12,044 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:28:12,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:28:12,078 WARN L254 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 261 conjunts are in the unsatisfiable core [2019-08-05 10:28:12,080 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:28:14,357 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:14,357 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:28:14,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2019-08-05 10:28:14,358 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-08-05 10:28:14,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-08-05 10:28:14,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 10:28:14,358 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 66 states. [2019-08-05 10:28:17,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:28:17,702 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-08-05 10:28:17,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-08-05 10:28:17,702 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 66 [2019-08-05 10:28:17,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:28:17,703 INFO L225 Difference]: With dead ends: 68 [2019-08-05 10:28:17,703 INFO L226 Difference]: Without dead ends: 68 [2019-08-05 10:28:17,704 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 10:28:17,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-08-05 10:28:17,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-08-05 10:28:17,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-08-05 10:28:17,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2019-08-05 10:28:17,707 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2019-08-05 10:28:17,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:28:17,707 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2019-08-05 10:28:17,707 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-08-05 10:28:17,707 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2019-08-05 10:28:17,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-08-05 10:28:17,708 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:28:17,708 INFO L399 BasicCegarLoop]: trace histogram [64, 1, 1, 1] [2019-08-05 10:28:17,708 INFO L418 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:28:17,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:28:17,708 INFO L82 PathProgramCache]: Analyzing trace with hash 764582147, now seen corresponding path program 64 times [2019-08-05 10:28:17,709 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:28:17,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:28:17,738 WARN L254 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 265 conjunts are in the unsatisfiable core [2019-08-05 10:28:17,739 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:28:20,082 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:20,083 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:28:20,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2019-08-05 10:28:20,083 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-08-05 10:28:20,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-08-05 10:28:20,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:28:20,083 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 67 states. [2019-08-05 10:28:23,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:28:23,542 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2019-08-05 10:28:23,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-08-05 10:28:23,543 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 67 [2019-08-05 10:28:23,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:28:23,544 INFO L225 Difference]: With dead ends: 69 [2019-08-05 10:28:23,544 INFO L226 Difference]: Without dead ends: 69 [2019-08-05 10:28:23,544 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:28:23,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-05 10:28:23,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-08-05 10:28:23,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-05 10:28:23,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2019-08-05 10:28:23,547 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2019-08-05 10:28:23,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:28:23,547 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2019-08-05 10:28:23,547 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-08-05 10:28:23,547 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2019-08-05 10:28:23,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 10:28:23,548 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:28:23,548 INFO L399 BasicCegarLoop]: trace histogram [65, 1, 1, 1] [2019-08-05 10:28:23,548 INFO L418 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:28:23,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:28:23,548 INFO L82 PathProgramCache]: Analyzing trace with hash -2067755412, now seen corresponding path program 65 times [2019-08-05 10:28:23,549 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:28:23,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:28:23,576 WARN L254 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 269 conjunts are in the unsatisfiable core [2019-08-05 10:28:23,577 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:28:25,973 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:25,973 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:28:25,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2019-08-05 10:28:25,974 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-08-05 10:28:25,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-08-05 10:28:25,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:28:25,974 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 68 states. [2019-08-05 10:28:29,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:28:29,492 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-08-05 10:28:29,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-08-05 10:28:29,493 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 68 [2019-08-05 10:28:29,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:28:29,493 INFO L225 Difference]: With dead ends: 70 [2019-08-05 10:28:29,494 INFO L226 Difference]: Without dead ends: 70 [2019-08-05 10:28:29,494 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:28:29,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-08-05 10:28:29,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-08-05 10:28:29,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-08-05 10:28:29,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2019-08-05 10:28:29,496 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2019-08-05 10:28:29,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:28:29,497 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2019-08-05 10:28:29,497 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-08-05 10:28:29,497 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2019-08-05 10:28:29,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-08-05 10:28:29,497 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:28:29,497 INFO L399 BasicCegarLoop]: trace histogram [66, 1, 1, 1] [2019-08-05 10:28:29,498 INFO L418 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:28:29,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:28:29,498 INFO L82 PathProgramCache]: Analyzing trace with hash 324093475, now seen corresponding path program 66 times [2019-08-05 10:28:29,498 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:28:29,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:28:29,528 WARN L254 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 273 conjunts are in the unsatisfiable core [2019-08-05 10:28:29,530 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:28:32,260 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:32,261 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:28:32,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2019-08-05 10:28:32,261 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-08-05 10:28:32,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-08-05 10:28:32,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 10:28:32,262 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 69 states. [2019-08-05 10:28:36,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:28:36,049 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2019-08-05 10:28:36,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-08-05 10:28:36,049 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 69 [2019-08-05 10:28:36,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:28:36,050 INFO L225 Difference]: With dead ends: 71 [2019-08-05 10:28:36,050 INFO L226 Difference]: Without dead ends: 71 [2019-08-05 10:28:36,051 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 10:28:36,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-08-05 10:28:36,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-08-05 10:28:36,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-08-05 10:28:36,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2019-08-05 10:28:36,053 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2019-08-05 10:28:36,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:28:36,053 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2019-08-05 10:28:36,053 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-08-05 10:28:36,054 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-08-05 10:28:36,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-08-05 10:28:36,054 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:28:36,054 INFO L399 BasicCegarLoop]: trace histogram [67, 1, 1, 1] [2019-08-05 10:28:36,054 INFO L418 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:28:36,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:28:36,055 INFO L82 PathProgramCache]: Analyzing trace with hash 1456964940, now seen corresponding path program 67 times [2019-08-05 10:28:36,055 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:28:36,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:28:36,089 WARN L254 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 277 conjunts are in the unsatisfiable core [2019-08-05 10:28:36,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:28:39,070 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:39,071 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:28:39,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2019-08-05 10:28:39,071 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-08-05 10:28:39,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-08-05 10:28:39,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 10:28:39,072 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 70 states. [2019-08-05 10:28:42,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:28:42,853 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2019-08-05 10:28:42,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-08-05 10:28:42,854 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 70 [2019-08-05 10:28:42,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:28:42,854 INFO L225 Difference]: With dead ends: 72 [2019-08-05 10:28:42,855 INFO L226 Difference]: Without dead ends: 72 [2019-08-05 10:28:42,855 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 10:28:42,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-08-05 10:28:42,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-08-05 10:28:42,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-08-05 10:28:42,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2019-08-05 10:28:42,858 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2019-08-05 10:28:42,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:28:42,858 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2019-08-05 10:28:42,858 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-08-05 10:28:42,858 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2019-08-05 10:28:42,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-08-05 10:28:42,859 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:28:42,859 INFO L399 BasicCegarLoop]: trace histogram [68, 1, 1, 1] [2019-08-05 10:28:42,859 INFO L418 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:28:42,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:28:42,860 INFO L82 PathProgramCache]: Analyzing trace with hash -2078725309, now seen corresponding path program 68 times [2019-08-05 10:28:42,860 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:28:42,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:28:42,906 WARN L254 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 281 conjunts are in the unsatisfiable core [2019-08-05 10:28:42,909 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:28:46,895 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:46,895 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:28:46,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2019-08-05 10:28:46,896 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-08-05 10:28:46,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-08-05 10:28:46,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 10:28:46,896 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 71 states. [2019-08-05 10:28:50,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:28:50,684 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2019-08-05 10:28:50,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-08-05 10:28:50,684 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 71 [2019-08-05 10:28:50,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:28:50,685 INFO L225 Difference]: With dead ends: 73 [2019-08-05 10:28:50,685 INFO L226 Difference]: Without dead ends: 73 [2019-08-05 10:28:50,686 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 10:28:50,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-08-05 10:28:50,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-08-05 10:28:50,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-08-05 10:28:50,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-08-05 10:28:50,688 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2019-08-05 10:28:50,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:28:50,689 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2019-08-05 10:28:50,689 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-08-05 10:28:50,689 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-08-05 10:28:50,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-08-05 10:28:50,689 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:28:50,689 INFO L399 BasicCegarLoop]: trace histogram [69, 1, 1, 1] [2019-08-05 10:28:50,690 INFO L418 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:28:50,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:28:50,690 INFO L82 PathProgramCache]: Analyzing trace with hash -15973332, now seen corresponding path program 69 times [2019-08-05 10:28:50,691 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:28:50,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:28:50,738 WARN L254 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 285 conjunts are in the unsatisfiable core [2019-08-05 10:28:50,740 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:28:53,655 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:28:53,655 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:28:53,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2019-08-05 10:28:53,656 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-08-05 10:28:53,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-08-05 10:28:53,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 10:28:53,656 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 72 states. [2019-08-05 10:28:57,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:28:57,523 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-08-05 10:28:57,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-08-05 10:28:57,524 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 72 [2019-08-05 10:28:57,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:28:57,525 INFO L225 Difference]: With dead ends: 74 [2019-08-05 10:28:57,525 INFO L226 Difference]: Without dead ends: 74 [2019-08-05 10:28:57,525 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 10:28:57,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-08-05 10:28:57,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-08-05 10:28:57,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-08-05 10:28:57,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2019-08-05 10:28:57,529 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2019-08-05 10:28:57,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:28:57,529 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2019-08-05 10:28:57,529 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-08-05 10:28:57,529 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2019-08-05 10:28:57,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-08-05 10:28:57,530 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:28:57,530 INFO L399 BasicCegarLoop]: trace histogram [70, 1, 1, 1] [2019-08-05 10:28:57,530 INFO L418 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:28:57,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:28:57,530 INFO L82 PathProgramCache]: Analyzing trace with hash -495171485, now seen corresponding path program 70 times [2019-08-05 10:28:57,531 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:28:57,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:28:57,594 WARN L254 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 289 conjunts are in the unsatisfiable core [2019-08-05 10:28:57,596 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:29:00,585 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:00,585 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:29:00,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2019-08-05 10:29:00,586 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-08-05 10:29:00,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-08-05 10:29:00,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 10:29:00,586 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 73 states. [2019-08-05 10:29:04,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:29:04,680 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-08-05 10:29:04,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-08-05 10:29:04,681 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 73 [2019-08-05 10:29:04,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:29:04,682 INFO L225 Difference]: With dead ends: 75 [2019-08-05 10:29:04,682 INFO L226 Difference]: Without dead ends: 75 [2019-08-05 10:29:04,682 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 10:29:04,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-08-05 10:29:04,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-08-05 10:29:04,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-05 10:29:04,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2019-08-05 10:29:04,685 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2019-08-05 10:29:04,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:29:04,685 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2019-08-05 10:29:04,686 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-08-05 10:29:04,686 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2019-08-05 10:29:04,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-08-05 10:29:04,686 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:29:04,686 INFO L399 BasicCegarLoop]: trace histogram [71, 1, 1, 1] [2019-08-05 10:29:04,687 INFO L418 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:29:04,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:29:04,687 INFO L82 PathProgramCache]: Analyzing trace with hash 1829554956, now seen corresponding path program 71 times [2019-08-05 10:29:04,687 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:29:04,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:29:04,739 WARN L254 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 293 conjunts are in the unsatisfiable core [2019-08-05 10:29:04,741 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:29:08,178 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:08,178 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:29:08,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2019-08-05 10:29:08,179 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-08-05 10:29:08,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-08-05 10:29:08,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 10:29:08,180 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 74 states. [2019-08-05 10:29:12,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:29:12,285 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2019-08-05 10:29:12,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-08-05 10:29:12,285 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 74 [2019-08-05 10:29:12,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:29:12,286 INFO L225 Difference]: With dead ends: 76 [2019-08-05 10:29:12,286 INFO L226 Difference]: Without dead ends: 76 [2019-08-05 10:29:12,287 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 10:29:12,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-08-05 10:29:12,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-08-05 10:29:12,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-08-05 10:29:12,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2019-08-05 10:29:12,289 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2019-08-05 10:29:12,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:29:12,289 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2019-08-05 10:29:12,289 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-08-05 10:29:12,290 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2019-08-05 10:29:12,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-08-05 10:29:12,290 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:29:12,290 INFO L399 BasicCegarLoop]: trace histogram [72, 1, 1, 1] [2019-08-05 10:29:12,290 INFO L418 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:29:12,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:29:12,291 INFO L82 PathProgramCache]: Analyzing trace with hash 881630595, now seen corresponding path program 72 times [2019-08-05 10:29:12,291 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:29:12,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:29:12,352 WARN L254 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 297 conjunts are in the unsatisfiable core [2019-08-05 10:29:12,353 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:29:15,449 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:15,449 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:29:15,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2019-08-05 10:29:15,450 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-08-05 10:29:15,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-08-05 10:29:15,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 10:29:15,450 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 75 states. [2019-08-05 10:29:19,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:29:19,787 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2019-08-05 10:29:19,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-08-05 10:29:19,788 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 75 [2019-08-05 10:29:19,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:29:19,789 INFO L225 Difference]: With dead ends: 77 [2019-08-05 10:29:19,789 INFO L226 Difference]: Without dead ends: 77 [2019-08-05 10:29:19,789 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 10:29:19,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-08-05 10:29:19,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-08-05 10:29:19,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-05 10:29:19,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-08-05 10:29:19,792 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2019-08-05 10:29:19,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:29:19,792 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-08-05 10:29:19,793 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-08-05 10:29:19,793 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-08-05 10:29:19,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-08-05 10:29:19,793 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:29:19,793 INFO L399 BasicCegarLoop]: trace histogram [73, 1, 1, 1] [2019-08-05 10:29:19,794 INFO L418 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:29:19,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:29:19,794 INFO L82 PathProgramCache]: Analyzing trace with hash 1560746476, now seen corresponding path program 73 times [2019-08-05 10:29:19,794 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:29:19,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:29:19,839 WARN L254 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 301 conjunts are in the unsatisfiable core [2019-08-05 10:29:19,840 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:29:22,858 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:22,858 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:29:22,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2019-08-05 10:29:22,858 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-08-05 10:29:22,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-08-05 10:29:22,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 10:29:22,859 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 76 states. [2019-08-05 10:29:27,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:29:27,347 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2019-08-05 10:29:27,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-08-05 10:29:27,348 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 76 [2019-08-05 10:29:27,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:29:27,348 INFO L225 Difference]: With dead ends: 78 [2019-08-05 10:29:27,349 INFO L226 Difference]: Without dead ends: 78 [2019-08-05 10:29:27,349 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 10:29:27,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-08-05 10:29:27,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-08-05 10:29:27,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-08-05 10:29:27,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2019-08-05 10:29:27,351 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2019-08-05 10:29:27,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:29:27,351 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2019-08-05 10:29:27,351 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-08-05 10:29:27,351 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2019-08-05 10:29:27,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 10:29:27,352 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:29:27,352 INFO L399 BasicCegarLoop]: trace histogram [74, 1, 1, 1] [2019-08-05 10:29:27,352 INFO L418 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:29:27,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:29:27,352 INFO L82 PathProgramCache]: Analyzing trace with hash 1138502307, now seen corresponding path program 74 times [2019-08-05 10:29:27,353 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:29:27,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:29:27,404 WARN L254 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 305 conjunts are in the unsatisfiable core [2019-08-05 10:29:27,406 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:29:31,237 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:31,238 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:29:31,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2019-08-05 10:29:31,238 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-08-05 10:29:31,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-08-05 10:29:31,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 10:29:31,238 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 77 states. [2019-08-05 10:29:35,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:29:35,790 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2019-08-05 10:29:35,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-08-05 10:29:35,791 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 77 [2019-08-05 10:29:35,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:29:35,792 INFO L225 Difference]: With dead ends: 79 [2019-08-05 10:29:35,792 INFO L226 Difference]: Without dead ends: 79 [2019-08-05 10:29:35,792 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 10:29:35,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-08-05 10:29:35,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-08-05 10:29:35,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-08-05 10:29:35,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2019-08-05 10:29:35,794 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77 [2019-08-05 10:29:35,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:29:35,795 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2019-08-05 10:29:35,795 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-08-05 10:29:35,795 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2019-08-05 10:29:35,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-08-05 10:29:35,795 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:29:35,795 INFO L399 BasicCegarLoop]: trace histogram [75, 1, 1, 1] [2019-08-05 10:29:35,796 INFO L418 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:29:35,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:29:35,796 INFO L82 PathProgramCache]: Analyzing trace with hash 933834956, now seen corresponding path program 75 times [2019-08-05 10:29:35,796 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:29:35,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:29:35,834 WARN L254 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 309 conjunts are in the unsatisfiable core [2019-08-05 10:29:35,836 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:29:39,212 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,212 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:29:39,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2019-08-05 10:29:39,213 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-08-05 10:29:39,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-08-05 10:29:39,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 10:29:39,213 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 78 states. [2019-08-05 10:29:44,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:29:44,040 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2019-08-05 10:29:44,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-08-05 10:29:44,040 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 78 [2019-08-05 10:29:44,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:29:44,041 INFO L225 Difference]: With dead ends: 80 [2019-08-05 10:29:44,041 INFO L226 Difference]: Without dead ends: 80 [2019-08-05 10:29:44,042 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 10:29:44,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-08-05 10:29:44,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-08-05 10:29:44,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-08-05 10:29:44,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2019-08-05 10:29:44,044 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 78 [2019-08-05 10:29:44,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:29:44,044 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2019-08-05 10:29:44,045 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-08-05 10:29:44,045 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2019-08-05 10:29:44,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-08-05 10:29:44,046 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:29:44,046 INFO L399 BasicCegarLoop]: trace histogram [76, 1, 1, 1] [2019-08-05 10:29:44,046 INFO L418 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:29:44,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:29:44,046 INFO L82 PathProgramCache]: Analyzing trace with hash -1115885629, now seen corresponding path program 76 times [2019-08-05 10:29:44,047 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:29:44,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:29:44,107 WARN L254 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 313 conjunts are in the unsatisfiable core [2019-08-05 10:29:44,109 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:29:47,774 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:47,775 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:29:47,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2019-08-05 10:29:47,775 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-08-05 10:29:47,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-08-05 10:29:47,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 10:29:47,775 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 79 states. [2019-08-05 10:29:52,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:29:52,559 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2019-08-05 10:29:52,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-08-05 10:29:52,559 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 79 [2019-08-05 10:29:52,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:29:52,560 INFO L225 Difference]: With dead ends: 81 [2019-08-05 10:29:52,560 INFO L226 Difference]: Without dead ends: 81 [2019-08-05 10:29:52,561 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 10:29:52,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-08-05 10:29:52,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-08-05 10:29:52,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-08-05 10:29:52,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-08-05 10:29:52,563 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 79 [2019-08-05 10:29:52,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:29:52,563 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2019-08-05 10:29:52,564 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-08-05 10:29:52,564 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-08-05 10:29:52,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-08-05 10:29:52,564 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:29:52,564 INFO L399 BasicCegarLoop]: trace histogram [77, 1, 1, 1] [2019-08-05 10:29:52,564 INFO L418 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:29:52,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:29:52,564 INFO L82 PathProgramCache]: Analyzing trace with hash -232714324, now seen corresponding path program 77 times [2019-08-05 10:29:52,565 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:29:52,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:29:52,607 WARN L254 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 317 conjunts are in the unsatisfiable core [2019-08-05 10:29:52,608 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:29:56,046 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:56,047 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:29:56,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2019-08-05 10:29:56,047 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-08-05 10:29:56,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-08-05 10:29:56,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=6163, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 10:29:56,048 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 80 states. [2019-08-05 10:30:01,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:30:01,210 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2019-08-05 10:30:01,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-08-05 10:30:01,211 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 80 [2019-08-05 10:30:01,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:30:01,212 INFO L225 Difference]: With dead ends: 82 [2019-08-05 10:30:01,212 INFO L226 Difference]: Without dead ends: 82 [2019-08-05 10:30:01,212 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=157, Invalid=6163, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 10:30:01,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-08-05 10:30:01,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2019-08-05 10:30:01,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-08-05 10:30:01,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2019-08-05 10:30:01,215 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 80 [2019-08-05 10:30:01,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:30:01,216 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2019-08-05 10:30:01,216 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-08-05 10:30:01,216 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2019-08-05 10:30:01,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-08-05 10:30:01,217 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:30:01,217 INFO L399 BasicCegarLoop]: trace histogram [78, 1, 1, 1] [2019-08-05 10:30:01,217 INFO L418 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:30:01,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:30:01,217 INFO L82 PathProgramCache]: Analyzing trace with hash 1375792355, now seen corresponding path program 78 times [2019-08-05 10:30:01,218 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:30:01,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:30:01,281 WARN L254 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 321 conjunts are in the unsatisfiable core [2019-08-05 10:30:01,283 INFO L279 TraceCheckSpWp]: Computing forward predicates... Received shutdown request... [2019-08-05 10:30:05,156 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2019-08-05 10:30:05,156 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-05 10:30:05,160 WARN L223 ceAbstractionStarter]: Timeout [2019-08-05 10:30:05,160 INFO L202 PluginConnector]: Adding new model hhk2008.c.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:30:05 BoogieIcfgContainer [2019-08-05 10:30:05,160 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:30:05,163 INFO L168 Benchmark]: Toolchain (without parser) took 252470.78 ms. Allocated memory was 132.1 MB in the beginning and 187.7 MB in the end (delta: 55.6 MB). Free memory was 109.6 MB in the beginning and 46.0 MB in the end (delta: 63.6 MB). Peak memory consumption was 119.2 MB. Max. memory is 7.1 GB. [2019-08-05 10:30:05,163 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 132.1 MB. Free memory is still 110.5 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-08-05 10:30:05,164 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.10 ms. Allocated memory is still 132.1 MB. Free memory was 109.2 MB in the beginning and 108.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-08-05 10:30:05,164 INFO L168 Benchmark]: Boogie Preprocessor took 19.84 ms. Allocated memory is still 132.1 MB. Free memory was 107.5 MB in the beginning and 106.6 MB in the end (delta: 900.1 kB). Peak memory consumption was 900.1 kB. Max. memory is 7.1 GB. [2019-08-05 10:30:05,165 INFO L168 Benchmark]: RCFGBuilder took 330.33 ms. Allocated memory is still 132.1 MB. Free memory was 106.6 MB in the beginning and 96.9 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. [2019-08-05 10:30:05,166 INFO L168 Benchmark]: TraceAbstraction took 252083.20 ms. Allocated memory was 132.1 MB in the beginning and 187.7 MB in the end (delta: 55.6 MB). Free memory was 96.9 MB in the beginning and 46.0 MB in the end (delta: 50.9 MB). Peak memory consumption was 106.4 MB. Max. memory is 7.1 GB. [2019-08-05 10:30:05,169 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 132.1 MB. Free memory is still 110.5 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 33.10 ms. Allocated memory is still 132.1 MB. Free memory was 109.2 MB in the beginning and 108.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 19.84 ms. Allocated memory is still 132.1 MB. Free memory was 107.5 MB in the beginning and 106.6 MB in the end (delta: 900.1 kB). Peak memory consumption was 900.1 kB. Max. memory is 7.1 GB. * RCFGBuilder took 330.33 ms. Allocated memory is still 132.1 MB. Free memory was 106.6 MB in the beginning and 96.9 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 252083.20 ms. Allocated memory was 132.1 MB in the beginning and 187.7 MB in the end (delta: 55.6 MB). Free memory was 96.9 MB in the beginning and 46.0 MB in the end (delta: 50.9 MB). Peak memory consumption was 106.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 47]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 47). Cancelled while BasicCegarLoop was analyzing trace of length 82 with TraceHistMax 78,while TraceCheckSpWp was constructing forward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 80 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 5 locations, 1 error locations. TIMEOUT Result, 252.0s OverallTime, 79 OverallIterations, 78 TraceHistogramMax, 134.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 234 SDtfs, 0 SDslu, 3081 SDs, 0 SdLazy, 167401 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 113.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3159 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 3081 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 108.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=82occurred in iteration=78, 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.1s AutomataMinimizationTime, 78 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 110.9s InterpolantComputationTime, 3237 NumberOfCodeBlocks, 3237 NumberOfCodeBlocksAsserted, 78 NumberOfCheckSat, 3159 ConstructedInterpolants, 0 QuantifiedInterpolants, 1807520 SizeOfPredicates, 468 NumberOfNonLiveVariables, 16965 ConjunctsInSsa, 12714 ConjunctsInUnsatCore, 78 InterpolantComputations, 1 PerfectInterpolantSequences, 0/79079 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown