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/abstractInterpretation/regression/non_taipan/recursive-CallABAB_incorrect.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 11:12:29,611 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 11:12:29,613 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 11:12:29,625 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 11:12:29,626 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 11:12:29,627 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 11:12:29,628 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 11:12:29,630 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 11:12:29,632 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 11:12:29,633 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 11:12:29,634 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 11:12:29,634 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 11:12:29,634 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 11:12:29,635 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 11:12:29,636 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 11:12:29,638 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 11:12:29,639 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 11:12:29,640 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 11:12:29,641 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 11:12:29,643 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 11:12:29,645 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 11:12:29,646 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 11:12:29,648 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 11:12:29,648 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 11:12:29,651 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 11:12:29,651 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 11:12:29,651 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 11:12:29,652 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 11:12:29,653 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 11:12:29,654 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 11:12:29,654 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 11:12:29,655 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 11:12:29,655 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 11:12:29,656 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 11:12:29,657 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 11:12:29,657 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 11:12:29,658 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 11:12:29,658 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 11:12:29,658 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 11:12:29,659 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 11:12:29,660 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 11:12:29,688 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 11:12:29,700 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 11:12:29,704 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 11:12:29,705 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 11:12:29,706 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 11:12:29,707 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/abstractInterpretation/regression/non_taipan/recursive-CallABAB_incorrect.bpl [2019-08-05 11:12:29,707 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/abstractInterpretation/regression/non_taipan/recursive-CallABAB_incorrect.bpl' [2019-08-05 11:12:29,741 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 11:12:29,743 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 11:12:29,744 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 11:12:29,744 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 11:12:29,744 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 11:12:29,761 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "recursive-CallABAB_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:12:29" (1/1) ... [2019-08-05 11:12:29,770 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "recursive-CallABAB_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:12:29" (1/1) ... [2019-08-05 11:12:29,778 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 11:12:29,779 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 11:12:29,779 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 11:12:29,779 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 11:12:29,791 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "recursive-CallABAB_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:12:29" (1/1) ... [2019-08-05 11:12:29,791 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "recursive-CallABAB_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:12:29" (1/1) ... [2019-08-05 11:12:29,792 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "recursive-CallABAB_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:12:29" (1/1) ... [2019-08-05 11:12:29,792 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "recursive-CallABAB_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:12:29" (1/1) ... [2019-08-05 11:12:29,795 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "recursive-CallABAB_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:12:29" (1/1) ... [2019-08-05 11:12:29,797 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "recursive-CallABAB_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:12:29" (1/1) ... [2019-08-05 11:12:29,798 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "recursive-CallABAB_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:12:29" (1/1) ... [2019-08-05 11:12:29,799 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 11:12:29,800 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 11:12:29,800 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 11:12:29,800 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 11:12:29,801 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "recursive-CallABAB_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:12:29" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-08-05 11:12:29,870 INFO L124 BoogieDeclarations]: Specification and implementation of procedure funA given in one single declaration [2019-08-05 11:12:29,870 INFO L130 BoogieDeclarations]: Found specification of procedure funA [2019-08-05 11:12:29,870 INFO L138 BoogieDeclarations]: Found implementation of procedure funA [2019-08-05 11:12:29,871 INFO L124 BoogieDeclarations]: Specification and implementation of procedure funB given in one single declaration [2019-08-05 11:12:29,871 INFO L130 BoogieDeclarations]: Found specification of procedure funB [2019-08-05 11:12:29,871 INFO L138 BoogieDeclarations]: Found implementation of procedure funB [2019-08-05 11:12:29,871 INFO L124 BoogieDeclarations]: Specification and implementation of procedure dispatch given in one single declaration [2019-08-05 11:12:29,872 INFO L130 BoogieDeclarations]: Found specification of procedure dispatch [2019-08-05 11:12:29,872 INFO L138 BoogieDeclarations]: Found implementation of procedure dispatch [2019-08-05 11:12:29,872 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2019-08-05 11:12:29,872 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-05 11:12:29,872 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-05 11:12:30,044 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-05 11:12:30,045 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 11:12:30,046 INFO L202 PluginConnector]: Adding new model recursive-CallABAB_incorrect.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:12:30 BoogieIcfgContainer [2019-08-05 11:12:30,046 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 11:12:30,048 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 11:12:30,048 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 11:12:30,051 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 11:12:30,051 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "recursive-CallABAB_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:12:29" (1/2) ... [2019-08-05 11:12:30,052 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4eeb5b7 and model type recursive-CallABAB_incorrect.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 11:12:30, skipping insertion in model container [2019-08-05 11:12:30,052 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "recursive-CallABAB_incorrect.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:12:30" (2/2) ... [2019-08-05 11:12:30,054 INFO L109 eAbstractionObserver]: Analyzing ICFG recursive-CallABAB_incorrect.bpl [2019-08-05 11:12:30,063 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 11:12:30,071 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 11:12:30,087 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 11:12:30,113 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 11:12:30,114 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 11:12:30,114 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 11:12:30,114 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 11:12:30,114 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 11:12:30,114 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 11:12:30,115 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 11:12:30,115 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 11:12:30,115 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 11:12:30,130 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states. [2019-08-05 11:12:30,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 11:12:30,141 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:30,142 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-08-05 11:12:30,144 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:30,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:30,150 INFO L82 PathProgramCache]: Analyzing trace with hash 55606330, now seen corresponding path program 1 times [2019-08-05 11:12:30,198 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:30,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:30,229 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 11:12:30,234 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:30,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:30,328 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:12:30,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 11:12:30,338 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:12:30,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:12:30,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:12:30,385 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 3 states. [2019-08-05 11:12:30,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:30,527 INFO L93 Difference]: Finished difference Result 18 states and 22 transitions. [2019-08-05 11:12:30,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:12:30,529 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-08-05 11:12:30,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:30,538 INFO L225 Difference]: With dead ends: 18 [2019-08-05 11:12:30,539 INFO L226 Difference]: Without dead ends: 17 [2019-08-05 11:12:30,541 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:12:30,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-05 11:12:30,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-08-05 11:12:30,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 11:12:30,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2019-08-05 11:12:30,586 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 5 [2019-08-05 11:12:30,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:30,586 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2019-08-05 11:12:30,587 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:12:30,587 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2019-08-05 11:12:30,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 11:12:30,589 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:30,589 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:12:30,590 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:30,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:30,590 INFO L82 PathProgramCache]: Analyzing trace with hash -711412134, now seen corresponding path program 1 times [2019-08-05 11:12:30,591 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:30,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:30,605 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 11:12:30,610 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:30,683 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:12:30,685 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:12:30,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 11:12:30,688 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:12:30,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:12:30,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:12:30,690 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand 3 states. [2019-08-05 11:12:30,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:30,867 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2019-08-05 11:12:30,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:12:30,868 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-08-05 11:12:30,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:30,869 INFO L225 Difference]: With dead ends: 19 [2019-08-05 11:12:30,870 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 11:12:30,872 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:12:30,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 11:12:30,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2019-08-05 11:12:30,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 11:12:30,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2019-08-05 11:12:30,883 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 13 [2019-08-05 11:12:30,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:30,883 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2019-08-05 11:12:30,883 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:12:30,884 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2019-08-05 11:12:30,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 11:12:30,887 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:30,887 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:12:30,888 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:30,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:30,888 INFO L82 PathProgramCache]: Analyzing trace with hash -1461102629, now seen corresponding path program 1 times [2019-08-05 11:12:30,889 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:30,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:30,917 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 11:12:30,919 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:30,987 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:12:30,987 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:30,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 11:12:30,988 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 11:12:30,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 11:12:30,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:12:30,989 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand 5 states. [2019-08-05 11:12:31,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:31,075 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2019-08-05 11:12:31,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:12:31,075 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-08-05 11:12:31,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:31,077 INFO L225 Difference]: With dead ends: 23 [2019-08-05 11:12:31,077 INFO L226 Difference]: Without dead ends: 23 [2019-08-05 11:12:31,078 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:12:31,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-08-05 11:12:31,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2019-08-05 11:12:31,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-05 11:12:31,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2019-08-05 11:12:31,099 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 26 transitions. Word has length 13 [2019-08-05 11:12:31,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:31,100 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 26 transitions. [2019-08-05 11:12:31,100 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 11:12:31,100 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions. [2019-08-05 11:12:31,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 11:12:31,101 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:31,101 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:12:31,102 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:31,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:31,102 INFO L82 PathProgramCache]: Analyzing trace with hash 369205243, now seen corresponding path program 1 times [2019-08-05 11:12:31,103 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:31,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:31,124 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 11:12:31,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:31,453 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-05 11:12:31,453 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:31,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 11:12:31,454 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 11:12:31,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 11:12:31,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:12:31,455 INFO L87 Difference]: Start difference. First operand 21 states and 26 transitions. Second operand 8 states. [2019-08-05 11:12:31,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:31,663 INFO L93 Difference]: Finished difference Result 31 states and 39 transitions. [2019-08-05 11:12:31,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 11:12:31,664 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2019-08-05 11:12:31,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:31,665 INFO L225 Difference]: With dead ends: 31 [2019-08-05 11:12:31,665 INFO L226 Difference]: Without dead ends: 31 [2019-08-05 11:12:31,666 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:12:31,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-08-05 11:12:31,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 25. [2019-08-05 11:12:31,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-05 11:12:31,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2019-08-05 11:12:31,674 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 31 transitions. Word has length 21 [2019-08-05 11:12:31,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:31,674 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 31 transitions. [2019-08-05 11:12:31,675 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 11:12:31,675 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2019-08-05 11:12:31,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 11:12:31,676 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:31,676 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:12:31,676 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:31,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:31,677 INFO L82 PathProgramCache]: Analyzing trace with hash -1523345156, now seen corresponding path program 2 times [2019-08-05 11:12:31,678 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:31,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:31,696 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 11:12:31,698 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:31,863 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-08-05 11:12:31,864 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:31,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 11:12:31,865 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 11:12:31,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 11:12:31,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:12:31,865 INFO L87 Difference]: Start difference. First operand 25 states and 31 transitions. Second operand 7 states. [2019-08-05 11:12:31,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:31,970 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2019-08-05 11:12:31,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 11:12:31,971 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2019-08-05 11:12:31,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:31,973 INFO L225 Difference]: With dead ends: 33 [2019-08-05 11:12:31,973 INFO L226 Difference]: Without dead ends: 33 [2019-08-05 11:12:31,975 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:12:31,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-08-05 11:12:31,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 27. [2019-08-05 11:12:31,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-05 11:12:31,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2019-08-05 11:12:31,983 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 21 [2019-08-05 11:12:31,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:31,985 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2019-08-05 11:12:31,985 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 11:12:31,985 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2019-08-05 11:12:31,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 11:12:31,986 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:31,987 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:12:31,987 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:31,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:31,987 INFO L82 PathProgramCache]: Analyzing trace with hash 1337370907, now seen corresponding path program 2 times [2019-08-05 11:12:31,988 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:32,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:32,027 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 11:12:32,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:32,166 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-08-05 11:12:32,166 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:32,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 11:12:32,167 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 11:12:32,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 11:12:32,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:12:32,169 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand 10 states. [2019-08-05 11:12:32,463 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 6 [2019-08-05 11:12:32,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:32,640 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2019-08-05 11:12:32,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 11:12:32,641 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 29 [2019-08-05 11:12:32,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:32,643 INFO L225 Difference]: With dead ends: 43 [2019-08-05 11:12:32,644 INFO L226 Difference]: Without dead ends: 43 [2019-08-05 11:12:32,644 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2019-08-05 11:12:32,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-08-05 11:12:32,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 31. [2019-08-05 11:12:32,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-08-05 11:12:32,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2019-08-05 11:12:32,655 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 29 [2019-08-05 11:12:32,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:32,656 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2019-08-05 11:12:32,656 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 11:12:32,656 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2019-08-05 11:12:32,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 11:12:32,657 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:32,657 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:12:32,658 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:32,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:32,658 INFO L82 PathProgramCache]: Analyzing trace with hash 895938332, now seen corresponding path program 3 times [2019-08-05 11:12:32,659 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:32,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:32,679 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 11:12:32,681 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:32,758 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-08-05 11:12:32,758 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:12:32,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-08-05 11:12:32,759 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 11:12:32,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 11:12:32,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:12:32,760 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. Second operand 5 states. [2019-08-05 11:12:32,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:32,851 INFO L93 Difference]: Finished difference Result 47 states and 58 transitions. [2019-08-05 11:12:32,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:12:32,852 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-08-05 11:12:32,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:32,854 INFO L225 Difference]: With dead ends: 47 [2019-08-05 11:12:32,854 INFO L226 Difference]: Without dead ends: 45 [2019-08-05 11:12:32,855 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:12:32,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-05 11:12:32,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 31. [2019-08-05 11:12:32,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-08-05 11:12:32,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2019-08-05 11:12:32,864 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 29 [2019-08-05 11:12:32,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:32,864 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2019-08-05 11:12:32,865 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 11:12:32,865 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2019-08-05 11:12:32,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 11:12:32,866 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:32,866 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:12:32,867 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:32,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:32,867 INFO L82 PathProgramCache]: Analyzing trace with hash -1823327844, now seen corresponding path program 4 times [2019-08-05 11:12:32,868 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:32,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:32,886 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 11:12:32,888 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:33,019 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-08-05 11:12:33,019 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:33,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 11:12:33,020 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 11:12:33,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 11:12:33,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:12:33,021 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. Second operand 10 states. [2019-08-05 11:12:33,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:33,187 INFO L93 Difference]: Finished difference Result 49 states and 61 transitions. [2019-08-05 11:12:33,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 11:12:33,189 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 29 [2019-08-05 11:12:33,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:33,191 INFO L225 Difference]: With dead ends: 49 [2019-08-05 11:12:33,191 INFO L226 Difference]: Without dead ends: 49 [2019-08-05 11:12:33,193 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:12:33,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-08-05 11:12:33,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 33. [2019-08-05 11:12:33,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-05 11:12:33,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2019-08-05 11:12:33,201 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 29 [2019-08-05 11:12:33,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:33,202 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2019-08-05 11:12:33,202 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 11:12:33,202 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2019-08-05 11:12:33,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-08-05 11:12:33,203 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:33,203 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:12:33,203 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:33,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:33,204 INFO L82 PathProgramCache]: Analyzing trace with hash -1949541572, now seen corresponding path program 5 times [2019-08-05 11:12:33,205 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:33,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:33,227 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 11:12:33,229 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:33,417 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-08-05 11:12:33,417 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:33,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 11:12:33,418 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 11:12:33,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 11:12:33,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-08-05 11:12:33,419 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. Second operand 12 states. [2019-08-05 11:12:33,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:33,686 INFO L93 Difference]: Finished difference Result 53 states and 66 transitions. [2019-08-05 11:12:33,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 11:12:33,686 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 37 [2019-08-05 11:12:33,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:33,687 INFO L225 Difference]: With dead ends: 53 [2019-08-05 11:12:33,687 INFO L226 Difference]: Without dead ends: 53 [2019-08-05 11:12:33,688 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2019-08-05 11:12:33,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-08-05 11:12:33,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 35. [2019-08-05 11:12:33,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-05 11:12:33,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2019-08-05 11:12:33,696 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 43 transitions. Word has length 37 [2019-08-05 11:12:33,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:33,696 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 43 transitions. [2019-08-05 11:12:33,697 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 11:12:33,697 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2019-08-05 11:12:33,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-08-05 11:12:33,698 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:33,698 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:12:33,699 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:33,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:33,699 INFO L82 PathProgramCache]: Analyzing trace with hash -201869123, now seen corresponding path program 6 times [2019-08-05 11:12:33,700 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:33,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:33,718 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 11:12:33,721 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:33,875 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-08-05 11:12:33,876 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:33,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 11:12:33,876 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 11:12:33,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 11:12:33,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-08-05 11:12:33,877 INFO L87 Difference]: Start difference. First operand 35 states and 43 transitions. Second operand 12 states. [2019-08-05 11:12:34,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:34,016 INFO L93 Difference]: Finished difference Result 53 states and 66 transitions. [2019-08-05 11:12:34,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 11:12:34,026 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 37 [2019-08-05 11:12:34,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:34,028 INFO L225 Difference]: With dead ends: 53 [2019-08-05 11:12:34,028 INFO L226 Difference]: Without dead ends: 53 [2019-08-05 11:12:34,029 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:12:34,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-08-05 11:12:34,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 37. [2019-08-05 11:12:34,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-05 11:12:34,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 45 transitions. [2019-08-05 11:12:34,049 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 45 transitions. Word has length 37 [2019-08-05 11:12:34,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:34,050 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 45 transitions. [2019-08-05 11:12:34,050 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 11:12:34,050 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2019-08-05 11:12:34,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-08-05 11:12:34,052 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:34,053 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:12:34,053 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:34,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:34,053 INFO L82 PathProgramCache]: Analyzing trace with hash 25841852, now seen corresponding path program 7 times [2019-08-05 11:12:34,060 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:34,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:34,104 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 11:12:34,109 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:34,273 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 1 proven. 24 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-08-05 11:12:34,273 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:34,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 11:12:34,273 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 11:12:34,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 11:12:34,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-08-05 11:12:34,274 INFO L87 Difference]: Start difference. First operand 37 states and 45 transitions. Second operand 12 states. [2019-08-05 11:12:34,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:34,382 INFO L93 Difference]: Finished difference Result 65 states and 81 transitions. [2019-08-05 11:12:34,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 11:12:34,384 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 37 [2019-08-05 11:12:34,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:34,386 INFO L225 Difference]: With dead ends: 65 [2019-08-05 11:12:34,386 INFO L226 Difference]: Without dead ends: 65 [2019-08-05 11:12:34,387 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2019-08-05 11:12:34,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-08-05 11:12:34,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 41. [2019-08-05 11:12:34,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-05 11:12:34,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 50 transitions. [2019-08-05 11:12:34,396 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 50 transitions. Word has length 37 [2019-08-05 11:12:34,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:34,397 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 50 transitions. [2019-08-05 11:12:34,397 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 11:12:34,397 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 50 transitions. [2019-08-05 11:12:34,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-08-05 11:12:34,398 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:34,398 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:12:34,398 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:34,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:34,399 INFO L82 PathProgramCache]: Analyzing trace with hash -1721830597, now seen corresponding path program 8 times [2019-08-05 11:12:34,400 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:34,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:34,417 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 11:12:34,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:34,572 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-08-05 11:12:34,573 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:34,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 11:12:34,573 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 11:12:34,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 11:12:34,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-08-05 11:12:34,574 INFO L87 Difference]: Start difference. First operand 41 states and 50 transitions. Second operand 12 states. [2019-08-05 11:12:34,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:34,714 INFO L93 Difference]: Finished difference Result 65 states and 81 transitions. [2019-08-05 11:12:34,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 11:12:34,718 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 37 [2019-08-05 11:12:34,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:34,719 INFO L225 Difference]: With dead ends: 65 [2019-08-05 11:12:34,719 INFO L226 Difference]: Without dead ends: 65 [2019-08-05 11:12:34,720 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:12:34,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-08-05 11:12:34,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 39. [2019-08-05 11:12:34,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-05 11:12:34,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 47 transitions. [2019-08-05 11:12:34,736 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 47 transitions. Word has length 37 [2019-08-05 11:12:34,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:34,737 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 47 transitions. [2019-08-05 11:12:34,737 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 11:12:34,737 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions. [2019-08-05 11:12:34,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-08-05 11:12:34,740 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:34,740 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:12:34,740 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:34,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:34,741 INFO L82 PathProgramCache]: Analyzing trace with hash 545611102, now seen corresponding path program 9 times [2019-08-05 11:12:34,745 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:34,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:34,779 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 11:12:34,783 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:34,970 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 38 proven. 1 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-08-05 11:12:34,971 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:34,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 11:12:34,971 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 11:12:34,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 11:12:34,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:12:34,972 INFO L87 Difference]: Start difference. First operand 39 states and 47 transitions. Second operand 7 states. [2019-08-05 11:12:35,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:35,146 INFO L93 Difference]: Finished difference Result 57 states and 68 transitions. [2019-08-05 11:12:35,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 11:12:35,147 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 45 [2019-08-05 11:12:35,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:35,148 INFO L225 Difference]: With dead ends: 57 [2019-08-05 11:12:35,148 INFO L226 Difference]: Without dead ends: 45 [2019-08-05 11:12:35,148 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:12:35,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-05 11:12:35,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-08-05 11:12:35,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-05 11:12:35,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 52 transitions. [2019-08-05 11:12:35,155 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 52 transitions. Word has length 45 [2019-08-05 11:12:35,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:35,155 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 52 transitions. [2019-08-05 11:12:35,155 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 11:12:35,155 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 52 transitions. [2019-08-05 11:12:35,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-08-05 11:12:35,156 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:35,156 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:12:35,156 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:35,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:35,157 INFO L82 PathProgramCache]: Analyzing trace with hash 1167621596, now seen corresponding path program 10 times [2019-08-05 11:12:35,158 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:35,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:35,173 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 11:12:35,176 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:35,356 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-08-05 11:12:35,356 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:35,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 11:12:35,357 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 11:12:35,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 11:12:35,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2019-08-05 11:12:35,357 INFO L87 Difference]: Start difference. First operand 45 states and 52 transitions. Second operand 14 states. [2019-08-05 11:12:35,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:35,545 INFO L93 Difference]: Finished difference Result 69 states and 80 transitions. [2019-08-05 11:12:35,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 11:12:35,548 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 45 [2019-08-05 11:12:35,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:35,549 INFO L225 Difference]: With dead ends: 69 [2019-08-05 11:12:35,549 INFO L226 Difference]: Without dead ends: 69 [2019-08-05 11:12:35,550 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:12:35,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-05 11:12:35,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 49. [2019-08-05 11:12:35,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-08-05 11:12:35,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2019-08-05 11:12:35,556 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 57 transitions. Word has length 45 [2019-08-05 11:12:35,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:35,556 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 57 transitions. [2019-08-05 11:12:35,557 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 11:12:35,557 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2019-08-05 11:12:35,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-08-05 11:12:35,558 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:35,558 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:12:35,558 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:35,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:35,559 INFO L82 PathProgramCache]: Analyzing trace with hash -1607030691, now seen corresponding path program 11 times [2019-08-05 11:12:35,559 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:35,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:35,574 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 11:12:35,577 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:35,719 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 1 proven. 38 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-08-05 11:12:35,720 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:35,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 11:12:35,720 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 11:12:35,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 11:12:35,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-08-05 11:12:35,721 INFO L87 Difference]: Start difference. First operand 49 states and 57 transitions. Second operand 14 states. [2019-08-05 11:12:35,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:35,983 INFO L93 Difference]: Finished difference Result 69 states and 79 transitions. [2019-08-05 11:12:35,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 11:12:35,984 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 45 [2019-08-05 11:12:35,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:35,985 INFO L225 Difference]: With dead ends: 69 [2019-08-05 11:12:35,985 INFO L226 Difference]: Without dead ends: 69 [2019-08-05 11:12:35,986 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2019-08-05 11:12:35,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-05 11:12:35,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 45. [2019-08-05 11:12:35,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-05 11:12:35,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 52 transitions. [2019-08-05 11:12:35,992 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 52 transitions. Word has length 45 [2019-08-05 11:12:35,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:35,992 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 52 transitions. [2019-08-05 11:12:35,993 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 11:12:35,993 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 52 transitions. [2019-08-05 11:12:35,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-08-05 11:12:35,994 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:35,994 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:12:35,994 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:35,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:35,994 INFO L82 PathProgramCache]: Analyzing trace with hash 408925020, now seen corresponding path program 12 times [2019-08-05 11:12:35,995 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:36,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:36,008 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 11:12:36,011 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:36,497 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 2 proven. 39 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-08-05 11:12:36,497 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:36,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 11:12:36,498 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 11:12:36,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 11:12:36,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:12:36,499 INFO L87 Difference]: Start difference. First operand 45 states and 52 transitions. Second operand 15 states. [2019-08-05 11:12:36,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:36,716 INFO L93 Difference]: Finished difference Result 77 states and 89 transitions. [2019-08-05 11:12:36,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 11:12:36,717 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 45 [2019-08-05 11:12:36,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:36,719 INFO L225 Difference]: With dead ends: 77 [2019-08-05 11:12:36,719 INFO L226 Difference]: Without dead ends: 77 [2019-08-05 11:12:36,720 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2019-08-05 11:12:36,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-08-05 11:12:36,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 53. [2019-08-05 11:12:36,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-08-05 11:12:36,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 61 transitions. [2019-08-05 11:12:36,726 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 61 transitions. Word has length 45 [2019-08-05 11:12:36,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:36,727 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 61 transitions. [2019-08-05 11:12:36,727 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 11:12:36,727 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2019-08-05 11:12:36,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-08-05 11:12:36,728 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:36,728 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:12:36,728 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:36,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:36,729 INFO L82 PathProgramCache]: Analyzing trace with hash -1743716773, now seen corresponding path program 13 times [2019-08-05 11:12:36,729 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:36,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:36,743 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 11:12:36,745 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:36,950 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-08-05 11:12:36,951 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:36,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 11:12:36,951 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 11:12:36,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 11:12:36,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2019-08-05 11:12:36,952 INFO L87 Difference]: Start difference. First operand 53 states and 61 transitions. Second operand 14 states. [2019-08-05 11:12:37,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:37,143 INFO L93 Difference]: Finished difference Result 73 states and 84 transitions. [2019-08-05 11:12:37,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 11:12:37,143 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 45 [2019-08-05 11:12:37,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:37,145 INFO L225 Difference]: With dead ends: 73 [2019-08-05 11:12:37,145 INFO L226 Difference]: Without dead ends: 73 [2019-08-05 11:12:37,146 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2019-08-05 11:12:37,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-08-05 11:12:37,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 57. [2019-08-05 11:12:37,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-08-05 11:12:37,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 66 transitions. [2019-08-05 11:12:37,151 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 66 transitions. Word has length 45 [2019-08-05 11:12:37,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:37,151 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 66 transitions. [2019-08-05 11:12:37,151 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 11:12:37,151 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 66 transitions. [2019-08-05 11:12:37,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-08-05 11:12:37,152 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:37,152 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:12:37,153 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:37,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:37,153 INFO L82 PathProgramCache]: Analyzing trace with hash -223401764, now seen corresponding path program 14 times [2019-08-05 11:12:37,154 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:37,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:37,164 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 11:12:37,167 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:37,300 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 1 proven. 39 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-08-05 11:12:37,301 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:37,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 11:12:37,301 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 11:12:37,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 11:12:37,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2019-08-05 11:12:37,302 INFO L87 Difference]: Start difference. First operand 57 states and 66 transitions. Second operand 14 states. [2019-08-05 11:12:37,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:37,427 INFO L93 Difference]: Finished difference Result 77 states and 88 transitions. [2019-08-05 11:12:37,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 11:12:37,428 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 45 [2019-08-05 11:12:37,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:37,429 INFO L225 Difference]: With dead ends: 77 [2019-08-05 11:12:37,430 INFO L226 Difference]: Without dead ends: 77 [2019-08-05 11:12:37,430 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2019-08-05 11:12:37,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-08-05 11:12:37,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 53. [2019-08-05 11:12:37,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-08-05 11:12:37,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 61 transitions. [2019-08-05 11:12:37,436 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 61 transitions. Word has length 45 [2019-08-05 11:12:37,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:37,436 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 61 transitions. [2019-08-05 11:12:37,436 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 11:12:37,436 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2019-08-05 11:12:37,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-08-05 11:12:37,437 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:37,437 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:12:37,438 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:37,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:37,438 INFO L82 PathProgramCache]: Analyzing trace with hash 1006642045, now seen corresponding path program 15 times [2019-08-05 11:12:37,439 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:37,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:37,450 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 11:12:37,453 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:37,613 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 2 proven. 56 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-08-05 11:12:37,613 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:37,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:12:37,613 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:12:37,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:12:37,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:12:37,614 INFO L87 Difference]: Start difference. First operand 53 states and 61 transitions. Second operand 17 states. [2019-08-05 11:12:38,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:38,097 INFO L93 Difference]: Finished difference Result 85 states and 98 transitions. [2019-08-05 11:12:38,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:12:38,097 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 53 [2019-08-05 11:12:38,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:38,098 INFO L225 Difference]: With dead ends: 85 [2019-08-05 11:12:38,098 INFO L226 Difference]: Without dead ends: 85 [2019-08-05 11:12:38,098 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=422, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:12:38,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-08-05 11:12:38,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 57. [2019-08-05 11:12:38,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-08-05 11:12:38,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 66 transitions. [2019-08-05 11:12:38,103 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 66 transitions. Word has length 53 [2019-08-05 11:12:38,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:38,103 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 66 transitions. [2019-08-05 11:12:38,103 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:12:38,103 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 66 transitions. [2019-08-05 11:12:38,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-08-05 11:12:38,104 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:38,104 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:12:38,105 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:38,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:38,105 INFO L82 PathProgramCache]: Analyzing trace with hash 158146940, now seen corresponding path program 16 times [2019-08-05 11:12:38,106 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:38,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:38,116 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 11:12:38,118 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:38,401 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2019-08-05 11:12:38,402 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:38,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 11:12:38,402 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 11:12:38,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 11:12:38,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2019-08-05 11:12:38,403 INFO L87 Difference]: Start difference. First operand 57 states and 66 transitions. Second operand 16 states. [2019-08-05 11:12:38,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:38,541 INFO L93 Difference]: Finished difference Result 85 states and 99 transitions. [2019-08-05 11:12:38,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 11:12:38,542 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 53 [2019-08-05 11:12:38,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:38,543 INFO L225 Difference]: With dead ends: 85 [2019-08-05 11:12:38,543 INFO L226 Difference]: Without dead ends: 85 [2019-08-05 11:12:38,544 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2019-08-05 11:12:38,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-08-05 11:12:38,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 61. [2019-08-05 11:12:38,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-08-05 11:12:38,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 71 transitions. [2019-08-05 11:12:38,550 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 71 transitions. Word has length 53 [2019-08-05 11:12:38,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:38,550 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 71 transitions. [2019-08-05 11:12:38,550 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 11:12:38,550 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 71 transitions. [2019-08-05 11:12:38,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-08-05 11:12:38,551 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:38,551 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:12:38,551 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:38,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:38,552 INFO L82 PathProgramCache]: Analyzing trace with hash -1855907587, now seen corresponding path program 17 times [2019-08-05 11:12:38,552 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:38,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:38,562 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 11:12:38,564 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:38,767 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 1 proven. 55 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-08-05 11:12:38,767 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:38,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 11:12:38,768 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 11:12:38,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 11:12:38,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2019-08-05 11:12:38,768 INFO L87 Difference]: Start difference. First operand 61 states and 71 transitions. Second operand 16 states. [2019-08-05 11:12:38,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:38,938 INFO L93 Difference]: Finished difference Result 81 states and 93 transitions. [2019-08-05 11:12:38,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 11:12:38,944 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 53 [2019-08-05 11:12:38,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:38,946 INFO L225 Difference]: With dead ends: 81 [2019-08-05 11:12:38,946 INFO L226 Difference]: Without dead ends: 81 [2019-08-05 11:12:38,946 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2019-08-05 11:12:38,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-08-05 11:12:38,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 53. [2019-08-05 11:12:38,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-08-05 11:12:38,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 61 transitions. [2019-08-05 11:12:38,951 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 61 transitions. Word has length 53 [2019-08-05 11:12:38,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:38,952 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 61 transitions. [2019-08-05 11:12:38,952 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 11:12:38,952 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2019-08-05 11:12:38,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-08-05 11:12:38,952 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:38,953 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:12:38,953 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:38,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:38,953 INFO L82 PathProgramCache]: Analyzing trace with hash -1701736835, now seen corresponding path program 18 times [2019-08-05 11:12:38,954 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:38,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:38,964 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 11:12:38,966 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:39,096 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 2 proven. 54 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-08-05 11:12:39,097 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:39,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 11:12:39,097 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 11:12:39,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 11:12:39,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2019-08-05 11:12:39,098 INFO L87 Difference]: Start difference. First operand 53 states and 61 transitions. Second operand 16 states. [2019-08-05 11:12:39,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:39,225 INFO L93 Difference]: Finished difference Result 97 states and 111 transitions. [2019-08-05 11:12:39,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 11:12:39,226 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 53 [2019-08-05 11:12:39,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:39,228 INFO L225 Difference]: With dead ends: 97 [2019-08-05 11:12:39,228 INFO L226 Difference]: Without dead ends: 97 [2019-08-05 11:12:39,228 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:12:39,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-08-05 11:12:39,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 65. [2019-08-05 11:12:39,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-08-05 11:12:39,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 75 transitions. [2019-08-05 11:12:39,234 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 75 transitions. Word has length 53 [2019-08-05 11:12:39,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:39,234 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 75 transitions. [2019-08-05 11:12:39,234 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 11:12:39,235 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 75 transitions. [2019-08-05 11:12:39,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-08-05 11:12:39,235 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:39,236 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:12:39,236 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:39,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:39,236 INFO L82 PathProgramCache]: Analyzing trace with hash 312317692, now seen corresponding path program 19 times [2019-08-05 11:12:39,237 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:39,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:39,248 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 11:12:39,249 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:39,507 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 3 proven. 58 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-08-05 11:12:39,507 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:39,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:12:39,508 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:12:39,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:12:39,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:12:39,509 INFO L87 Difference]: Start difference. First operand 65 states and 75 transitions. Second operand 17 states. [2019-08-05 11:12:39,863 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 6 [2019-08-05 11:12:40,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:40,004 INFO L93 Difference]: Finished difference Result 97 states and 112 transitions. [2019-08-05 11:12:40,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:12:40,004 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 53 [2019-08-05 11:12:40,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:40,006 INFO L225 Difference]: With dead ends: 97 [2019-08-05 11:12:40,006 INFO L226 Difference]: Without dead ends: 97 [2019-08-05 11:12:40,006 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=93, Invalid=413, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:12:40,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-08-05 11:12:40,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 61. [2019-08-05 11:12:40,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-08-05 11:12:40,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 70 transitions. [2019-08-05 11:12:40,011 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 70 transitions. Word has length 53 [2019-08-05 11:12:40,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:40,012 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 70 transitions. [2019-08-05 11:12:40,012 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:12:40,012 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 70 transitions. [2019-08-05 11:12:40,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-08-05 11:12:40,013 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:40,013 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:12:40,013 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:40,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:40,014 INFO L82 PathProgramCache]: Analyzing trace with hash -1523168132, now seen corresponding path program 20 times [2019-08-05 11:12:40,014 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:40,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:40,025 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 11:12:40,026 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:40,372 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 2 proven. 59 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-08-05 11:12:40,372 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:40,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:12:40,373 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:12:40,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:12:40,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:12:40,374 INFO L87 Difference]: Start difference. First operand 61 states and 70 transitions. Second operand 17 states. [2019-08-05 11:12:40,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:40,605 INFO L93 Difference]: Finished difference Result 105 states and 121 transitions. [2019-08-05 11:12:40,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:12:40,606 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 53 [2019-08-05 11:12:40,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:40,607 INFO L225 Difference]: With dead ends: 105 [2019-08-05 11:12:40,607 INFO L226 Difference]: Without dead ends: 105 [2019-08-05 11:12:40,608 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=93, Invalid=413, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:12:40,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-08-05 11:12:40,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 65. [2019-08-05 11:12:40,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-08-05 11:12:40,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 75 transitions. [2019-08-05 11:12:40,612 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 75 transitions. Word has length 53 [2019-08-05 11:12:40,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:40,613 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 75 transitions. [2019-08-05 11:12:40,613 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:12:40,613 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 75 transitions. [2019-08-05 11:12:40,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-08-05 11:12:40,614 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:40,614 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:12:40,614 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:40,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:40,615 INFO L82 PathProgramCache]: Analyzing trace with hash 1923304059, now seen corresponding path program 21 times [2019-08-05 11:12:40,615 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:40,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:40,624 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 11:12:40,625 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:40,729 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2019-08-05 11:12:40,730 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:40,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 11:12:40,730 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 11:12:40,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 11:12:40,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2019-08-05 11:12:40,731 INFO L87 Difference]: Start difference. First operand 65 states and 75 transitions. Second operand 16 states. [2019-08-05 11:12:40,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:40,913 INFO L93 Difference]: Finished difference Result 89 states and 102 transitions. [2019-08-05 11:12:40,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 11:12:40,913 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 53 [2019-08-05 11:12:40,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:40,915 INFO L225 Difference]: With dead ends: 89 [2019-08-05 11:12:40,915 INFO L226 Difference]: Without dead ends: 89 [2019-08-05 11:12:40,915 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=325, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:40,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-08-05 11:12:40,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 69. [2019-08-05 11:12:40,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-05 11:12:40,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 80 transitions. [2019-08-05 11:12:40,920 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 80 transitions. Word has length 53 [2019-08-05 11:12:40,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:40,920 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 80 transitions. [2019-08-05 11:12:40,920 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 11:12:40,920 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 80 transitions. [2019-08-05 11:12:40,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-08-05 11:12:40,921 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:40,921 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:12:40,921 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:40,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:40,922 INFO L82 PathProgramCache]: Analyzing trace with hash -90750468, now seen corresponding path program 22 times [2019-08-05 11:12:40,923 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:40,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:40,931 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 11:12:40,933 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:41,232 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 1 proven. 58 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2019-08-05 11:12:41,232 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:41,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 11:12:41,233 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 11:12:41,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 11:12:41,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2019-08-05 11:12:41,234 INFO L87 Difference]: Start difference. First operand 69 states and 80 transitions. Second operand 16 states. [2019-08-05 11:12:41,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:41,399 INFO L93 Difference]: Finished difference Result 101 states and 115 transitions. [2019-08-05 11:12:41,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 11:12:41,400 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 53 [2019-08-05 11:12:41,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:41,401 INFO L225 Difference]: With dead ends: 101 [2019-08-05 11:12:41,401 INFO L226 Difference]: Without dead ends: 101 [2019-08-05 11:12:41,402 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=375, Unknown=0, NotChecked=0, Total=462 [2019-08-05 11:12:41,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-08-05 11:12:41,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 61. [2019-08-05 11:12:41,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-08-05 11:12:41,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 70 transitions. [2019-08-05 11:12:41,407 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 70 transitions. Word has length 53 [2019-08-05 11:12:41,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:41,407 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 70 transitions. [2019-08-05 11:12:41,407 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 11:12:41,407 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 70 transitions. [2019-08-05 11:12:41,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:12:41,408 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:41,408 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:12:41,409 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:41,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:41,409 INFO L82 PathProgramCache]: Analyzing trace with hash -63069154, now seen corresponding path program 23 times [2019-08-05 11:12:41,410 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:41,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:41,420 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 11:12:41,422 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:41,653 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 2 proven. 74 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-08-05 11:12:41,654 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:41,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 11:12:41,654 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 11:12:41,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 11:12:41,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2019-08-05 11:12:41,655 INFO L87 Difference]: Start difference. First operand 61 states and 70 transitions. Second operand 18 states. [2019-08-05 11:12:41,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:41,812 INFO L93 Difference]: Finished difference Result 105 states and 120 transitions. [2019-08-05 11:12:41,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 11:12:41,821 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 61 [2019-08-05 11:12:41,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:41,823 INFO L225 Difference]: With dead ends: 105 [2019-08-05 11:12:41,823 INFO L226 Difference]: Without dead ends: 105 [2019-08-05 11:12:41,823 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=343, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:41,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-08-05 11:12:41,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 73. [2019-08-05 11:12:41,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-08-05 11:12:41,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 84 transitions. [2019-08-05 11:12:41,830 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 84 transitions. Word has length 61 [2019-08-05 11:12:41,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:41,830 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 84 transitions. [2019-08-05 11:12:41,831 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 11:12:41,831 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 84 transitions. [2019-08-05 11:12:41,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:12:41,831 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:41,832 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:12:41,832 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:41,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:41,833 INFO L82 PathProgramCache]: Analyzing trace with hash -1626284131, now seen corresponding path program 24 times [2019-08-05 11:12:41,834 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:41,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:41,844 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 11:12:41,846 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:42,046 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 3 proven. 77 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2019-08-05 11:12:42,047 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:42,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:12:42,047 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:12:42,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:12:42,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:12:42,048 INFO L87 Difference]: Start difference. First operand 73 states and 84 transitions. Second operand 19 states. [2019-08-05 11:12:42,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:42,344 INFO L93 Difference]: Finished difference Result 105 states and 122 transitions. [2019-08-05 11:12:42,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:12:42,345 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:12:42,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:42,346 INFO L225 Difference]: With dead ends: 105 [2019-08-05 11:12:42,346 INFO L226 Difference]: Without dead ends: 105 [2019-08-05 11:12:42,347 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=542, Unknown=0, NotChecked=0, Total=650 [2019-08-05 11:12:42,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-08-05 11:12:42,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 65. [2019-08-05 11:12:42,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-08-05 11:12:42,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 75 transitions. [2019-08-05 11:12:42,351 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 75 transitions. Word has length 61 [2019-08-05 11:12:42,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:42,351 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 75 transitions. [2019-08-05 11:12:42,351 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:12:42,351 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 75 transitions. [2019-08-05 11:12:42,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:12:42,352 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:42,352 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:12:42,353 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:42,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:42,353 INFO L82 PathProgramCache]: Analyzing trace with hash -939846371, now seen corresponding path program 25 times [2019-08-05 11:12:42,354 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:42,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:42,363 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 11:12:42,365 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:42,533 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 2 proven. 78 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2019-08-05 11:12:42,534 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:42,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:12:42,534 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:12:42,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:12:42,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:12:42,535 INFO L87 Difference]: Start difference. First operand 65 states and 75 transitions. Second operand 19 states. [2019-08-05 11:12:43,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:43,046 INFO L93 Difference]: Finished difference Result 97 states and 112 transitions. [2019-08-05 11:12:43,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:12:43,047 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:12:43,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:43,048 INFO L225 Difference]: With dead ends: 97 [2019-08-05 11:12:43,048 INFO L226 Difference]: Without dead ends: 97 [2019-08-05 11:12:43,049 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=542, Unknown=0, NotChecked=0, Total=650 [2019-08-05 11:12:43,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-08-05 11:12:43,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 69. [2019-08-05 11:12:43,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-05 11:12:43,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 80 transitions. [2019-08-05 11:12:43,054 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 80 transitions. Word has length 61 [2019-08-05 11:12:43,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:43,054 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 80 transitions. [2019-08-05 11:12:43,055 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:12:43,055 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 80 transitions. [2019-08-05 11:12:43,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:12:43,055 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:43,056 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:12:43,056 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:43,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:43,056 INFO L82 PathProgramCache]: Analyzing trace with hash 787319453, now seen corresponding path program 26 times [2019-08-05 11:12:43,057 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:43,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:43,066 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 11:12:43,068 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:43,291 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 1 proven. 76 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-08-05 11:12:43,291 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:43,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 11:12:43,292 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 11:12:43,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 11:12:43,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2019-08-05 11:12:43,292 INFO L87 Difference]: Start difference. First operand 69 states and 80 transitions. Second operand 18 states. [2019-08-05 11:12:43,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:43,481 INFO L93 Difference]: Finished difference Result 105 states and 121 transitions. [2019-08-05 11:12:43,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 11:12:43,482 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 61 [2019-08-05 11:12:43,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:43,483 INFO L225 Difference]: With dead ends: 105 [2019-08-05 11:12:43,483 INFO L226 Difference]: Without dead ends: 105 [2019-08-05 11:12:43,484 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=458, Unknown=0, NotChecked=0, Total=552 [2019-08-05 11:12:43,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-08-05 11:12:43,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 73. [2019-08-05 11:12:43,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-08-05 11:12:43,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 85 transitions. [2019-08-05 11:12:43,488 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 85 transitions. Word has length 61 [2019-08-05 11:12:43,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:43,488 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 85 transitions. [2019-08-05 11:12:43,488 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 11:12:43,489 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 85 transitions. [2019-08-05 11:12:43,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:12:43,489 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:43,489 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:12:43,490 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:43,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:43,490 INFO L82 PathProgramCache]: Analyzing trace with hash -775895524, now seen corresponding path program 27 times [2019-08-05 11:12:43,491 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:43,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:43,500 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 11:12:43,502 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:44,104 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 82 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-08-05 11:12:44,104 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:44,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 11:12:44,105 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 11:12:44,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 11:12:44,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2019-08-05 11:12:44,105 INFO L87 Difference]: Start difference. First operand 73 states and 85 transitions. Second operand 18 states. [2019-08-05 11:12:44,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:44,301 INFO L93 Difference]: Finished difference Result 105 states and 122 transitions. [2019-08-05 11:12:44,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 11:12:44,302 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 61 [2019-08-05 11:12:44,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:44,303 INFO L225 Difference]: With dead ends: 105 [2019-08-05 11:12:44,303 INFO L226 Difference]: Without dead ends: 105 [2019-08-05 11:12:44,304 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=104, Invalid=402, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:12:44,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-08-05 11:12:44,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 61. [2019-08-05 11:12:44,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-08-05 11:12:44,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 70 transitions. [2019-08-05 11:12:44,309 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 70 transitions. Word has length 61 [2019-08-05 11:12:44,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:44,309 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 70 transitions. [2019-08-05 11:12:44,309 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 11:12:44,309 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 70 transitions. [2019-08-05 11:12:44,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:12:44,310 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:44,310 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:12:44,310 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:44,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:44,311 INFO L82 PathProgramCache]: Analyzing trace with hash 821349021, now seen corresponding path program 28 times [2019-08-05 11:12:44,311 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:44,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:44,321 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 11:12:44,323 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:45,631 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 3 proven. 77 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2019-08-05 11:12:45,631 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:45,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:12:45,632 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:12:45,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:12:45,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:12:45,633 INFO L87 Difference]: Start difference. First operand 61 states and 70 transitions. Second operand 19 states. [2019-08-05 11:12:45,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:45,873 INFO L93 Difference]: Finished difference Result 121 states and 139 transitions. [2019-08-05 11:12:45,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:12:45,874 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:12:45,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:45,876 INFO L225 Difference]: With dead ends: 121 [2019-08-05 11:12:45,876 INFO L226 Difference]: Without dead ends: 121 [2019-08-05 11:12:45,876 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=116, Invalid=586, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:12:45,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-08-05 11:12:45,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 73. [2019-08-05 11:12:45,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-08-05 11:12:45,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 84 transitions. [2019-08-05 11:12:45,881 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 84 transitions. Word has length 61 [2019-08-05 11:12:45,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:45,881 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 84 transitions. [2019-08-05 11:12:45,881 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:12:45,882 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 84 transitions. [2019-08-05 11:12:45,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:12:45,882 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:45,882 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:12:45,883 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:45,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:45,883 INFO L82 PathProgramCache]: Analyzing trace with hash -240363621, now seen corresponding path program 29 times [2019-08-05 11:12:45,884 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:45,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:45,908 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 11:12:45,910 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:46,029 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2019-08-05 11:12:46,030 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:46,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 11:12:46,031 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 11:12:46,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 11:12:46,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2019-08-05 11:12:46,031 INFO L87 Difference]: Start difference. First operand 73 states and 84 transitions. Second operand 18 states. [2019-08-05 11:12:46,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:46,208 INFO L93 Difference]: Finished difference Result 109 states and 125 transitions. [2019-08-05 11:12:46,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 11:12:46,213 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 61 [2019-08-05 11:12:46,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:46,214 INFO L225 Difference]: With dead ends: 109 [2019-08-05 11:12:46,214 INFO L226 Difference]: Without dead ends: 109 [2019-08-05 11:12:46,214 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=124, Invalid=428, Unknown=0, NotChecked=0, Total=552 [2019-08-05 11:12:46,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-08-05 11:12:46,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 85. [2019-08-05 11:12:46,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-08-05 11:12:46,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 99 transitions. [2019-08-05 11:12:46,219 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 99 transitions. Word has length 61 [2019-08-05 11:12:46,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:46,220 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 99 transitions. [2019-08-05 11:12:46,220 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 11:12:46,220 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 99 transitions. [2019-08-05 11:12:46,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:12:46,221 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:46,221 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:12:46,221 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:46,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:46,221 INFO L82 PathProgramCache]: Analyzing trace with hash -1746452451, now seen corresponding path program 30 times [2019-08-05 11:12:46,222 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:46,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:46,231 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 11:12:46,233 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:46,888 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 5 proven. 75 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2019-08-05 11:12:46,888 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:46,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:12:46,889 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:12:46,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:12:46,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:12:46,890 INFO L87 Difference]: Start difference. First operand 85 states and 99 transitions. Second operand 19 states. [2019-08-05 11:12:47,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:47,154 INFO L93 Difference]: Finished difference Result 121 states and 139 transitions. [2019-08-05 11:12:47,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:12:47,155 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:12:47,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:47,156 INFO L225 Difference]: With dead ends: 121 [2019-08-05 11:12:47,157 INFO L226 Difference]: Without dead ends: 121 [2019-08-05 11:12:47,157 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=122, Invalid=634, Unknown=0, NotChecked=0, Total=756 [2019-08-05 11:12:47,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-08-05 11:12:47,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 89. [2019-08-05 11:12:47,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-08-05 11:12:47,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 104 transitions. [2019-08-05 11:12:47,163 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 104 transitions. Word has length 61 [2019-08-05 11:12:47,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:47,163 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 104 transitions. [2019-08-05 11:12:47,163 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:12:47,163 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 104 transitions. [2019-08-05 11:12:47,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:12:47,164 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:47,164 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:12:47,164 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:47,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:47,165 INFO L82 PathProgramCache]: Analyzing trace with hash 985299868, now seen corresponding path program 31 times [2019-08-05 11:12:47,165 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:47,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:47,175 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 11:12:47,177 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:47,337 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 4 proven. 81 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-08-05 11:12:47,338 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:47,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:12:47,338 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:12:47,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:12:47,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:12:47,339 INFO L87 Difference]: Start difference. First operand 89 states and 104 transitions. Second operand 19 states. [2019-08-05 11:12:47,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:47,560 INFO L93 Difference]: Finished difference Result 117 states and 135 transitions. [2019-08-05 11:12:47,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:12:47,560 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:12:47,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:47,562 INFO L225 Difference]: With dead ends: 117 [2019-08-05 11:12:47,562 INFO L226 Difference]: Without dead ends: 117 [2019-08-05 11:12:47,562 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=531, Unknown=0, NotChecked=0, Total=650 [2019-08-05 11:12:47,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-08-05 11:12:47,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 81. [2019-08-05 11:12:47,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-08-05 11:12:47,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 94 transitions. [2019-08-05 11:12:47,567 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 94 transitions. Word has length 61 [2019-08-05 11:12:47,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:47,567 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 94 transitions. [2019-08-05 11:12:47,567 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:12:47,567 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 94 transitions. [2019-08-05 11:12:47,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:12:47,568 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:47,568 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:12:47,569 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:47,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:47,569 INFO L82 PathProgramCache]: Analyzing trace with hash 472462749, now seen corresponding path program 32 times [2019-08-05 11:12:47,569 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:47,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:47,579 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 11:12:47,580 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:47,728 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 2 proven. 75 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-08-05 11:12:47,729 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:47,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 11:12:47,729 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 11:12:47,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 11:12:47,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2019-08-05 11:12:47,730 INFO L87 Difference]: Start difference. First operand 81 states and 94 transitions. Second operand 18 states. [2019-08-05 11:12:47,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:47,884 INFO L93 Difference]: Finished difference Result 133 states and 152 transitions. [2019-08-05 11:12:47,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 11:12:47,897 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 61 [2019-08-05 11:12:47,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:47,898 INFO L225 Difference]: With dead ends: 133 [2019-08-05 11:12:47,898 INFO L226 Difference]: Without dead ends: 133 [2019-08-05 11:12:47,899 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=410, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:12:47,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-08-05 11:12:47,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 89. [2019-08-05 11:12:47,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-08-05 11:12:47,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 103 transitions. [2019-08-05 11:12:47,905 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 103 transitions. Word has length 61 [2019-08-05 11:12:47,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:47,906 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 103 transitions. [2019-08-05 11:12:47,906 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 11:12:47,906 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 103 transitions. [2019-08-05 11:12:47,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:12:47,907 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:47,907 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:12:47,907 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:47,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:47,907 INFO L82 PathProgramCache]: Analyzing trace with hash 1322851356, now seen corresponding path program 33 times [2019-08-05 11:12:47,908 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:47,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:47,919 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 11:12:47,921 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:48,090 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 1 proven. 81 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-08-05 11:12:48,090 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:48,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 11:12:48,091 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 11:12:48,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 11:12:48,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2019-08-05 11:12:48,091 INFO L87 Difference]: Start difference. First operand 89 states and 103 transitions. Second operand 18 states. [2019-08-05 11:12:48,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:48,316 INFO L93 Difference]: Finished difference Result 129 states and 147 transitions. [2019-08-05 11:12:48,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 11:12:48,317 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 61 [2019-08-05 11:12:48,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:48,318 INFO L225 Difference]: With dead ends: 129 [2019-08-05 11:12:48,318 INFO L226 Difference]: Without dead ends: 129 [2019-08-05 11:12:48,319 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=531, Unknown=0, NotChecked=0, Total=650 [2019-08-05 11:12:48,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-08-05 11:12:48,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 85. [2019-08-05 11:12:48,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-08-05 11:12:48,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 98 transitions. [2019-08-05 11:12:48,324 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 98 transitions. Word has length 61 [2019-08-05 11:12:48,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:48,325 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 98 transitions. [2019-08-05 11:12:48,325 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 11:12:48,325 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 98 transitions. [2019-08-05 11:12:48,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:12:48,326 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:48,326 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:12:48,326 INFO L418 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:48,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:48,326 INFO L82 PathProgramCache]: Analyzing trace with hash -404314468, now seen corresponding path program 34 times [2019-08-05 11:12:48,327 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:48,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:48,336 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 11:12:48,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:48,492 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 2 proven. 83 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-08-05 11:12:48,493 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:48,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:12:48,493 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:12:48,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:12:48,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:12:48,494 INFO L87 Difference]: Start difference. First operand 85 states and 98 transitions. Second operand 19 states. [2019-08-05 11:12:48,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:48,768 INFO L93 Difference]: Finished difference Result 133 states and 153 transitions. [2019-08-05 11:12:48,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:12:48,768 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:12:48,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:48,770 INFO L225 Difference]: With dead ends: 133 [2019-08-05 11:12:48,770 INFO L226 Difference]: Without dead ends: 133 [2019-08-05 11:12:48,771 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=531, Unknown=0, NotChecked=0, Total=650 [2019-08-05 11:12:48,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-08-05 11:12:48,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 81. [2019-08-05 11:12:48,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-08-05 11:12:48,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 93 transitions. [2019-08-05 11:12:48,775 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 93 transitions. Word has length 61 [2019-08-05 11:12:48,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:48,776 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 93 transitions. [2019-08-05 11:12:48,776 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:12:48,776 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 93 transitions. [2019-08-05 11:12:48,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:12:48,777 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:48,777 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:12:48,777 INFO L418 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:48,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:48,777 INFO L82 PathProgramCache]: Analyzing trace with hash -1090752228, now seen corresponding path program 35 times [2019-08-05 11:12:48,778 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:48,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:48,787 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 11:12:48,789 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:49,626 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 3 proven. 82 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-08-05 11:12:49,626 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:49,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:12:49,626 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:12:49,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:12:49,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:12:49,627 INFO L87 Difference]: Start difference. First operand 81 states and 93 transitions. Second operand 19 states. [2019-08-05 11:12:49,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:49,846 INFO L93 Difference]: Finished difference Result 117 states and 134 transitions. [2019-08-05 11:12:49,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:12:49,847 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:12:49,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:49,848 INFO L225 Difference]: With dead ends: 117 [2019-08-05 11:12:49,849 INFO L226 Difference]: Without dead ends: 117 [2019-08-05 11:12:49,849 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=119, Invalid=531, Unknown=0, NotChecked=0, Total=650 [2019-08-05 11:12:49,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-08-05 11:12:49,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 69. [2019-08-05 11:12:49,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-05 11:12:49,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 79 transitions. [2019-08-05 11:12:49,853 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 79 transitions. Word has length 61 [2019-08-05 11:12:49,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:49,854 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 79 transitions. [2019-08-05 11:12:49,854 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:12:49,854 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 79 transitions. [2019-08-05 11:12:49,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-08-05 11:12:49,854 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:49,855 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:49,855 INFO L418 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:49,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:49,855 INFO L82 PathProgramCache]: Analyzing trace with hash 801372350, now seen corresponding path program 36 times [2019-08-05 11:12:49,856 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:49,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:49,879 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 11:12:49,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:50,039 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 3 proven. 100 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-08-05 11:12:50,039 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:50,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:50,040 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:50,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:50,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:50,040 INFO L87 Difference]: Start difference. First operand 69 states and 79 transitions. Second operand 21 states. [2019-08-05 11:12:50,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:50,688 INFO L93 Difference]: Finished difference Result 133 states and 153 transitions. [2019-08-05 11:12:50,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:50,689 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 69 [2019-08-05 11:12:50,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:50,690 INFO L225 Difference]: With dead ends: 133 [2019-08-05 11:12:50,690 INFO L226 Difference]: Without dead ends: 133 [2019-08-05 11:12:50,691 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=741, Unknown=0, NotChecked=0, Total=870 [2019-08-05 11:12:50,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-08-05 11:12:50,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 81. [2019-08-05 11:12:50,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-08-05 11:12:50,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 93 transitions. [2019-08-05 11:12:50,697 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 93 transitions. Word has length 69 [2019-08-05 11:12:50,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:50,697 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 93 transitions. [2019-08-05 11:12:50,697 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:50,697 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 93 transitions. [2019-08-05 11:12:50,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-08-05 11:12:50,698 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:50,698 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 6, 6, 6, 6, 6, 6, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:12:50,698 INFO L418 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:50,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:50,699 INFO L82 PathProgramCache]: Analyzing trace with hash 1791617980, now seen corresponding path program 37 times [2019-08-05 11:12:50,699 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:50,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:50,717 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 11:12:50,720 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:51,143 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 109 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-08-05 11:12:51,143 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:51,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 11:12:51,144 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 11:12:51,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 11:12:51,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2019-08-05 11:12:51,144 INFO L87 Difference]: Start difference. First operand 81 states and 93 transitions. Second operand 20 states. [2019-08-05 11:12:51,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:51,333 INFO L93 Difference]: Finished difference Result 133 states and 154 transitions. [2019-08-05 11:12:51,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 11:12:51,335 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 69 [2019-08-05 11:12:51,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:51,336 INFO L225 Difference]: With dead ends: 133 [2019-08-05 11:12:51,336 INFO L226 Difference]: Without dead ends: 133 [2019-08-05 11:12:51,337 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=134, Invalid=516, Unknown=0, NotChecked=0, Total=650 [2019-08-05 11:12:51,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-08-05 11:12:51,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 93. [2019-08-05 11:12:51,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-08-05 11:12:51,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 108 transitions. [2019-08-05 11:12:51,341 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 108 transitions. Word has length 69 [2019-08-05 11:12:51,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:51,342 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 108 transitions. [2019-08-05 11:12:51,342 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 11:12:51,342 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 108 transitions. [2019-08-05 11:12:51,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-08-05 11:12:51,343 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:51,343 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:51,343 INFO L418 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:51,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:51,343 INFO L82 PathProgramCache]: Analyzing trace with hash -1094193602, now seen corresponding path program 38 times [2019-08-05 11:12:51,344 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:51,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:51,354 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 11:12:51,356 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:51,601 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 5 proven. 98 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-08-05 11:12:51,601 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:51,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:51,601 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:51,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:51,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:51,602 INFO L87 Difference]: Start difference. First operand 93 states and 108 transitions. Second operand 21 states. [2019-08-05 11:12:51,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:51,881 INFO L93 Difference]: Finished difference Result 133 states and 154 transitions. [2019-08-05 11:12:51,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:51,882 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 69 [2019-08-05 11:12:51,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:51,883 INFO L225 Difference]: With dead ends: 133 [2019-08-05 11:12:51,884 INFO L226 Difference]: Without dead ends: 133 [2019-08-05 11:12:51,885 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=135, Invalid=795, Unknown=0, NotChecked=0, Total=930 [2019-08-05 11:12:51,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-08-05 11:12:51,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 97. [2019-08-05 11:12:51,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-08-05 11:12:51,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 113 transitions. [2019-08-05 11:12:51,891 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 113 transitions. Word has length 69 [2019-08-05 11:12:51,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:51,891 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 113 transitions. [2019-08-05 11:12:51,891 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:51,892 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 113 transitions. [2019-08-05 11:12:51,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-08-05 11:12:51,892 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:51,893 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:12:51,893 INFO L418 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:51,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:51,893 INFO L82 PathProgramCache]: Analyzing trace with hash 2004835517, now seen corresponding path program 39 times [2019-08-05 11:12:51,894 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:51,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:51,906 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 11:12:51,908 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:52,132 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 4 proven. 102 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-08-05 11:12:52,133 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:52,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:52,133 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:52,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:52,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=352, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:52,134 INFO L87 Difference]: Start difference. First operand 97 states and 113 transitions. Second operand 21 states. [2019-08-05 11:12:52,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:52,370 INFO L93 Difference]: Finished difference Result 141 states and 165 transitions. [2019-08-05 11:12:52,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:52,371 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 69 [2019-08-05 11:12:52,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:52,372 INFO L225 Difference]: With dead ends: 141 [2019-08-05 11:12:52,372 INFO L226 Difference]: Without dead ends: 141 [2019-08-05 11:12:52,373 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=136, Invalid=676, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:12:52,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-08-05 11:12:52,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 85. [2019-08-05 11:12:52,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-08-05 11:12:52,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 99 transitions. [2019-08-05 11:12:52,378 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 99 transitions. Word has length 69 [2019-08-05 11:12:52,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:52,378 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 99 transitions. [2019-08-05 11:12:52,378 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:52,379 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 99 transitions. [2019-08-05 11:12:52,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-08-05 11:12:52,379 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:52,379 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:52,380 INFO L418 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:52,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:52,380 INFO L82 PathProgramCache]: Analyzing trace with hash 1419469758, now seen corresponding path program 40 times [2019-08-05 11:12:52,381 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:52,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:52,390 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 11:12:52,391 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:52,545 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 2 proven. 97 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2019-08-05 11:12:52,545 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:52,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 11:12:52,546 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 11:12:52,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 11:12:52,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2019-08-05 11:12:52,546 INFO L87 Difference]: Start difference. First operand 85 states and 99 transitions. Second operand 20 states. [2019-08-05 11:12:52,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:52,722 INFO L93 Difference]: Finished difference Result 125 states and 144 transitions. [2019-08-05 11:12:52,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 11:12:52,723 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 69 [2019-08-05 11:12:52,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:52,725 INFO L225 Difference]: With dead ends: 125 [2019-08-05 11:12:52,725 INFO L226 Difference]: Without dead ends: 125 [2019-08-05 11:12:52,725 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=498, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:12:52,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-08-05 11:12:52,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 93. [2019-08-05 11:12:52,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-08-05 11:12:52,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 108 transitions. [2019-08-05 11:12:52,730 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 108 transitions. Word has length 69 [2019-08-05 11:12:52,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:52,730 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 108 transitions. [2019-08-05 11:12:52,731 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 11:12:52,731 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 108 transitions. [2019-08-05 11:12:52,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-08-05 11:12:52,731 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:52,732 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:12:52,732 INFO L418 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:52,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:52,732 INFO L82 PathProgramCache]: Analyzing trace with hash -1307411139, now seen corresponding path program 41 times [2019-08-05 11:12:52,733 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:52,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:52,742 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 11:12:52,743 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:53,016 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 1 proven. 101 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-08-05 11:12:53,017 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:53,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 11:12:53,017 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 11:12:53,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 11:12:53,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2019-08-05 11:12:53,017 INFO L87 Difference]: Start difference. First operand 93 states and 108 transitions. Second operand 20 states. [2019-08-05 11:12:53,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:53,269 INFO L93 Difference]: Finished difference Result 141 states and 162 transitions. [2019-08-05 11:12:53,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 11:12:53,270 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 69 [2019-08-05 11:12:53,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:53,271 INFO L225 Difference]: With dead ends: 141 [2019-08-05 11:12:53,271 INFO L226 Difference]: Without dead ends: 141 [2019-08-05 11:12:53,272 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=127, Invalid=629, Unknown=0, NotChecked=0, Total=756 [2019-08-05 11:12:53,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-08-05 11:12:53,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 89. [2019-08-05 11:12:53,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-08-05 11:12:53,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 103 transitions. [2019-08-05 11:12:53,279 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 103 transitions. Word has length 69 [2019-08-05 11:12:53,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:53,279 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 103 transitions. [2019-08-05 11:12:53,279 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 11:12:53,279 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 103 transitions. [2019-08-05 11:12:53,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-08-05 11:12:53,280 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:53,280 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:12:53,281 INFO L418 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:53,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:53,281 INFO L82 PathProgramCache]: Analyzing trace with hash 223531581, now seen corresponding path program 42 times [2019-08-05 11:12:53,282 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:53,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:53,291 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 11:12:53,293 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:54,830 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 3 proven. 103 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-08-05 11:12:54,830 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:54,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:54,831 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:54,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:54,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=352, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:54,832 INFO L87 Difference]: Start difference. First operand 89 states and 103 transitions. Second operand 21 states. [2019-08-05 11:12:55,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:55,142 INFO L93 Difference]: Finished difference Result 121 states and 141 transitions. [2019-08-05 11:12:55,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:55,142 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 69 [2019-08-05 11:12:55,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:55,144 INFO L225 Difference]: With dead ends: 121 [2019-08-05 11:12:55,144 INFO L226 Difference]: Without dead ends: 121 [2019-08-05 11:12:55,145 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=136, Invalid=676, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:12:55,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-08-05 11:12:55,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 81. [2019-08-05 11:12:55,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-08-05 11:12:55,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 94 transitions. [2019-08-05 11:12:55,149 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 94 transitions. Word has length 69 [2019-08-05 11:12:55,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:55,149 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 94 transitions. [2019-08-05 11:12:55,150 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:55,150 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 94 transitions. [2019-08-05 11:12:55,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-08-05 11:12:55,150 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:55,150 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:12:55,151 INFO L418 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:55,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:55,151 INFO L82 PathProgramCache]: Analyzing trace with hash 588154813, now seen corresponding path program 43 times [2019-08-05 11:12:55,152 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:55,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:55,161 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 11:12:55,163 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:55,665 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 2 proven. 104 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-08-05 11:12:55,666 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:55,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:55,666 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:55,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:55,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=352, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:55,666 INFO L87 Difference]: Start difference. First operand 81 states and 94 transitions. Second operand 21 states. [2019-08-05 11:12:56,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:56,143 INFO L93 Difference]: Finished difference Result 125 states and 145 transitions. [2019-08-05 11:12:56,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:56,144 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 69 [2019-08-05 11:12:56,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:56,145 INFO L225 Difference]: With dead ends: 125 [2019-08-05 11:12:56,145 INFO L226 Difference]: Without dead ends: 125 [2019-08-05 11:12:56,146 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=136, Invalid=676, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:12:56,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-08-05 11:12:56,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 69. [2019-08-05 11:12:56,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-05 11:12:56,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 79 transitions. [2019-08-05 11:12:56,150 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 79 transitions. Word has length 69 [2019-08-05 11:12:56,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:56,150 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 79 transitions. [2019-08-05 11:12:56,150 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:56,150 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 79 transitions. [2019-08-05 11:12:56,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-08-05 11:12:56,151 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:56,151 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:56,151 INFO L418 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:56,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:56,151 INFO L82 PathProgramCache]: Analyzing trace with hash -1765910210, now seen corresponding path program 44 times [2019-08-05 11:12:56,152 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:56,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:56,160 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 11:12:56,162 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:57,381 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 3 proven. 96 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2019-08-05 11:12:57,381 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:57,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 11:12:57,381 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 11:12:57,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 11:12:57,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2019-08-05 11:12:57,382 INFO L87 Difference]: Start difference. First operand 69 states and 79 transitions. Second operand 20 states. [2019-08-05 11:12:57,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:57,539 INFO L93 Difference]: Finished difference Result 145 states and 165 transitions. [2019-08-05 11:12:57,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 11:12:57,540 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 69 [2019-08-05 11:12:57,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:57,541 INFO L225 Difference]: With dead ends: 145 [2019-08-05 11:12:57,541 INFO L226 Difference]: Without dead ends: 145 [2019-08-05 11:12:57,541 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=112, Invalid=440, Unknown=0, NotChecked=0, Total=552 [2019-08-05 11:12:57,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-08-05 11:12:57,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 89. [2019-08-05 11:12:57,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-08-05 11:12:57,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 102 transitions. [2019-08-05 11:12:57,546 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 102 transitions. Word has length 69 [2019-08-05 11:12:57,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:57,547 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 102 transitions. [2019-08-05 11:12:57,547 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 11:12:57,547 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 102 transitions. [2019-08-05 11:12:57,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-08-05 11:12:57,548 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:57,548 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:12:57,548 INFO L418 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:57,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:57,548 INFO L82 PathProgramCache]: Analyzing trace with hash 1333118909, now seen corresponding path program 45 times [2019-08-05 11:12:57,549 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:57,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:57,558 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 11:12:57,559 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:57,912 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 4 proven. 102 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-08-05 11:12:57,912 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:57,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:57,913 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:57,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:57,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:57,913 INFO L87 Difference]: Start difference. First operand 89 states and 102 transitions. Second operand 21 states. [2019-08-05 11:12:58,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:58,181 INFO L93 Difference]: Finished difference Result 149 states and 172 transitions. [2019-08-05 11:12:58,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:58,182 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 69 [2019-08-05 11:12:58,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:58,183 INFO L225 Difference]: With dead ends: 149 [2019-08-05 11:12:58,183 INFO L226 Difference]: Without dead ends: 149 [2019-08-05 11:12:58,184 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=142, Invalid=728, Unknown=0, NotChecked=0, Total=870 [2019-08-05 11:12:58,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-08-05 11:12:58,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 81. [2019-08-05 11:12:58,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-08-05 11:12:58,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 93 transitions. [2019-08-05 11:12:58,189 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 93 transitions. Word has length 69 [2019-08-05 11:12:58,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:58,189 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 93 transitions. [2019-08-05 11:12:58,189 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:58,189 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 93 transitions. [2019-08-05 11:12:58,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-08-05 11:12:58,190 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:58,190 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:12:58,190 INFO L418 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:58,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:58,191 INFO L82 PathProgramCache]: Analyzing trace with hash -1618827845, now seen corresponding path program 46 times [2019-08-05 11:12:58,191 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:58,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:58,203 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 11:12:58,205 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:58,818 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-08-05 11:12:58,818 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:58,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 11:12:58,818 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 11:12:58,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 11:12:58,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2019-08-05 11:12:58,819 INFO L87 Difference]: Start difference. First operand 81 states and 93 transitions. Second operand 20 states. [2019-08-05 11:12:59,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:59,008 INFO L93 Difference]: Finished difference Result 125 states and 143 transitions. [2019-08-05 11:12:59,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 11:12:59,008 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 69 [2019-08-05 11:12:59,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:59,010 INFO L225 Difference]: With dead ends: 125 [2019-08-05 11:12:59,010 INFO L226 Difference]: Without dead ends: 125 [2019-08-05 11:12:59,010 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=157, Invalid=545, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:12:59,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-08-05 11:12:59,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 97. [2019-08-05 11:12:59,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-08-05 11:12:59,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 113 transitions. [2019-08-05 11:12:59,015 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 113 transitions. Word has length 69 [2019-08-05 11:12:59,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:59,016 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 113 transitions. [2019-08-05 11:12:59,016 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 11:12:59,016 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 113 transitions. [2019-08-05 11:12:59,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-08-05 11:12:59,017 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:59,017 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:12:59,017 INFO L418 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:59,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:59,017 INFO L82 PathProgramCache]: Analyzing trace with hash 1697742141, now seen corresponding path program 47 times [2019-08-05 11:12:59,018 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:59,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:59,027 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 11:12:59,028 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:59,211 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 5 proven. 101 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-08-05 11:12:59,212 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:59,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:59,212 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:59,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:59,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=352, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:59,213 INFO L87 Difference]: Start difference. First operand 97 states and 113 transitions. Second operand 21 states. [2019-08-05 11:12:59,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:59,584 INFO L93 Difference]: Finished difference Result 149 states and 172 transitions. [2019-08-05 11:12:59,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:59,584 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 69 [2019-08-05 11:12:59,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:59,586 INFO L225 Difference]: With dead ends: 149 [2019-08-05 11:12:59,586 INFO L226 Difference]: Without dead ends: 149 [2019-08-05 11:12:59,587 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=141, Invalid=671, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:12:59,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-08-05 11:12:59,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 101. [2019-08-05 11:12:59,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-08-05 11:12:59,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 118 transitions. [2019-08-05 11:12:59,591 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 118 transitions. Word has length 69 [2019-08-05 11:12:59,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:59,591 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 118 transitions. [2019-08-05 11:12:59,592 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:59,592 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 118 transitions. [2019-08-05 11:12:59,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-08-05 11:12:59,592 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:59,593 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 6, 6, 6, 6, 6, 6, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:12:59,593 INFO L418 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:59,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:59,593 INFO L82 PathProgramCache]: Analyzing trace with hash -422889668, now seen corresponding path program 48 times [2019-08-05 11:12:59,594 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:59,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:59,604 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 11:12:59,605 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:00,152 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 1 proven. 108 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-08-05 11:13:00,152 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:00,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 11:13:00,153 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 11:13:00,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 11:13:00,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2019-08-05 11:13:00,153 INFO L87 Difference]: Start difference. First operand 101 states and 118 transitions. Second operand 20 states. [2019-08-05 11:13:00,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:00,529 INFO L93 Difference]: Finished difference Result 149 states and 170 transitions. [2019-08-05 11:13:00,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 11:13:00,530 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 69 [2019-08-05 11:13:00,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:00,532 INFO L225 Difference]: With dead ends: 149 [2019-08-05 11:13:00,532 INFO L226 Difference]: Without dead ends: 149 [2019-08-05 11:13:00,532 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=157, Invalid=713, Unknown=0, NotChecked=0, Total=870 [2019-08-05 11:13:00,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-08-05 11:13:00,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 97. [2019-08-05 11:13:00,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-08-05 11:13:00,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 113 transitions. [2019-08-05 11:13:00,541 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 113 transitions. Word has length 69 [2019-08-05 11:13:00,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:00,542 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 113 transitions. [2019-08-05 11:13:00,542 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 11:13:00,542 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 113 transitions. [2019-08-05 11:13:00,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-08-05 11:13:00,543 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:00,543 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:13:00,543 INFO L418 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:00,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:00,543 INFO L82 PathProgramCache]: Analyzing trace with hash -197823811, now seen corresponding path program 49 times [2019-08-05 11:13:00,544 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:00,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:00,556 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 11:13:00,559 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:00,970 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 6 proven. 100 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-08-05 11:13:00,970 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:00,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:13:00,971 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:13:00,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:13:00,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:00,971 INFO L87 Difference]: Start difference. First operand 97 states and 113 transitions. Second operand 21 states. [2019-08-05 11:13:01,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:01,288 INFO L93 Difference]: Finished difference Result 145 states and 166 transitions. [2019-08-05 11:13:01,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:13:01,289 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 69 [2019-08-05 11:13:01,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:01,290 INFO L225 Difference]: With dead ends: 145 [2019-08-05 11:13:01,290 INFO L226 Difference]: Without dead ends: 145 [2019-08-05 11:13:01,291 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=155, Invalid=837, Unknown=0, NotChecked=0, Total=992 [2019-08-05 11:13:01,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-08-05 11:13:01,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 101. [2019-08-05 11:13:01,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-08-05 11:13:01,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 118 transitions. [2019-08-05 11:13:01,294 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 118 transitions. Word has length 69 [2019-08-05 11:13:01,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:01,295 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 118 transitions. [2019-08-05 11:13:01,295 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:13:01,295 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 118 transitions. [2019-08-05 11:13:01,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-08-05 11:13:01,296 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:01,296 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 6, 6, 6, 6, 6, 6, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:13:01,296 INFO L418 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:01,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:01,296 INFO L82 PathProgramCache]: Analyzing trace with hash -1393761988, now seen corresponding path program 50 times [2019-08-05 11:13:01,297 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:01,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:01,306 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 11:13:01,308 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:02,054 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 5 proven. 108 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2019-08-05 11:13:02,054 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:02,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:13:02,054 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:13:02,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:13:02,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:02,055 INFO L87 Difference]: Start difference. First operand 101 states and 118 transitions. Second operand 21 states. [2019-08-05 11:13:02,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:02,310 INFO L93 Difference]: Finished difference Result 137 states and 158 transitions. [2019-08-05 11:13:02,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:13:02,310 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 69 [2019-08-05 11:13:02,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:02,312 INFO L225 Difference]: With dead ends: 137 [2019-08-05 11:13:02,312 INFO L226 Difference]: Without dead ends: 137 [2019-08-05 11:13:02,313 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=149, Invalid=663, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:13:02,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-08-05 11:13:02,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 89. [2019-08-05 11:13:02,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-08-05 11:13:02,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 103 transitions. [2019-08-05 11:13:02,317 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 103 transitions. Word has length 69 [2019-08-05 11:13:02,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:02,318 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 103 transitions. [2019-08-05 11:13:02,318 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:13:02,318 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 103 transitions. [2019-08-05 11:13:02,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-08-05 11:13:02,319 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:02,319 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 6, 6, 6, 6, 6, 6, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:13:02,319 INFO L418 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:02,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:02,319 INFO L82 PathProgramCache]: Analyzing trace with hash 1472676284, now seen corresponding path program 51 times [2019-08-05 11:13:02,320 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:02,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:02,328 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 11:13:02,330 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:02,672 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 2 proven. 111 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2019-08-05 11:13:02,673 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:02,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:13:02,673 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:13:02,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:13:02,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:02,674 INFO L87 Difference]: Start difference. First operand 89 states and 103 transitions. Second operand 21 states. [2019-08-05 11:13:02,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:02,908 INFO L93 Difference]: Finished difference Result 153 states and 175 transitions. [2019-08-05 11:13:02,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:13:02,909 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 69 [2019-08-05 11:13:02,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:02,910 INFO L225 Difference]: With dead ends: 153 [2019-08-05 11:13:02,911 INFO L226 Difference]: Without dead ends: 153 [2019-08-05 11:13:02,911 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=149, Invalid=663, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:13:02,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-08-05 11:13:02,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 85. [2019-08-05 11:13:02,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-08-05 11:13:02,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 98 transitions. [2019-08-05 11:13:02,916 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 98 transitions. Word has length 69 [2019-08-05 11:13:02,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:02,916 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 98 transitions. [2019-08-05 11:13:02,916 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:13:02,916 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 98 transitions. [2019-08-05 11:13:02,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-08-05 11:13:02,917 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:02,917 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:13:02,917 INFO L418 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:02,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:02,918 INFO L82 PathProgramCache]: Analyzing trace with hash 1685893821, now seen corresponding path program 52 times [2019-08-05 11:13:02,918 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:02,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:02,927 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 11:13:02,928 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:03,418 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 3 proven. 103 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-08-05 11:13:03,418 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:03,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:13:03,419 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:13:03,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:13:03,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:03,420 INFO L87 Difference]: Start difference. First operand 85 states and 98 transitions. Second operand 21 states. [2019-08-05 11:13:03,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:03,898 INFO L93 Difference]: Finished difference Result 153 states and 175 transitions. [2019-08-05 11:13:03,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:13:03,898 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 69 [2019-08-05 11:13:03,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:03,899 INFO L225 Difference]: With dead ends: 153 [2019-08-05 11:13:03,899 INFO L226 Difference]: Without dead ends: 153 [2019-08-05 11:13:03,900 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=148, Invalid=782, Unknown=0, NotChecked=0, Total=930 [2019-08-05 11:13:03,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-08-05 11:13:03,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 93. [2019-08-05 11:13:03,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-08-05 11:13:03,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 107 transitions. [2019-08-05 11:13:03,905 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 107 transitions. Word has length 69 [2019-08-05 11:13:03,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:03,905 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 107 transitions. [2019-08-05 11:13:03,906 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:13:03,906 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 107 transitions. [2019-08-05 11:13:03,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-08-05 11:13:03,906 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:03,907 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:13:03,907 INFO L418 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:03,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:03,907 INFO L82 PathProgramCache]: Analyzing trace with hash -209672131, now seen corresponding path program 53 times [2019-08-05 11:13:03,908 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:03,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:03,916 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 11:13:03,918 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:04,102 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 5 proven. 101 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-08-05 11:13:04,102 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:04,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:13:04,103 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:13:04,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:13:04,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:04,103 INFO L87 Difference]: Start difference. First operand 93 states and 107 transitions. Second operand 21 states. [2019-08-05 11:13:04,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:04,505 INFO L93 Difference]: Finished difference Result 145 states and 166 transitions. [2019-08-05 11:13:04,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:13:04,505 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 69 [2019-08-05 11:13:04,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:04,506 INFO L225 Difference]: With dead ends: 145 [2019-08-05 11:13:04,507 INFO L226 Difference]: Without dead ends: 145 [2019-08-05 11:13:04,507 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=155, Invalid=837, Unknown=0, NotChecked=0, Total=992 [2019-08-05 11:13:04,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-08-05 11:13:04,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 97. [2019-08-05 11:13:04,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-08-05 11:13:04,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 112 transitions. [2019-08-05 11:13:04,512 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 112 transitions. Word has length 69 [2019-08-05 11:13:04,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:04,512 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 112 transitions. [2019-08-05 11:13:04,512 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:13:04,512 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 112 transitions. [2019-08-05 11:13:04,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-08-05 11:13:04,513 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:04,513 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 6, 6, 6, 6, 6, 6, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:13:04,513 INFO L418 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:04,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:04,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1108053052, now seen corresponding path program 54 times [2019-08-05 11:13:04,514 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:04,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:04,522 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 11:13:04,524 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:04,841 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 3 proven. 110 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2019-08-05 11:13:04,841 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:04,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:13:04,842 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:13:04,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:13:04,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:04,842 INFO L87 Difference]: Start difference. First operand 97 states and 112 transitions. Second operand 21 states. [2019-08-05 11:13:05,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:05,080 INFO L93 Difference]: Finished difference Result 161 states and 186 transitions. [2019-08-05 11:13:05,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:13:05,081 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 69 [2019-08-05 11:13:05,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:05,082 INFO L225 Difference]: With dead ends: 161 [2019-08-05 11:13:05,082 INFO L226 Difference]: Without dead ends: 161 [2019-08-05 11:13:05,083 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=149, Invalid=663, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:13:05,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-08-05 11:13:05,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 105. [2019-08-05 11:13:05,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-08-05 11:13:05,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 121 transitions. [2019-08-05 11:13:05,087 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 121 transitions. Word has length 69 [2019-08-05 11:13:05,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:05,088 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 121 transitions. [2019-08-05 11:13:05,088 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:13:05,088 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 121 transitions. [2019-08-05 11:13:05,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-08-05 11:13:05,089 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:05,089 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 6, 6, 6, 6, 6, 6, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:13:05,089 INFO L418 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:05,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:05,090 INFO L82 PathProgramCache]: Analyzing trace with hash -1405610308, now seen corresponding path program 55 times [2019-08-05 11:13:05,090 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:05,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:05,098 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 11:13:05,100 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:05,340 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 4 proven. 109 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2019-08-05 11:13:05,341 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:05,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:13:05,341 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:13:05,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:13:05,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:05,341 INFO L87 Difference]: Start difference. First operand 105 states and 121 transitions. Second operand 21 states. [2019-08-05 11:13:05,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:05,597 INFO L93 Difference]: Finished difference Result 149 states and 171 transitions. [2019-08-05 11:13:05,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:13:05,597 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 69 [2019-08-05 11:13:05,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:05,598 INFO L225 Difference]: With dead ends: 149 [2019-08-05 11:13:05,599 INFO L226 Difference]: Without dead ends: 149 [2019-08-05 11:13:05,599 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=149, Invalid=663, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:13:05,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-08-05 11:13:05,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 93. [2019-08-05 11:13:05,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-08-05 11:13:05,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 107 transitions. [2019-08-05 11:13:05,603 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 107 transitions. Word has length 69 [2019-08-05 11:13:05,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:05,604 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 107 transitions. [2019-08-05 11:13:05,604 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:13:05,604 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 107 transitions. [2019-08-05 11:13:05,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-08-05 11:13:05,605 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:05,605 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:13:05,605 INFO L418 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:05,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:05,605 INFO L82 PathProgramCache]: Analyzing trace with hash -1990976067, now seen corresponding path program 56 times [2019-08-05 11:13:05,606 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:05,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:05,615 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 11:13:05,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:06,062 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 2 proven. 100 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-08-05 11:13:06,063 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:06,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 11:13:06,063 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 11:13:06,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 11:13:06,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2019-08-05 11:13:06,063 INFO L87 Difference]: Start difference. First operand 93 states and 107 transitions. Second operand 20 states. [2019-08-05 11:13:06,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:06,284 INFO L93 Difference]: Finished difference Result 149 states and 169 transitions. [2019-08-05 11:13:06,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 11:13:06,284 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 69 [2019-08-05 11:13:06,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:06,285 INFO L225 Difference]: With dead ends: 149 [2019-08-05 11:13:06,285 INFO L226 Difference]: Without dead ends: 149 [2019-08-05 11:13:06,285 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=126, Invalid=576, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:13:06,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-08-05 11:13:06,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 77. [2019-08-05 11:13:06,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-05 11:13:06,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 88 transitions. [2019-08-05 11:13:06,290 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 88 transitions. Word has length 69 [2019-08-05 11:13:06,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:06,290 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 88 transitions. [2019-08-05 11:13:06,290 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 11:13:06,291 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 88 transitions. [2019-08-05 11:13:06,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 11:13:06,291 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:06,291 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:13:06,292 INFO L418 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:06,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:06,292 INFO L82 PathProgramCache]: Analyzing trace with hash -1257362209, now seen corresponding path program 57 times [2019-08-05 11:13:06,293 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:06,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:06,302 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 11:13:06,303 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:06,843 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 3 proven. 122 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2019-08-05 11:13:06,844 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:06,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 11:13:06,844 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 11:13:06,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 11:13:06,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=383, Unknown=0, NotChecked=0, Total=462 [2019-08-05 11:13:06,844 INFO L87 Difference]: Start difference. First operand 77 states and 88 transitions. Second operand 22 states. [2019-08-05 11:13:07,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:07,002 INFO L93 Difference]: Finished difference Result 153 states and 174 transitions. [2019-08-05 11:13:07,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 11:13:07,002 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 77 [2019-08-05 11:13:07,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:07,003 INFO L225 Difference]: With dead ends: 153 [2019-08-05 11:13:07,004 INFO L226 Difference]: Without dead ends: 153 [2019-08-05 11:13:07,004 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=117, Invalid=533, Unknown=0, NotChecked=0, Total=650 [2019-08-05 11:13:07,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-08-05 11:13:07,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 97. [2019-08-05 11:13:07,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-08-05 11:13:07,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 111 transitions. [2019-08-05 11:13:07,008 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 111 transitions. Word has length 77 [2019-08-05 11:13:07,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:07,008 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 111 transitions. [2019-08-05 11:13:07,008 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 11:13:07,008 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 111 transitions. [2019-08-05 11:13:07,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 11:13:07,009 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:07,009 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 7, 7, 7, 7, 7, 7, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:13:07,010 INFO L418 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:07,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:07,010 INFO L82 PathProgramCache]: Analyzing trace with hash -1837165988, now seen corresponding path program 58 times [2019-08-05 11:13:07,010 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:07,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:07,019 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 11:13:07,021 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:07,180 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2019-08-05 11:13:07,180 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:07,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 11:13:07,181 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 11:13:07,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 11:13:07,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=371, Unknown=0, NotChecked=0, Total=462 [2019-08-05 11:13:07,181 INFO L87 Difference]: Start difference. First operand 97 states and 111 transitions. Second operand 22 states. [2019-08-05 11:13:07,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:07,607 INFO L93 Difference]: Finished difference Result 161 states and 186 transitions. [2019-08-05 11:13:07,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 11:13:07,607 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 77 [2019-08-05 11:13:07,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:07,608 INFO L225 Difference]: With dead ends: 161 [2019-08-05 11:13:07,609 INFO L226 Difference]: Without dead ends: 161 [2019-08-05 11:13:07,609 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=168, Invalid=644, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:13:07,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-08-05 11:13:07,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 113. [2019-08-05 11:13:07,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-08-05 11:13:07,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 131 transitions. [2019-08-05 11:13:07,614 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 131 transitions. Word has length 77 [2019-08-05 11:13:07,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:07,614 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 131 transitions. [2019-08-05 11:13:07,614 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 11:13:07,614 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 131 transitions. [2019-08-05 11:13:07,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 11:13:07,615 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:07,615 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:13:07,616 INFO L418 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:07,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:07,616 INFO L82 PathProgramCache]: Analyzing trace with hash 1170632925, now seen corresponding path program 59 times [2019-08-05 11:13:07,617 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:07,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:07,628 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 11:13:07,629 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:07,878 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 1 proven. 130 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-08-05 11:13:07,879 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:07,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 11:13:07,879 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 11:13:07,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 11:13:07,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2019-08-05 11:13:07,880 INFO L87 Difference]: Start difference. First operand 113 states and 131 transitions. Second operand 22 states. [2019-08-05 11:13:08,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:08,233 INFO L93 Difference]: Finished difference Result 177 states and 203 transitions. [2019-08-05 11:13:08,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 11:13:08,234 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 77 [2019-08-05 11:13:08,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:08,235 INFO L225 Difference]: With dead ends: 177 [2019-08-05 11:13:08,235 INFO L226 Difference]: Without dead ends: 177 [2019-08-05 11:13:08,236 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=166, Invalid=826, Unknown=0, NotChecked=0, Total=992 [2019-08-05 11:13:08,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-08-05 11:13:08,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 109. [2019-08-05 11:13:08,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-08-05 11:13:08,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 126 transitions. [2019-08-05 11:13:08,239 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 126 transitions. Word has length 77 [2019-08-05 11:13:08,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:08,240 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 126 transitions. [2019-08-05 11:13:08,240 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 11:13:08,240 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 126 transitions. [2019-08-05 11:13:08,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 11:13:08,240 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:08,241 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:13:08,241 INFO L418 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:08,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:08,241 INFO L82 PathProgramCache]: Analyzing trace with hash 29806174, now seen corresponding path program 60 times [2019-08-05 11:13:08,242 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:08,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:08,252 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 11:13:08,254 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:08,630 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 4 proven. 127 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-08-05 11:13:08,631 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:08,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 11:13:08,631 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 11:13:08,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 11:13:08,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=434, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:13:08,632 INFO L87 Difference]: Start difference. First operand 109 states and 126 transitions. Second operand 23 states. [2019-08-05 11:13:08,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:08,971 INFO L93 Difference]: Finished difference Result 169 states and 197 transitions. [2019-08-05 11:13:08,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 11:13:08,971 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 77 [2019-08-05 11:13:08,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:08,973 INFO L225 Difference]: With dead ends: 169 [2019-08-05 11:13:08,973 INFO L226 Difference]: Without dead ends: 169 [2019-08-05 11:13:08,973 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=157, Invalid=899, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 11:13:08,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-08-05 11:13:08,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 101. [2019-08-05 11:13:08,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-08-05 11:13:08,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 117 transitions. [2019-08-05 11:13:08,978 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 117 transitions. Word has length 77 [2019-08-05 11:13:08,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:08,979 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 117 transitions. [2019-08-05 11:13:08,979 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 11:13:08,979 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 117 transitions. [2019-08-05 11:13:08,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 11:13:08,980 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:08,980 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:13:08,980 INFO L418 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:08,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:08,981 INFO L82 PathProgramCache]: Analyzing trace with hash -623639586, now seen corresponding path program 61 times [2019-08-05 11:13:08,981 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:08,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:08,991 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 11:13:08,992 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:09,440 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 5 proven. 127 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-08-05 11:13:09,440 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:09,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 11:13:09,441 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 11:13:09,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 11:13:09,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=429, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:13:09,441 INFO L87 Difference]: Start difference. First operand 101 states and 117 transitions. Second operand 23 states. [2019-08-05 11:13:09,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:09,722 INFO L93 Difference]: Finished difference Result 153 states and 178 transitions. [2019-08-05 11:13:09,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 11:13:09,722 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 77 [2019-08-05 11:13:09,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:09,724 INFO L225 Difference]: With dead ends: 153 [2019-08-05 11:13:09,724 INFO L226 Difference]: Without dead ends: 153 [2019-08-05 11:13:09,724 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=158, Invalid=834, Unknown=0, NotChecked=0, Total=992 [2019-08-05 11:13:09,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-08-05 11:13:09,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 105. [2019-08-05 11:13:09,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-08-05 11:13:09,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 122 transitions. [2019-08-05 11:13:09,729 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 122 transitions. Word has length 77 [2019-08-05 11:13:09,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:09,729 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 122 transitions. [2019-08-05 11:13:09,729 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 11:13:09,729 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 122 transitions. [2019-08-05 11:13:09,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 11:13:09,730 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:09,730 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:13:09,730 INFO L418 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:09,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:09,731 INFO L82 PathProgramCache]: Analyzing trace with hash -131007651, now seen corresponding path program 62 times [2019-08-05 11:13:09,731 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:09,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:09,741 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 11:13:09,742 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:10,168 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 2 proven. 134 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2019-08-05 11:13:10,169 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:10,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 11:13:10,169 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 11:13:10,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 11:13:10,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=423, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:13:10,170 INFO L87 Difference]: Start difference. First operand 105 states and 122 transitions. Second operand 23 states. [2019-08-05 11:13:10,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:10,449 INFO L93 Difference]: Finished difference Result 169 states and 196 transitions. [2019-08-05 11:13:10,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 11:13:10,450 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 77 [2019-08-05 11:13:10,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:10,451 INFO L225 Difference]: With dead ends: 169 [2019-08-05 11:13:10,451 INFO L226 Difference]: Without dead ends: 169 [2019-08-05 11:13:10,452 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=168, Invalid=824, Unknown=0, NotChecked=0, Total=992 [2019-08-05 11:13:10,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-08-05 11:13:10,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 101. [2019-08-05 11:13:10,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-08-05 11:13:10,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 117 transitions. [2019-08-05 11:13:10,456 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 117 transitions. Word has length 77 [2019-08-05 11:13:10,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:10,456 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 117 transitions. [2019-08-05 11:13:10,456 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 11:13:10,456 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 117 transitions. [2019-08-05 11:13:10,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 11:13:10,457 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:10,457 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:13:10,458 INFO L418 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:10,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:10,458 INFO L82 PathProgramCache]: Analyzing trace with hash 522438109, now seen corresponding path program 63 times [2019-08-05 11:13:10,459 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:10,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:10,468 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 11:13:10,469 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:10,712 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 3 proven. 133 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2019-08-05 11:13:10,713 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:10,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 11:13:10,713 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 11:13:10,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 11:13:10,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=423, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:13:10,713 INFO L87 Difference]: Start difference. First operand 101 states and 117 transitions. Second operand 23 states. [2019-08-05 11:13:11,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:11,250 INFO L93 Difference]: Finished difference Result 165 states and 192 transitions. [2019-08-05 11:13:11,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 11:13:11,251 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 77 [2019-08-05 11:13:11,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:11,252 INFO L225 Difference]: With dead ends: 165 [2019-08-05 11:13:11,252 INFO L226 Difference]: Without dead ends: 165 [2019-08-05 11:13:11,252 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=168, Invalid=824, Unknown=0, NotChecked=0, Total=992 [2019-08-05 11:13:11,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-08-05 11:13:11,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 109. [2019-08-05 11:13:11,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-08-05 11:13:11,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 126 transitions. [2019-08-05 11:13:11,257 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 126 transitions. Word has length 77 [2019-08-05 11:13:11,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:11,257 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 126 transitions. [2019-08-05 11:13:11,257 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 11:13:11,258 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 126 transitions. [2019-08-05 11:13:11,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 11:13:11,258 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:11,258 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:13:11,259 INFO L418 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:11,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:11,259 INFO L82 PathProgramCache]: Analyzing trace with hash 678000990, now seen corresponding path program 64 times [2019-08-05 11:13:11,260 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:11,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:11,269 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 11:13:11,270 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:11,468 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 6 proven. 125 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-08-05 11:13:11,469 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:11,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 11:13:11,469 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 11:13:11,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 11:13:11,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=434, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:13:11,469 INFO L87 Difference]: Start difference. First operand 109 states and 126 transitions. Second operand 23 states. [2019-08-05 11:13:11,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:11,795 INFO L93 Difference]: Finished difference Result 169 states and 195 transitions. [2019-08-05 11:13:11,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 11:13:11,796 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 77 [2019-08-05 11:13:11,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:11,797 INFO L225 Difference]: With dead ends: 169 [2019-08-05 11:13:11,797 INFO L226 Difference]: Without dead ends: 169 [2019-08-05 11:13:11,797 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=170, Invalid=1020, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 11:13:11,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-08-05 11:13:11,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 113. [2019-08-05 11:13:11,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-08-05 11:13:11,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 131 transitions. [2019-08-05 11:13:11,802 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 131 transitions. Word has length 77 [2019-08-05 11:13:11,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:11,802 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 131 transitions. [2019-08-05 11:13:11,802 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 11:13:11,803 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 131 transitions. [2019-08-05 11:13:11,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 11:13:11,803 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:11,803 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:13:11,804 INFO L418 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:11,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:11,804 INFO L82 PathProgramCache]: Analyzing trace with hash 1965169373, now seen corresponding path program 65 times [2019-08-05 11:13:11,805 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:11,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:11,813 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 11:13:11,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:12,055 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 5 proven. 131 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2019-08-05 11:13:12,055 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:12,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 11:13:12,055 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 11:13:12,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 11:13:12,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=423, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:13:12,056 INFO L87 Difference]: Start difference. First operand 113 states and 131 transitions. Second operand 23 states. [2019-08-05 11:13:12,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:12,536 INFO L93 Difference]: Finished difference Result 169 states and 197 transitions. [2019-08-05 11:13:12,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 11:13:12,537 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 77 [2019-08-05 11:13:12,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:12,538 INFO L225 Difference]: With dead ends: 169 [2019-08-05 11:13:12,538 INFO L226 Difference]: Without dead ends: 169 [2019-08-05 11:13:12,538 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=168, Invalid=824, Unknown=0, NotChecked=0, Total=992 [2019-08-05 11:13:12,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-08-05 11:13:12,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 97. [2019-08-05 11:13:12,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-08-05 11:13:12,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 112 transitions. [2019-08-05 11:13:12,541 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 112 transitions. Word has length 77 [2019-08-05 11:13:12,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:12,542 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 112 transitions. [2019-08-05 11:13:12,542 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 11:13:12,542 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 112 transitions. [2019-08-05 11:13:12,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 11:13:12,543 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:12,543 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:13:12,543 INFO L418 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:12,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:12,543 INFO L82 PathProgramCache]: Analyzing trace with hash -957302434, now seen corresponding path program 66 times [2019-08-05 11:13:12,544 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:12,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:12,552 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 11:13:12,554 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:13,119 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 3 proven. 128 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-08-05 11:13:13,119 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:13,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 11:13:13,120 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 11:13:13,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 11:13:13,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=434, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:13:13,120 INFO L87 Difference]: Start difference. First operand 97 states and 112 transitions. Second operand 23 states. [2019-08-05 11:13:13,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:13,445 INFO L93 Difference]: Finished difference Result 157 states and 181 transitions. [2019-08-05 11:13:13,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 11:13:13,446 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 77 [2019-08-05 11:13:13,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:13,447 INFO L225 Difference]: With dead ends: 157 [2019-08-05 11:13:13,447 INFO L226 Difference]: Without dead ends: 157 [2019-08-05 11:13:13,448 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=163, Invalid=959, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 11:13:13,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-08-05 11:13:13,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 105. [2019-08-05 11:13:13,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-08-05 11:13:13,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 121 transitions. [2019-08-05 11:13:13,452 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 121 transitions. Word has length 77 [2019-08-05 11:13:13,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:13,453 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 121 transitions. [2019-08-05 11:13:13,453 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 11:13:13,453 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 121 transitions. [2019-08-05 11:13:13,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 11:13:13,454 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:13,454 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:13:13,454 INFO L418 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:13,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:13,455 INFO L82 PathProgramCache]: Analyzing trace with hash -764730274, now seen corresponding path program 67 times [2019-08-05 11:13:13,455 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:13,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:13,465 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 11:13:13,467 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:13,774 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 2 proven. 124 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-08-05 11:13:13,774 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:13,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 11:13:13,774 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 11:13:13,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 11:13:13,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=393, Unknown=0, NotChecked=0, Total=462 [2019-08-05 11:13:13,775 INFO L87 Difference]: Start difference. First operand 105 states and 121 transitions. Second operand 22 states. [2019-08-05 11:13:13,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:13,981 INFO L93 Difference]: Finished difference Result 161 states and 184 transitions. [2019-08-05 11:13:13,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 11:13:13,981 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 77 [2019-08-05 11:13:13,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:13,982 INFO L225 Difference]: With dead ends: 161 [2019-08-05 11:13:13,982 INFO L226 Difference]: Without dead ends: 161 [2019-08-05 11:13:13,982 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=133, Invalid=679, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:13:13,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-08-05 11:13:13,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 93. [2019-08-05 11:13:13,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-08-05 11:13:13,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 107 transitions. [2019-08-05 11:13:13,986 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 107 transitions. Word has length 77 [2019-08-05 11:13:13,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:13,987 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 107 transitions. [2019-08-05 11:13:13,987 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 11:13:13,987 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 107 transitions. [2019-08-05 11:13:13,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 11:13:13,988 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:13,988 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:13:13,988 INFO L418 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:13,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:13,988 INFO L82 PathProgramCache]: Analyzing trace with hash 344338142, now seen corresponding path program 68 times [2019-08-05 11:13:13,989 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:13,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:13,999 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 11:13:14,001 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:15,163 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 5 proven. 126 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-08-05 11:13:15,163 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:15,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 11:13:15,163 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 11:13:15,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 11:13:15,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=434, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:13:15,164 INFO L87 Difference]: Start difference. First operand 93 states and 107 transitions. Second operand 23 states. [2019-08-05 11:13:15,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:15,485 INFO L93 Difference]: Finished difference Result 133 states and 153 transitions. [2019-08-05 11:13:15,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 11:13:15,485 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 77 [2019-08-05 11:13:15,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:15,487 INFO L225 Difference]: With dead ends: 133 [2019-08-05 11:13:15,487 INFO L226 Difference]: Without dead ends: 133 [2019-08-05 11:13:15,487 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=170, Invalid=1020, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 11:13:15,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-08-05 11:13:15,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 97. [2019-08-05 11:13:15,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-08-05 11:13:15,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 112 transitions. [2019-08-05 11:13:15,491 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 112 transitions. Word has length 77 [2019-08-05 11:13:15,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:15,492 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 112 transitions. [2019-08-05 11:13:15,492 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 11:13:15,492 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 112 transitions. [2019-08-05 11:13:15,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 11:13:15,492 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:15,493 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:13:15,493 INFO L418 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:15,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:15,493 INFO L82 PathProgramCache]: Analyzing trace with hash 1631506525, now seen corresponding path program 69 times [2019-08-05 11:13:15,494 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:15,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:15,502 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 11:13:15,503 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:15,764 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 4 proven. 132 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2019-08-05 11:13:15,764 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:15,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 11:13:15,765 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 11:13:15,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 11:13:15,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=423, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:13:15,765 INFO L87 Difference]: Start difference. First operand 97 states and 112 transitions. Second operand 23 states. [2019-08-05 11:13:16,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:16,255 INFO L93 Difference]: Finished difference Result 141 states and 164 transitions. [2019-08-05 11:13:16,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 11:13:16,256 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 77 [2019-08-05 11:13:16,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:16,256 INFO L225 Difference]: With dead ends: 141 [2019-08-05 11:13:16,257 INFO L226 Difference]: Without dead ends: 141 [2019-08-05 11:13:16,257 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=168, Invalid=824, Unknown=0, NotChecked=0, Total=992 [2019-08-05 11:13:16,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-08-05 11:13:16,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 77. [2019-08-05 11:13:16,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-05 11:13:16,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 88 transitions. [2019-08-05 11:13:16,261 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 88 transitions. Word has length 77 [2019-08-05 11:13:16,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:16,261 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 88 transitions. [2019-08-05 11:13:16,261 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 11:13:16,261 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 88 transitions. [2019-08-05 11:13:16,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 11:13:16,262 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:16,262 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:13:16,262 INFO L418 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:16,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:16,263 INFO L82 PathProgramCache]: Analyzing trace with hash -1415778594, now seen corresponding path program 70 times [2019-08-05 11:13:16,263 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:16,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:16,272 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 11:13:16,274 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:16,447 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 4 proven. 127 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-08-05 11:13:16,448 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:16,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 11:13:16,448 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 11:13:16,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 11:13:16,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=429, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:13:16,449 INFO L87 Difference]: Start difference. First operand 77 states and 88 transitions. Second operand 23 states. [2019-08-05 11:13:16,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:16,781 INFO L93 Difference]: Finished difference Result 169 states and 194 transitions. [2019-08-05 11:13:16,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 11:13:16,782 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 77 [2019-08-05 11:13:16,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:16,782 INFO L225 Difference]: With dead ends: 169 [2019-08-05 11:13:16,783 INFO L226 Difference]: Without dead ends: 169 [2019-08-05 11:13:16,783 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=191, Invalid=1069, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 11:13:16,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-08-05 11:13:16,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 97. [2019-08-05 11:13:16,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-08-05 11:13:16,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 111 transitions. [2019-08-05 11:13:16,787 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 111 transitions. Word has length 77 [2019-08-05 11:13:16,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:16,788 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 111 transitions. [2019-08-05 11:13:16,788 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 11:13:16,788 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 111 transitions. [2019-08-05 11:13:16,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 11:13:16,789 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:16,789 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:13:16,789 INFO L418 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:16,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:16,789 INFO L82 PathProgramCache]: Analyzing trace with hash -114138018, now seen corresponding path program 71 times [2019-08-05 11:13:16,790 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:16,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:16,798 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 11:13:16,800 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:17,398 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 6 proven. 125 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-08-05 11:13:17,399 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:17,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 11:13:17,399 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 11:13:17,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 11:13:17,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=429, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:13:17,400 INFO L87 Difference]: Start difference. First operand 97 states and 111 transitions. Second operand 23 states. [2019-08-05 11:13:17,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:17,739 INFO L93 Difference]: Finished difference Result 177 states and 202 transitions. [2019-08-05 11:13:17,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 11:13:17,740 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 77 [2019-08-05 11:13:17,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:17,741 INFO L225 Difference]: With dead ends: 177 [2019-08-05 11:13:17,741 INFO L226 Difference]: Without dead ends: 177 [2019-08-05 11:13:17,742 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=182, Invalid=1008, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 11:13:17,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-08-05 11:13:17,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 101. [2019-08-05 11:13:17,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-08-05 11:13:17,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 116 transitions. [2019-08-05 11:13:17,746 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 116 transitions. Word has length 77 [2019-08-05 11:13:17,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:17,746 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 116 transitions. [2019-08-05 11:13:17,746 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 11:13:17,746 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 116 transitions. [2019-08-05 11:13:17,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 11:13:17,747 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:17,747 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:13:17,747 INFO L418 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:17,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:17,748 INFO L82 PathProgramCache]: Analyzing trace with hash 1173030365, now seen corresponding path program 72 times [2019-08-05 11:13:17,748 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:17,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:17,757 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 11:13:17,758 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:18,114 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 5 proven. 131 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2019-08-05 11:13:18,114 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:18,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 11:13:18,114 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 11:13:18,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 11:13:18,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=430, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:13:18,115 INFO L87 Difference]: Start difference. First operand 101 states and 116 transitions. Second operand 23 states. [2019-08-05 11:13:18,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:18,457 INFO L93 Difference]: Finished difference Result 177 states and 205 transitions. [2019-08-05 11:13:18,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 11:13:18,457 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 77 [2019-08-05 11:13:18,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:18,459 INFO L225 Difference]: With dead ends: 177 [2019-08-05 11:13:18,459 INFO L226 Difference]: Without dead ends: 177 [2019-08-05 11:13:18,459 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=172, Invalid=884, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 11:13:18,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-08-05 11:13:18,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 89. [2019-08-05 11:13:18,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-08-05 11:13:18,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 102 transitions. [2019-08-05 11:13:18,463 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 102 transitions. Word has length 77 [2019-08-05 11:13:18,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:18,463 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 102 transitions. [2019-08-05 11:13:18,464 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 11:13:18,464 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 102 transitions. [2019-08-05 11:13:18,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 11:13:18,464 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:18,464 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:13:18,465 INFO L418 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:18,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:18,465 INFO L82 PathProgramCache]: Analyzing trace with hash -398674725, now seen corresponding path program 73 times [2019-08-05 11:13:18,466 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:18,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:18,474 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 11:13:18,475 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:18,816 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2019-08-05 11:13:18,816 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:18,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 11:13:18,817 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 11:13:18,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 11:13:18,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=364, Unknown=0, NotChecked=0, Total=462 [2019-08-05 11:13:18,817 INFO L87 Difference]: Start difference. First operand 89 states and 102 transitions. Second operand 22 states. [2019-08-05 11:13:19,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:19,052 INFO L93 Difference]: Finished difference Result 141 states and 161 transitions. [2019-08-05 11:13:19,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 11:13:19,052 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 77 [2019-08-05 11:13:19,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:19,053 INFO L225 Difference]: With dead ends: 141 [2019-08-05 11:13:19,054 INFO L226 Difference]: Without dead ends: 141 [2019-08-05 11:13:19,054 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=194, Invalid=676, Unknown=0, NotChecked=0, Total=870 [2019-08-05 11:13:19,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-08-05 11:13:19,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 109. [2019-08-05 11:13:19,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-08-05 11:13:19,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 127 transitions. [2019-08-05 11:13:19,059 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 127 transitions. Word has length 77 [2019-08-05 11:13:19,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:19,059 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 127 transitions. [2019-08-05 11:13:19,059 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 11:13:19,059 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 127 transitions. [2019-08-05 11:13:19,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 11:13:19,060 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:19,060 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:13:19,060 INFO L418 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:19,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:19,061 INFO L82 PathProgramCache]: Analyzing trace with hash -1223206434, now seen corresponding path program 74 times [2019-08-05 11:13:19,061 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:19,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:19,068 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 11:13:19,070 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:19,472 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 8 proven. 123 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-08-05 11:13:19,472 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:19,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 11:13:19,473 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 11:13:19,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 11:13:19,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=429, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:13:19,473 INFO L87 Difference]: Start difference. First operand 109 states and 127 transitions. Second operand 23 states. [2019-08-05 11:13:19,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:19,773 INFO L93 Difference]: Finished difference Result 177 states and 203 transitions. [2019-08-05 11:13:19,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 11:13:19,774 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 77 [2019-08-05 11:13:19,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:19,775 INFO L225 Difference]: With dead ends: 177 [2019-08-05 11:13:19,775 INFO L226 Difference]: Without dead ends: 177 [2019-08-05 11:13:19,776 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=177, Invalid=945, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 11:13:19,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-08-05 11:13:19,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 121. [2019-08-05 11:13:19,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-08-05 11:13:19,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 141 transitions. [2019-08-05 11:13:19,780 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 141 transitions. Word has length 77 [2019-08-05 11:13:19,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:19,780 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 141 transitions. [2019-08-05 11:13:19,780 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 11:13:19,780 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 141 transitions. [2019-08-05 11:13:19,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 11:13:19,781 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:19,781 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 7, 7, 7, 7, 7, 7, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:13:19,781 INFO L418 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:19,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:19,781 INFO L82 PathProgramCache]: Analyzing trace with hash -1685843108, now seen corresponding path program 75 times [2019-08-05 11:13:19,782 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:19,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:19,790 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 11:13:19,791 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:19,979 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 1 proven. 139 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2019-08-05 11:13:19,979 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:19,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 11:13:19,980 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 11:13:19,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 11:13:19,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=384, Unknown=0, NotChecked=0, Total=462 [2019-08-05 11:13:19,980 INFO L87 Difference]: Start difference. First operand 121 states and 141 transitions. Second operand 22 states. [2019-08-05 11:13:20,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:20,238 INFO L93 Difference]: Finished difference Result 181 states and 206 transitions. [2019-08-05 11:13:20,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 11:13:20,239 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 77 [2019-08-05 11:13:20,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:20,240 INFO L225 Difference]: With dead ends: 181 [2019-08-05 11:13:20,240 INFO L226 Difference]: Without dead ends: 181 [2019-08-05 11:13:20,241 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=201, Invalid=921, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 11:13:20,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-08-05 11:13:20,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 117. [2019-08-05 11:13:20,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-08-05 11:13:20,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 136 transitions. [2019-08-05 11:13:20,245 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 136 transitions. Word has length 77 [2019-08-05 11:13:20,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:20,246 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 136 transitions. [2019-08-05 11:13:20,246 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 11:13:20,246 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 136 transitions. [2019-08-05 11:13:20,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 11:13:20,246 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:20,247 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:13:20,247 INFO L418 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:20,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:20,247 INFO L82 PathProgramCache]: Analyzing trace with hash 63961949, now seen corresponding path program 76 times [2019-08-05 11:13:20,248 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:20,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:20,256 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 11:13:20,257 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:20,432 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 7 proven. 130 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-08-05 11:13:20,432 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:20,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 11:13:20,433 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 11:13:20,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 11:13:20,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=424, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:13:20,433 INFO L87 Difference]: Start difference. First operand 117 states and 136 transitions. Second operand 23 states. [2019-08-05 11:13:20,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:20,709 INFO L93 Difference]: Finished difference Result 177 states and 205 transitions. [2019-08-05 11:13:20,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 11:13:20,710 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 77 [2019-08-05 11:13:20,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:20,711 INFO L225 Difference]: With dead ends: 177 [2019-08-05 11:13:20,711 INFO L226 Difference]: Without dead ends: 177 [2019-08-05 11:13:20,712 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=172, Invalid=820, Unknown=0, NotChecked=0, Total=992 [2019-08-05 11:13:20,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-08-05 11:13:20,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 109. [2019-08-05 11:13:20,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-08-05 11:13:20,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 127 transitions. [2019-08-05 11:13:20,716 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 127 transitions. Word has length 77 [2019-08-05 11:13:20,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:20,717 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 127 transitions. [2019-08-05 11:13:20,717 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 11:13:20,717 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 127 transitions. [2019-08-05 11:13:20,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 11:13:20,718 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:20,718 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:13:20,718 INFO L418 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:20,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:20,718 INFO L82 PathProgramCache]: Analyzing trace with hash -589483811, now seen corresponding path program 77 times [2019-08-05 11:13:20,719 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:20,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:20,727 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 11:13:20,729 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:21,070 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 6 proven. 131 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-08-05 11:13:21,070 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:21,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 11:13:21,071 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 11:13:21,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 11:13:21,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=424, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:13:21,071 INFO L87 Difference]: Start difference. First operand 109 states and 127 transitions. Second operand 23 states. [2019-08-05 11:13:21,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:21,526 INFO L93 Difference]: Finished difference Result 177 states and 204 transitions. [2019-08-05 11:13:21,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 11:13:21,527 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 77 [2019-08-05 11:13:21,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:21,528 INFO L225 Difference]: With dead ends: 177 [2019-08-05 11:13:21,528 INFO L226 Difference]: Without dead ends: 177 [2019-08-05 11:13:21,529 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=172, Invalid=820, Unknown=0, NotChecked=0, Total=992 [2019-08-05 11:13:21,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-08-05 11:13:21,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 113. [2019-08-05 11:13:21,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-08-05 11:13:21,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 132 transitions. [2019-08-05 11:13:21,533 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 132 transitions. Word has length 77 [2019-08-05 11:13:21,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:21,533 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 132 transitions. [2019-08-05 11:13:21,533 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 11:13:21,533 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 132 transitions. [2019-08-05 11:13:21,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 11:13:21,534 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:21,534 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 7, 7, 7, 7, 7, 7, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:13:21,535 INFO L418 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:21,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:21,535 INFO L82 PathProgramCache]: Analyzing trace with hash 1307483612, now seen corresponding path program 78 times [2019-08-05 11:13:21,536 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:21,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:21,544 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 11:13:21,545 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:22,008 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 2 proven. 143 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2019-08-05 11:13:22,009 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:22,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 11:13:22,009 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 11:13:22,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 11:13:22,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:13:22,009 INFO L87 Difference]: Start difference. First operand 113 states and 132 transitions. Second operand 23 states. [2019-08-05 11:13:22,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:22,262 INFO L93 Difference]: Finished difference Result 185 states and 212 transitions. [2019-08-05 11:13:22,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 11:13:22,263 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 77 [2019-08-05 11:13:22,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:22,264 INFO L225 Difference]: With dead ends: 185 [2019-08-05 11:13:22,264 INFO L226 Difference]: Without dead ends: 185 [2019-08-05 11:13:22,265 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=183, Invalid=809, Unknown=0, NotChecked=0, Total=992 [2019-08-05 11:13:22,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-08-05 11:13:22,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 109. [2019-08-05 11:13:22,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-08-05 11:13:22,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 127 transitions. [2019-08-05 11:13:22,268 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 127 transitions. Word has length 77 [2019-08-05 11:13:22,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:22,268 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 127 transitions. [2019-08-05 11:13:22,268 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 11:13:22,268 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 127 transitions. [2019-08-05 11:13:22,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 11:13:22,269 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:22,269 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 7, 7, 7, 7, 7, 7, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:13:22,269 INFO L418 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:22,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:22,269 INFO L82 PathProgramCache]: Analyzing trace with hash 1960929372, now seen corresponding path program 79 times [2019-08-05 11:13:22,270 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:22,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:22,278 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 11:13:22,280 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:22,519 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 3 proven. 142 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2019-08-05 11:13:22,519 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:22,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 11:13:22,519 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 11:13:22,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 11:13:22,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:13:22,520 INFO L87 Difference]: Start difference. First operand 109 states and 127 transitions. Second operand 23 states. [2019-08-05 11:13:22,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:22,793 INFO L93 Difference]: Finished difference Result 181 states and 208 transitions. [2019-08-05 11:13:22,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 11:13:22,794 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 77 [2019-08-05 11:13:22,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:22,794 INFO L225 Difference]: With dead ends: 181 [2019-08-05 11:13:22,794 INFO L226 Difference]: Without dead ends: 181 [2019-08-05 11:13:22,795 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=183, Invalid=809, Unknown=0, NotChecked=0, Total=992 [2019-08-05 11:13:22,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-08-05 11:13:22,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 117. [2019-08-05 11:13:22,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-08-05 11:13:22,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 136 transitions. [2019-08-05 11:13:22,799 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 136 transitions. Word has length 77 [2019-08-05 11:13:22,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:22,800 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 136 transitions. [2019-08-05 11:13:22,800 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 11:13:22,800 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 136 transitions. [2019-08-05 11:13:22,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 11:13:22,800 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:22,800 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:13:22,801 INFO L418 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:22,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:22,801 INFO L82 PathProgramCache]: Analyzing trace with hash 712156765, now seen corresponding path program 80 times [2019-08-05 11:13:22,801 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:22,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:22,808 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 11:13:22,810 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:23,372 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 7 proven. 129 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2019-08-05 11:13:23,372 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:23,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 11:13:23,373 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 11:13:23,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 11:13:23,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=430, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:13:23,373 INFO L87 Difference]: Start difference. First operand 117 states and 136 transitions. Second operand 23 states. [2019-08-05 11:13:23,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:23,717 INFO L93 Difference]: Finished difference Result 177 states and 203 transitions. [2019-08-05 11:13:23,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 11:13:23,718 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 77 [2019-08-05 11:13:23,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:23,720 INFO L225 Difference]: With dead ends: 177 [2019-08-05 11:13:23,720 INFO L226 Difference]: Without dead ends: 177 [2019-08-05 11:13:23,720 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=194, Invalid=1066, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 11:13:23,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-08-05 11:13:23,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 121. [2019-08-05 11:13:23,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-08-05 11:13:23,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 141 transitions. [2019-08-05 11:13:23,725 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 141 transitions. Word has length 77 [2019-08-05 11:13:23,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:23,725 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 141 transitions. [2019-08-05 11:13:23,725 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 11:13:23,725 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 141 transitions. [2019-08-05 11:13:23,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 11:13:23,726 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:23,726 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 7, 7, 7, 7, 7, 7, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:13:23,726 INFO L418 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:23,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:23,727 INFO L82 PathProgramCache]: Analyzing trace with hash 1999325148, now seen corresponding path program 81 times [2019-08-05 11:13:23,727 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:23,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:23,741 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 11:13:23,742 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:24,048 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 6 proven. 139 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2019-08-05 11:13:24,049 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:24,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 11:13:24,049 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 11:13:24,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 11:13:24,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:13:24,050 INFO L87 Difference]: Start difference. First operand 121 states and 141 transitions. Second operand 23 states. [2019-08-05 11:13:24,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:24,538 INFO L93 Difference]: Finished difference Result 165 states and 190 transitions. [2019-08-05 11:13:24,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 11:13:24,538 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 77 [2019-08-05 11:13:24,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:24,539 INFO L225 Difference]: With dead ends: 165 [2019-08-05 11:13:24,539 INFO L226 Difference]: Without dead ends: 165 [2019-08-05 11:13:24,539 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=183, Invalid=809, Unknown=0, NotChecked=0, Total=992 [2019-08-05 11:13:24,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-08-05 11:13:24,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 105. [2019-08-05 11:13:24,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-08-05 11:13:24,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 121 transitions. [2019-08-05 11:13:24,544 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 121 transitions. Word has length 77 [2019-08-05 11:13:24,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:24,544 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 121 transitions. [2019-08-05 11:13:24,544 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 11:13:24,544 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 121 transitions. [2019-08-05 11:13:24,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 11:13:24,545 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:24,545 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:13:24,545 INFO L418 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:24,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:24,546 INFO L82 PathProgramCache]: Analyzing trace with hash 181129054, now seen corresponding path program 82 times [2019-08-05 11:13:24,546 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:24,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:24,554 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 11:13:24,555 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:24,701 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 3 proven. 123 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-08-05 11:13:24,702 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:24,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 11:13:24,702 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 11:13:24,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 11:13:24,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=382, Unknown=0, NotChecked=0, Total=462 [2019-08-05 11:13:24,703 INFO L87 Difference]: Start difference. First operand 105 states and 121 transitions. Second operand 22 states. [2019-08-05 11:13:24,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:24,885 INFO L93 Difference]: Finished difference Result 197 states and 224 transitions. [2019-08-05 11:13:24,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 11:13:24,886 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 77 [2019-08-05 11:13:24,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:24,887 INFO L225 Difference]: With dead ends: 197 [2019-08-05 11:13:24,888 INFO L226 Difference]: Without dead ends: 197 [2019-08-05 11:13:24,888 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=140, Invalid=616, Unknown=0, NotChecked=0, Total=756 [2019-08-05 11:13:24,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-08-05 11:13:24,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 121. [2019-08-05 11:13:24,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-08-05 11:13:24,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 139 transitions. [2019-08-05 11:13:24,892 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 139 transitions. Word has length 77 [2019-08-05 11:13:24,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:24,892 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 139 transitions. [2019-08-05 11:13:24,892 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 11:13:24,893 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 139 transitions. [2019-08-05 11:13:24,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 11:13:24,893 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:24,893 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:13:24,894 INFO L418 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:24,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:24,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1468297437, now seen corresponding path program 83 times [2019-08-05 11:13:24,895 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:24,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:24,903 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 11:13:24,905 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:25,109 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 4 proven. 132 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2019-08-05 11:13:25,110 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:25,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 11:13:25,110 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 11:13:25,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 11:13:25,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=430, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:13:25,111 INFO L87 Difference]: Start difference. First operand 121 states and 139 transitions. Second operand 23 states. [2019-08-05 11:13:25,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:25,430 INFO L93 Difference]: Finished difference Result 193 states and 222 transitions. [2019-08-05 11:13:25,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 11:13:25,431 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 77 [2019-08-05 11:13:25,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:25,432 INFO L225 Difference]: With dead ends: 193 [2019-08-05 11:13:25,432 INFO L226 Difference]: Without dead ends: 193 [2019-08-05 11:13:25,433 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=179, Invalid=943, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 11:13:25,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-08-05 11:13:25,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 113. [2019-08-05 11:13:25,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-08-05 11:13:25,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 130 transitions. [2019-08-05 11:13:25,437 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 130 transitions. Word has length 77 [2019-08-05 11:13:25,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:25,437 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 130 transitions. [2019-08-05 11:13:25,437 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 11:13:25,437 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 130 transitions. [2019-08-05 11:13:25,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 11:13:25,438 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:25,438 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:13:25,438 INFO L418 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:25,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:25,438 INFO L82 PathProgramCache]: Analyzing trace with hash 814851677, now seen corresponding path program 84 times [2019-08-05 11:13:25,439 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:25,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:25,447 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 11:13:25,448 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:25,614 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 5 proven. 132 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-08-05 11:13:25,614 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:25,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 11:13:25,615 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 11:13:25,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 11:13:25,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=424, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:13:25,615 INFO L87 Difference]: Start difference. First operand 113 states and 130 transitions. Second operand 23 states. [2019-08-05 11:13:25,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:25,996 INFO L93 Difference]: Finished difference Result 185 states and 213 transitions. [2019-08-05 11:13:25,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 11:13:25,996 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 77 [2019-08-05 11:13:25,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:25,998 INFO L225 Difference]: With dead ends: 185 [2019-08-05 11:13:25,999 INFO L226 Difference]: Without dead ends: 185 [2019-08-05 11:13:25,999 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=172, Invalid=820, Unknown=0, NotChecked=0, Total=992 [2019-08-05 11:13:25,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-08-05 11:13:26,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 117. [2019-08-05 11:13:26,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-08-05 11:13:26,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 135 transitions. [2019-08-05 11:13:26,004 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 135 transitions. Word has length 77 [2019-08-05 11:13:26,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:26,004 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 135 transitions. [2019-08-05 11:13:26,004 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 11:13:26,004 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 135 transitions. [2019-08-05 11:13:26,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 11:13:26,005 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:26,005 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:13:26,005 INFO L418 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:26,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:26,006 INFO L82 PathProgramCache]: Analyzing trace with hash 2116492253, now seen corresponding path program 85 times [2019-08-05 11:13:26,006 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:26,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:26,014 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 11:13:26,015 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:26,705 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 6 proven. 130 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2019-08-05 11:13:26,705 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:26,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 11:13:26,706 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 11:13:26,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 11:13:26,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=430, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:13:26,706 INFO L87 Difference]: Start difference. First operand 117 states and 135 transitions. Second operand 23 states. [2019-08-05 11:13:27,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:27,020 INFO L93 Difference]: Finished difference Result 185 states and 212 transitions. [2019-08-05 11:13:27,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 11:13:27,020 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 77 [2019-08-05 11:13:27,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:27,022 INFO L225 Difference]: With dead ends: 185 [2019-08-05 11:13:27,022 INFO L226 Difference]: Without dead ends: 185 [2019-08-05 11:13:27,023 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=194, Invalid=1066, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 11:13:27,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-08-05 11:13:27,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 121. [2019-08-05 11:13:27,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-08-05 11:13:27,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 140 transitions. [2019-08-05 11:13:27,027 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 140 transitions. Word has length 77 [2019-08-05 11:13:27,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:27,027 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 140 transitions. [2019-08-05 11:13:27,027 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 11:13:27,027 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 140 transitions. [2019-08-05 11:13:27,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 11:13:27,028 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:27,028 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 7, 7, 7, 7, 7, 7, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:13:27,028 INFO L418 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:27,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:27,028 INFO L82 PathProgramCache]: Analyzing trace with hash -891306660, now seen corresponding path program 86 times [2019-08-05 11:13:27,029 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:27,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:27,037 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 11:13:27,038 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:28,437 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 5 proven. 140 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2019-08-05 11:13:28,437 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:28,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 11:13:28,438 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 11:13:28,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 11:13:28,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:13:28,438 INFO L87 Difference]: Start difference. First operand 121 states and 140 transitions. Second operand 23 states. [2019-08-05 11:13:28,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:28,704 INFO L93 Difference]: Finished difference Result 173 states and 199 transitions. [2019-08-05 11:13:28,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 11:13:28,704 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 77 [2019-08-05 11:13:28,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:28,706 INFO L225 Difference]: With dead ends: 173 [2019-08-05 11:13:28,706 INFO L226 Difference]: Without dead ends: 173 [2019-08-05 11:13:28,706 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=183, Invalid=809, Unknown=0, NotChecked=0, Total=992 [2019-08-05 11:13:28,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-08-05 11:13:28,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 105. [2019-08-05 11:13:28,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-08-05 11:13:28,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 121 transitions. [2019-08-05 11:13:28,711 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 121 transitions. Word has length 77 [2019-08-05 11:13:28,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:28,711 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 121 transitions. [2019-08-05 11:13:28,711 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 11:13:28,711 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 121 transitions. [2019-08-05 11:13:28,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 11:13:28,712 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:28,712 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:13:28,712 INFO L418 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:28,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:28,712 INFO L82 PathProgramCache]: Analyzing trace with hash 673760989, now seen corresponding path program 87 times [2019-08-05 11:13:28,713 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:28,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:28,720 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 11:13:28,721 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:28,915 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 2 proven. 129 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-08-05 11:13:28,916 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:28,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 11:13:28,916 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 11:13:28,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 11:13:28,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=390, Unknown=0, NotChecked=0, Total=462 [2019-08-05 11:13:28,916 INFO L87 Difference]: Start difference. First operand 105 states and 121 transitions. Second operand 22 states. [2019-08-05 11:13:29,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:29,156 INFO L93 Difference]: Finished difference Result 193 states and 219 transitions. [2019-08-05 11:13:29,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 11:13:29,157 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 77 [2019-08-05 11:13:29,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:29,158 INFO L225 Difference]: With dead ends: 193 [2019-08-05 11:13:29,159 INFO L226 Difference]: Without dead ends: 193 [2019-08-05 11:13:29,159 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=768, Unknown=0, NotChecked=0, Total=930 [2019-08-05 11:13:29,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-08-05 11:13:29,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 93. [2019-08-05 11:13:29,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-08-05 11:13:29,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 107 transitions. [2019-08-05 11:13:29,162 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 107 transitions. Word has length 77 [2019-08-05 11:13:29,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:29,163 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 107 transitions. [2019-08-05 11:13:29,163 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 11:13:29,163 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 107 transitions. [2019-08-05 11:13:29,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 11:13:29,164 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:29,164 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 7, 7, 7, 7, 7, 7, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:13:29,164 INFO L418 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:29,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:29,164 INFO L82 PathProgramCache]: Analyzing trace with hash -1224969508, now seen corresponding path program 88 times [2019-08-05 11:13:29,165 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:29,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:29,173 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 11:13:29,174 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:29,720 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 4 proven. 141 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2019-08-05 11:13:29,720 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:29,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 11:13:29,720 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 11:13:29,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 11:13:29,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:13:29,721 INFO L87 Difference]: Start difference. First operand 93 states and 107 transitions. Second operand 23 states. [2019-08-05 11:13:30,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:30,013 INFO L93 Difference]: Finished difference Result 173 states and 199 transitions. [2019-08-05 11:13:30,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 11:13:30,014 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 77 [2019-08-05 11:13:30,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:30,015 INFO L225 Difference]: With dead ends: 173 [2019-08-05 11:13:30,015 INFO L226 Difference]: Without dead ends: 173 [2019-08-05 11:13:30,015 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=183, Invalid=809, Unknown=0, NotChecked=0, Total=992 [2019-08-05 11:13:30,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-08-05 11:13:30,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 105. [2019-08-05 11:13:30,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-08-05 11:13:30,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 121 transitions. [2019-08-05 11:13:30,018 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 121 transitions. Word has length 77 [2019-08-05 11:13:30,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:30,019 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 121 transitions. [2019-08-05 11:13:30,019 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 11:13:30,019 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 121 transitions. [2019-08-05 11:13:30,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 11:13:30,019 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:30,019 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:13:30,020 INFO L418 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:30,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:30,020 INFO L82 PathProgramCache]: Analyzing trace with hash 481188829, now seen corresponding path program 89 times [2019-08-05 11:13:30,021 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:30,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:30,028 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 11:13:30,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:31,100 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 3 proven. 133 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2019-08-05 11:13:31,100 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:31,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 11:13:31,100 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 11:13:31,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 11:13:31,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=430, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:13:31,101 INFO L87 Difference]: Start difference. First operand 105 states and 121 transitions. Second operand 23 states. [2019-08-05 11:13:31,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:31,690 INFO L93 Difference]: Finished difference Result 181 states and 207 transitions. [2019-08-05 11:13:31,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 11:13:31,691 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 77 [2019-08-05 11:13:31,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:31,692 INFO L225 Difference]: With dead ends: 181 [2019-08-05 11:13:31,692 INFO L226 Difference]: Without dead ends: 181 [2019-08-05 11:13:31,693 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=186, Invalid=1004, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 11:13:31,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-08-05 11:13:31,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 105. [2019-08-05 11:13:31,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-08-05 11:13:31,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 121 transitions. [2019-08-05 11:13:31,696 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 121 transitions. Word has length 77 [2019-08-05 11:13:31,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:31,696 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 121 transitions. [2019-08-05 11:13:31,697 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 11:13:31,697 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 121 transitions. [2019-08-05 11:13:31,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 11:13:31,697 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:31,697 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:13:31,698 INFO L418 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:31,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:31,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1782829405, now seen corresponding path program 90 times [2019-08-05 11:13:31,699 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:31,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:31,706 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 11:13:31,707 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:31,887 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 5 proven. 131 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2019-08-05 11:13:31,887 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:31,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 11:13:31,888 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 11:13:31,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 11:13:31,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=430, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:13:31,888 INFO L87 Difference]: Start difference. First operand 105 states and 121 transitions. Second operand 23 states. [2019-08-05 11:13:32,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:32,213 INFO L93 Difference]: Finished difference Result 173 states and 197 transitions. [2019-08-05 11:13:32,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 11:13:32,213 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 77 [2019-08-05 11:13:32,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:32,215 INFO L225 Difference]: With dead ends: 173 [2019-08-05 11:13:32,215 INFO L226 Difference]: Without dead ends: 173 [2019-08-05 11:13:32,215 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=194, Invalid=1066, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 11:13:32,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-08-05 11:13:32,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 85. [2019-08-05 11:13:32,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-08-05 11:13:32,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 97 transitions. [2019-08-05 11:13:32,218 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 97 transitions. Word has length 77 [2019-08-05 11:13:32,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:32,218 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 97 transitions. [2019-08-05 11:13:32,219 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 11:13:32,219 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 97 transitions. [2019-08-05 11:13:32,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 11:13:32,219 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:32,219 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 8, 8, 8, 8, 8, 8, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:13:32,219 INFO L418 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:32,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:32,220 INFO L82 PathProgramCache]: Analyzing trace with hash 412531196, now seen corresponding path program 91 times [2019-08-05 11:13:32,220 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:32,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:32,226 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 11:13:32,227 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:32,428 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 0 proven. 175 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2019-08-05 11:13:32,428 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:32,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 11:13:32,428 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 11:13:32,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 11:13:32,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=442, Unknown=0, NotChecked=0, Total=552 [2019-08-05 11:13:32,429 INFO L87 Difference]: Start difference. First operand 85 states and 97 transitions. Second operand 24 states. [2019-08-05 11:13:32,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:32,656 INFO L93 Difference]: Finished difference Result 165 states and 191 transitions. [2019-08-05 11:13:32,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 11:13:32,656 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 85 [2019-08-05 11:13:32,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:32,658 INFO L225 Difference]: With dead ends: 165 [2019-08-05 11:13:32,658 INFO L226 Difference]: Without dead ends: 165 [2019-08-05 11:13:32,658 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=206, Invalid=786, Unknown=0, NotChecked=0, Total=992 [2019-08-05 11:13:32,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-08-05 11:13:32,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 109. [2019-08-05 11:13:32,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-08-05 11:13:32,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 127 transitions. [2019-08-05 11:13:32,662 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 127 transitions. Word has length 85 [2019-08-05 11:13:32,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:32,662 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 127 transitions. [2019-08-05 11:13:32,662 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 11:13:32,662 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 127 transitions. [2019-08-05 11:13:32,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 11:13:32,663 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:32,663 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 7, 7, 7, 7, 7, 7, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:13:32,663 INFO L418 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:32,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:32,664 INFO L82 PathProgramCache]: Analyzing trace with hash 650110333, now seen corresponding path program 92 times [2019-08-05 11:13:32,664 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:32,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:32,680 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 11:13:32,684 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:32,865 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 1 proven. 163 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2019-08-05 11:13:32,866 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:32,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 11:13:32,866 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 11:13:32,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 11:13:32,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=464, Unknown=0, NotChecked=0, Total=552 [2019-08-05 11:13:32,866 INFO L87 Difference]: Start difference. First operand 109 states and 127 transitions. Second operand 24 states. [2019-08-05 11:13:33,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:33,146 INFO L93 Difference]: Finished difference Result 189 states and 217 transitions. [2019-08-05 11:13:33,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 11:13:33,146 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 85 [2019-08-05 11:13:33,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:33,148 INFO L225 Difference]: With dead ends: 189 [2019-08-05 11:13:33,148 INFO L226 Difference]: Without dead ends: 189 [2019-08-05 11:13:33,148 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=211, Invalid=1049, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 11:13:33,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-08-05 11:13:33,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 105. [2019-08-05 11:13:33,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-08-05 11:13:33,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 122 transitions. [2019-08-05 11:13:33,153 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 122 transitions. Word has length 85 [2019-08-05 11:13:33,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:33,153 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 122 transitions. [2019-08-05 11:13:33,153 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 11:13:33,153 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 122 transitions. [2019-08-05 11:13:33,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 11:13:33,154 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:33,154 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1] [2019-08-05 11:13:33,154 INFO L418 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:33,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:33,155 INFO L82 PathProgramCache]: Analyzing trace with hash -784409857, now seen corresponding path program 93 times [2019-08-05 11:13:33,155 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:33,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:33,163 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 11:13:33,165 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:33,426 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 4 proven. 156 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2019-08-05 11:13:33,426 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:33,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 11:13:33,427 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 11:13:33,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 11:13:33,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=516, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:13:33,427 INFO L87 Difference]: Start difference. First operand 105 states and 122 transitions. Second operand 25 states. [2019-08-05 11:13:33,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:33,788 INFO L93 Difference]: Finished difference Result 209 states and 242 transitions. [2019-08-05 11:13:33,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:13:33,788 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 85 [2019-08-05 11:13:33,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:33,790 INFO L225 Difference]: With dead ends: 209 [2019-08-05 11:13:33,790 INFO L226 Difference]: Without dead ends: 209 [2019-08-05 11:13:33,790 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=204, Invalid=1278, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 11:13:33,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-08-05 11:13:33,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 121. [2019-08-05 11:13:33,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-08-05 11:13:33,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 140 transitions. [2019-08-05 11:13:33,794 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 140 transitions. Word has length 85 [2019-08-05 11:13:33,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:33,794 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 140 transitions. [2019-08-05 11:13:33,794 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 11:13:33,795 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 140 transitions. [2019-08-05 11:13:33,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 11:13:33,795 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:33,795 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1] [2019-08-05 11:13:33,795 INFO L418 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:33,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:33,796 INFO L82 PathProgramCache]: Analyzing trace with hash -203042689, now seen corresponding path program 94 times [2019-08-05 11:13:33,796 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:33,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:33,802 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 11:13:33,804 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:34,031 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 6 proven. 154 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2019-08-05 11:13:34,031 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:34,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 11:13:34,032 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 11:13:34,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 11:13:34,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=516, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:13:34,032 INFO L87 Difference]: Start difference. First operand 121 states and 140 transitions. Second operand 25 states. [2019-08-05 11:13:34,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:34,381 INFO L93 Difference]: Finished difference Result 205 states and 236 transitions. [2019-08-05 11:13:34,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 11:13:34,381 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 85 [2019-08-05 11:13:34,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:34,383 INFO L225 Difference]: With dead ends: 205 [2019-08-05 11:13:34,383 INFO L226 Difference]: Without dead ends: 205 [2019-08-05 11:13:34,383 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=195, Invalid=1211, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 11:13:34,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-08-05 11:13:34,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 125. [2019-08-05 11:13:34,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-08-05 11:13:34,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 145 transitions. [2019-08-05 11:13:34,387 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 145 transitions. Word has length 85 [2019-08-05 11:13:34,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:34,387 INFO L475 AbstractCegarLoop]: Abstraction has 125 states and 145 transitions. [2019-08-05 11:13:34,387 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 11:13:34,387 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 145 transitions. [2019-08-05 11:13:34,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 11:13:34,388 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:34,388 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 7, 7, 7, 7, 7, 7, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:13:34,388 INFO L418 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:34,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:34,388 INFO L82 PathProgramCache]: Analyzing trace with hash 68743165, now seen corresponding path program 95 times [2019-08-05 11:13:34,389 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:34,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:34,397 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 11:13:34,399 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:34,635 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 2 proven. 168 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-08-05 11:13:34,635 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:34,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 11:13:34,636 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 11:13:34,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 11:13:34,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=500, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:13:34,636 INFO L87 Difference]: Start difference. First operand 125 states and 145 transitions. Second operand 25 states. [2019-08-05 11:13:34,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:34,949 INFO L93 Difference]: Finished difference Result 209 states and 242 transitions. [2019-08-05 11:13:34,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 11:13:34,949 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 85 [2019-08-05 11:13:34,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:34,951 INFO L225 Difference]: With dead ends: 209 [2019-08-05 11:13:34,951 INFO L226 Difference]: Without dead ends: 209 [2019-08-05 11:13:34,951 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=204, Invalid=986, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 11:13:34,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-08-05 11:13:34,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 121. [2019-08-05 11:13:34,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-08-05 11:13:34,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 140 transitions. [2019-08-05 11:13:34,956 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 140 transitions. Word has length 85 [2019-08-05 11:13:34,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:34,956 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 140 transitions. [2019-08-05 11:13:34,956 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 11:13:34,956 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 140 transitions. [2019-08-05 11:13:34,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 11:13:34,957 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:34,957 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:13:34,957 INFO L418 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:34,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:34,958 INFO L82 PathProgramCache]: Analyzing trace with hash -440621826, now seen corresponding path program 96 times [2019-08-05 11:13:34,958 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:34,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:34,966 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 11:13:34,968 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:35,535 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 5 proven. 158 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2019-08-05 11:13:35,536 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:35,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 11:13:35,536 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 11:13:35,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 11:13:35,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=515, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:13:35,537 INFO L87 Difference]: Start difference. First operand 121 states and 140 transitions. Second operand 25 states. [2019-08-05 11:13:35,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:35,882 INFO L93 Difference]: Finished difference Result 201 states and 235 transitions. [2019-08-05 11:13:35,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 11:13:35,882 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 85 [2019-08-05 11:13:35,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:35,884 INFO L225 Difference]: With dead ends: 201 [2019-08-05 11:13:35,884 INFO L226 Difference]: Without dead ends: 201 [2019-08-05 11:13:35,884 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=189, Invalid=1071, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 11:13:35,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-08-05 11:13:35,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 109. [2019-08-05 11:13:35,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-08-05 11:13:35,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 126 transitions. [2019-08-05 11:13:35,888 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 126 transitions. Word has length 85 [2019-08-05 11:13:35,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:35,888 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 126 transitions. [2019-08-05 11:13:35,888 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 11:13:35,888 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 126 transitions. [2019-08-05 11:13:35,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 11:13:35,889 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:35,889 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 7, 7, 7, 7, 7, 7, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:13:35,889 INFO L418 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:35,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:35,889 INFO L82 PathProgramCache]: Analyzing trace with hash 289028733, now seen corresponding path program 97 times [2019-08-05 11:13:35,890 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:35,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:35,896 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 11:13:35,898 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:36,131 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 3 proven. 167 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-08-05 11:13:36,131 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:36,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 11:13:36,132 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 11:13:36,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 11:13:36,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=500, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:13:36,132 INFO L87 Difference]: Start difference. First operand 109 states and 126 transitions. Second operand 25 states. [2019-08-05 11:13:36,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:36,575 INFO L93 Difference]: Finished difference Result 197 states and 229 transitions. [2019-08-05 11:13:36,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 11:13:36,575 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 85 [2019-08-05 11:13:36,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:36,576 INFO L225 Difference]: With dead ends: 197 [2019-08-05 11:13:36,576 INFO L226 Difference]: Without dead ends: 197 [2019-08-05 11:13:36,577 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=204, Invalid=986, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 11:13:36,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-08-05 11:13:36,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 117. [2019-08-05 11:13:36,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-08-05 11:13:36,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 135 transitions. [2019-08-05 11:13:36,581 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 135 transitions. Word has length 85 [2019-08-05 11:13:36,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:36,582 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 135 transitions. [2019-08-05 11:13:36,582 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 11:13:36,582 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 135 transitions. [2019-08-05 11:13:36,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 11:13:36,583 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:36,583 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:13:36,583 INFO L418 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:36,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:36,583 INFO L82 PathProgramCache]: Analyzing trace with hash 526607870, now seen corresponding path program 98 times [2019-08-05 11:13:36,584 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:36,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:36,592 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 11:13:36,593 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:36,926 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 2 proven. 155 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2019-08-05 11:13:36,926 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:36,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 11:13:36,927 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 11:13:36,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 11:13:36,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=472, Unknown=0, NotChecked=0, Total=552 [2019-08-05 11:13:36,927 INFO L87 Difference]: Start difference. First operand 117 states and 135 transitions. Second operand 24 states. [2019-08-05 11:13:37,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:37,160 INFO L93 Difference]: Finished difference Result 197 states and 225 transitions. [2019-08-05 11:13:37,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 11:13:37,161 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 85 [2019-08-05 11:13:37,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:37,162 INFO L225 Difference]: With dead ends: 197 [2019-08-05 11:13:37,162 INFO L226 Difference]: Without dead ends: 197 [2019-08-05 11:13:37,163 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=170, Invalid=886, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 11:13:37,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-08-05 11:13:37,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 105. [2019-08-05 11:13:37,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-08-05 11:13:37,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 121 transitions. [2019-08-05 11:13:37,167 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 121 transitions. Word has length 85 [2019-08-05 11:13:37,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:37,167 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 121 transitions. [2019-08-05 11:13:37,167 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 11:13:37,167 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 121 transitions. [2019-08-05 11:13:37,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 11:13:37,168 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:37,168 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 7, 7, 7, 7, 7, 7, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:13:37,168 INFO L418 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:37,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:37,168 INFO L82 PathProgramCache]: Analyzing trace with hash -1799109379, now seen corresponding path program 99 times [2019-08-05 11:13:37,169 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:37,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:37,175 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 11:13:37,177 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:37,369 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 4 proven. 166 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-08-05 11:13:37,369 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:37,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 11:13:37,370 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 11:13:37,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 11:13:37,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=500, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:13:37,370 INFO L87 Difference]: Start difference. First operand 105 states and 121 transitions. Second operand 25 states. [2019-08-05 11:13:37,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:37,653 INFO L93 Difference]: Finished difference Result 189 states and 220 transitions. [2019-08-05 11:13:37,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 11:13:37,653 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 85 [2019-08-05 11:13:37,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:37,654 INFO L225 Difference]: With dead ends: 189 [2019-08-05 11:13:37,654 INFO L226 Difference]: Without dead ends: 189 [2019-08-05 11:13:37,655 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=204, Invalid=986, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 11:13:37,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-08-05 11:13:37,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 117. [2019-08-05 11:13:37,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-08-05 11:13:37,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 135 transitions. [2019-08-05 11:13:37,659 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 135 transitions. Word has length 85 [2019-08-05 11:13:37,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:37,659 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 135 transitions. [2019-08-05 11:13:37,659 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 11:13:37,659 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 135 transitions. [2019-08-05 11:13:37,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 11:13:37,660 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:37,660 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1] [2019-08-05 11:13:37,660 INFO L418 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:37,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:37,660 INFO L82 PathProgramCache]: Analyzing trace with hash 1885095423, now seen corresponding path program 100 times [2019-08-05 11:13:37,661 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:37,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:37,669 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 11:13:37,670 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:37,887 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 8 proven. 152 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2019-08-05 11:13:37,887 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:37,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 11:13:37,888 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 11:13:37,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 11:13:37,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=516, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:13:37,889 INFO L87 Difference]: Start difference. First operand 117 states and 135 transitions. Second operand 25 states. [2019-08-05 11:13:38,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:38,268 INFO L93 Difference]: Finished difference Result 189 states and 217 transitions. [2019-08-05 11:13:38,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 11:13:38,269 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 85 [2019-08-05 11:13:38,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:38,270 INFO L225 Difference]: With dead ends: 189 [2019-08-05 11:13:38,270 INFO L226 Difference]: Without dead ends: 189 [2019-08-05 11:13:38,271 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=1142, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 11:13:38,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-08-05 11:13:38,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 129. [2019-08-05 11:13:38,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-08-05 11:13:38,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 149 transitions. [2019-08-05 11:13:38,275 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 149 transitions. Word has length 85 [2019-08-05 11:13:38,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:38,275 INFO L475 AbstractCegarLoop]: Abstraction has 129 states and 149 transitions. [2019-08-05 11:13:38,275 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 11:13:38,276 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 149 transitions. [2019-08-05 11:13:38,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 11:13:38,276 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:38,276 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:13:38,277 INFO L418 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:38,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:38,277 INFO L82 PathProgramCache]: Analyzing trace with hash -1561530242, now seen corresponding path program 101 times [2019-08-05 11:13:38,278 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:38,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:38,285 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 11:13:38,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:38,503 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 5 proven. 158 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2019-08-05 11:13:38,504 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:38,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 11:13:38,504 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 11:13:38,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 11:13:38,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=515, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:13:38,504 INFO L87 Difference]: Start difference. First operand 129 states and 149 transitions. Second operand 25 states. [2019-08-05 11:13:38,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:38,889 INFO L93 Difference]: Finished difference Result 193 states and 222 transitions. [2019-08-05 11:13:38,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 11:13:38,890 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 85 [2019-08-05 11:13:38,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:38,891 INFO L225 Difference]: With dead ends: 193 [2019-08-05 11:13:38,892 INFO L226 Difference]: Without dead ends: 193 [2019-08-05 11:13:38,892 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=211, Invalid=1271, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 11:13:38,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-08-05 11:13:38,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 125. [2019-08-05 11:13:38,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-08-05 11:13:38,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 144 transitions. [2019-08-05 11:13:38,895 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 144 transitions. Word has length 85 [2019-08-05 11:13:38,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:38,895 INFO L475 AbstractCegarLoop]: Abstraction has 125 states and 144 transitions. [2019-08-05 11:13:38,895 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 11:13:38,896 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 144 transitions. [2019-08-05 11:13:38,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 11:13:38,896 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:38,896 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:13:38,897 INFO L418 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:38,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:38,897 INFO L82 PathProgramCache]: Analyzing trace with hash -2142897410, now seen corresponding path program 102 times [2019-08-05 11:13:38,898 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:38,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:38,903 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 11:13:38,904 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:39,116 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 3 proven. 160 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2019-08-05 11:13:39,116 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:39,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 11:13:39,117 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 11:13:39,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 11:13:39,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=515, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:13:39,117 INFO L87 Difference]: Start difference. First operand 125 states and 144 transitions. Second operand 25 states. [2019-08-05 11:13:39,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:39,464 INFO L93 Difference]: Finished difference Result 205 states and 236 transitions. [2019-08-05 11:13:39,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 11:13:39,464 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 85 [2019-08-05 11:13:39,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:39,465 INFO L225 Difference]: With dead ends: 205 [2019-08-05 11:13:39,465 INFO L226 Difference]: Without dead ends: 205 [2019-08-05 11:13:39,465 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=203, Invalid=1203, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 11:13:39,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-08-05 11:13:39,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 113. [2019-08-05 11:13:39,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-08-05 11:13:39,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 130 transitions. [2019-08-05 11:13:39,469 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 130 transitions. Word has length 85 [2019-08-05 11:13:39,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:39,469 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 130 transitions. [2019-08-05 11:13:39,469 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 11:13:39,469 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 130 transitions. [2019-08-05 11:13:39,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 11:13:39,470 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:39,470 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:13:39,470 INFO L418 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:39,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:39,471 INFO L82 PathProgramCache]: Analyzing trace with hash 1647516286, now seen corresponding path program 103 times [2019-08-05 11:13:39,471 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:39,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:39,477 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:13:39,478 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:39,678 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 7 proven. 158 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2019-08-05 11:13:39,679 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:39,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 11:13:39,679 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 11:13:39,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 11:13:39,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=508, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:13:39,680 INFO L87 Difference]: Start difference. First operand 113 states and 130 transitions. Second operand 25 states. [2019-08-05 11:13:39,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:39,996 INFO L93 Difference]: Finished difference Result 173 states and 201 transitions. [2019-08-05 11:13:39,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 11:13:39,997 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 85 [2019-08-05 11:13:39,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:39,997 INFO L225 Difference]: With dead ends: 173 [2019-08-05 11:13:39,998 INFO L226 Difference]: Without dead ends: 173 [2019-08-05 11:13:39,998 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=191, Invalid=999, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 11:13:39,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-08-05 11:13:40,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 105. [2019-08-05 11:13:40,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-08-05 11:13:40,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 121 transitions. [2019-08-05 11:13:40,001 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 121 transitions. Word has length 85 [2019-08-05 11:13:40,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:40,001 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 121 transitions. [2019-08-05 11:13:40,001 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 11:13:40,001 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 121 transitions. [2019-08-05 11:13:40,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 11:13:40,001 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:40,002 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:13:40,002 INFO L418 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:40,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:40,002 INFO L82 PathProgramCache]: Analyzing trace with hash 1427230718, now seen corresponding path program 104 times [2019-08-05 11:13:40,003 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:40,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:40,009 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:13:40,010 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:40,190 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 6 proven. 159 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2019-08-05 11:13:40,190 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:40,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 11:13:40,191 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 11:13:40,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 11:13:40,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=508, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:13:40,191 INFO L87 Difference]: Start difference. First operand 105 states and 121 transitions. Second operand 25 states. [2019-08-05 11:13:40,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:40,483 INFO L93 Difference]: Finished difference Result 181 states and 210 transitions. [2019-08-05 11:13:40,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 11:13:40,483 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 85 [2019-08-05 11:13:40,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:40,484 INFO L225 Difference]: With dead ends: 181 [2019-08-05 11:13:40,484 INFO L226 Difference]: Without dead ends: 181 [2019-08-05 11:13:40,485 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=191, Invalid=999, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 11:13:40,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-08-05 11:13:40,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 109. [2019-08-05 11:13:40,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-08-05 11:13:40,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 126 transitions. [2019-08-05 11:13:40,488 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 126 transitions. Word has length 85 [2019-08-05 11:13:40,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:40,488 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 126 transitions. [2019-08-05 11:13:40,488 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 11:13:40,488 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 126 transitions. [2019-08-05 11:13:40,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 11:13:40,489 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:40,489 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:13:40,489 INFO L418 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:40,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:40,489 INFO L82 PathProgramCache]: Analyzing trace with hash 2008597886, now seen corresponding path program 105 times [2019-08-05 11:13:40,490 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:40,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:40,496 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 11:13:40,497 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:40,685 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 7 proven. 156 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2019-08-05 11:13:40,685 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:40,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 11:13:40,685 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 11:13:40,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 11:13:40,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=515, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:13:40,686 INFO L87 Difference]: Start difference. First operand 109 states and 126 transitions. Second operand 25 states. [2019-08-05 11:13:41,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:41,059 INFO L93 Difference]: Finished difference Result 189 states and 218 transitions. [2019-08-05 11:13:41,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 11:13:41,060 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 85 [2019-08-05 11:13:41,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:41,061 INFO L225 Difference]: With dead ends: 189 [2019-08-05 11:13:41,061 INFO L226 Difference]: Without dead ends: 189 [2019-08-05 11:13:41,061 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=211, Invalid=1271, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 11:13:41,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-08-05 11:13:41,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 113. [2019-08-05 11:13:41,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-08-05 11:13:41,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 131 transitions. [2019-08-05 11:13:41,065 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 131 transitions. Word has length 85 [2019-08-05 11:13:41,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:41,065 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 131 transitions. [2019-08-05 11:13:41,065 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 11:13:41,065 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 131 transitions. [2019-08-05 11:13:41,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 11:13:41,065 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:41,066 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 7, 7, 7, 7, 7, 7, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:13:41,066 INFO L418 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:41,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:41,066 INFO L82 PathProgramCache]: Analyzing trace with hash -447377539, now seen corresponding path program 106 times [2019-08-05 11:13:41,067 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:41,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:41,075 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 11:13:41,076 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:41,269 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 5 proven. 165 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-08-05 11:13:41,270 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:41,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 11:13:41,270 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 11:13:41,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 11:13:41,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=500, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:13:41,271 INFO L87 Difference]: Start difference. First operand 113 states and 131 transitions. Second operand 25 states. [2019-08-05 11:13:41,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:41,732 INFO L93 Difference]: Finished difference Result 185 states and 216 transitions. [2019-08-05 11:13:41,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 11:13:41,733 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 85 [2019-08-05 11:13:41,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:41,734 INFO L225 Difference]: With dead ends: 185 [2019-08-05 11:13:41,734 INFO L226 Difference]: Without dead ends: 185 [2019-08-05 11:13:41,734 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=204, Invalid=986, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 11:13:41,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-08-05 11:13:41,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 129. [2019-08-05 11:13:41,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-08-05 11:13:41,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 150 transitions. [2019-08-05 11:13:41,738 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 150 transitions. Word has length 85 [2019-08-05 11:13:41,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:41,738 INFO L475 AbstractCegarLoop]: Abstraction has 129 states and 150 transitions. [2019-08-05 11:13:41,738 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 11:13:41,738 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 150 transitions. [2019-08-05 11:13:41,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 11:13:41,739 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:41,739 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:13:41,739 INFO L418 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:41,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:41,739 INFO L82 PathProgramCache]: Analyzing trace with hash -209798402, now seen corresponding path program 107 times [2019-08-05 11:13:41,740 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:41,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:41,747 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 11:13:41,748 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:42,054 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 6 proven. 157 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2019-08-05 11:13:42,054 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:42,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 11:13:42,054 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 11:13:42,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 11:13:42,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=515, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:13:42,055 INFO L87 Difference]: Start difference. First operand 129 states and 150 transitions. Second operand 25 states. [2019-08-05 11:13:42,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:42,420 INFO L93 Difference]: Finished difference Result 185 states and 214 transitions. [2019-08-05 11:13:42,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 11:13:42,421 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 85 [2019-08-05 11:13:42,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:42,422 INFO L225 Difference]: With dead ends: 185 [2019-08-05 11:13:42,422 INFO L226 Difference]: Without dead ends: 185 [2019-08-05 11:13:42,423 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=211, Invalid=1271, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 11:13:42,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-08-05 11:13:42,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 125. [2019-08-05 11:13:42,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-08-05 11:13:42,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 145 transitions. [2019-08-05 11:13:42,427 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 145 transitions. Word has length 85 [2019-08-05 11:13:42,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:42,427 INFO L475 AbstractCegarLoop]: Abstraction has 125 states and 145 transitions. [2019-08-05 11:13:42,427 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 11:13:42,427 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 145 transitions. [2019-08-05 11:13:42,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 11:13:42,428 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:42,428 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 7, 7, 7, 7, 7, 7, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:13:42,428 INFO L418 AbstractCegarLoop]: === Iteration 112 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:42,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:42,428 INFO L82 PathProgramCache]: Analyzing trace with hash 1771018749, now seen corresponding path program 108 times [2019-08-05 11:13:42,429 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:42,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:42,436 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 11:13:42,437 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:42,924 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 6 proven. 164 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-08-05 11:13:42,924 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:42,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 11:13:42,925 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 11:13:42,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 11:13:42,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=500, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:13:42,925 INFO L87 Difference]: Start difference. First operand 125 states and 145 transitions. Second operand 25 states. [2019-08-05 11:13:43,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:43,240 INFO L93 Difference]: Finished difference Result 193 states and 225 transitions. [2019-08-05 11:13:43,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 11:13:43,241 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 85 [2019-08-05 11:13:43,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:43,242 INFO L225 Difference]: With dead ends: 193 [2019-08-05 11:13:43,242 INFO L226 Difference]: Without dead ends: 193 [2019-08-05 11:13:43,243 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=204, Invalid=986, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 11:13:43,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-08-05 11:13:43,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 105. [2019-08-05 11:13:43,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-08-05 11:13:43,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 121 transitions. [2019-08-05 11:13:43,247 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 121 transitions. Word has length 85 [2019-08-05 11:13:43,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:43,247 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 121 transitions. [2019-08-05 11:13:43,247 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 11:13:43,247 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 121 transitions. [2019-08-05 11:13:43,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 11:13:43,248 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:43,248 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1] [2019-08-05 11:13:43,248 INFO L418 AbstractCegarLoop]: === Iteration 113 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:43,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:43,249 INFO L82 PathProgramCache]: Analyzing trace with hash -333300865, now seen corresponding path program 109 times [2019-08-05 11:13:43,249 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:43,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:43,256 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 11:13:43,257 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:43,490 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 3 proven. 151 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-08-05 11:13:43,491 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:43,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 11:13:43,491 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 11:13:43,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 11:13:43,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=466, Unknown=0, NotChecked=0, Total=552 [2019-08-05 11:13:43,492 INFO L87 Difference]: Start difference. First operand 105 states and 121 transitions. Second operand 24 states. [2019-08-05 11:13:43,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:43,725 INFO L93 Difference]: Finished difference Result 169 states and 193 transitions. [2019-08-05 11:13:43,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 11:13:43,726 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 85 [2019-08-05 11:13:43,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:43,727 INFO L225 Difference]: With dead ends: 169 [2019-08-05 11:13:43,727 INFO L226 Difference]: Without dead ends: 169 [2019-08-05 11:13:43,727 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=146, Invalid=724, Unknown=0, NotChecked=0, Total=870 [2019-08-05 11:13:43,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-08-05 11:13:43,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 113. [2019-08-05 11:13:43,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-08-05 11:13:43,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 130 transitions. [2019-08-05 11:13:43,731 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 130 transitions. Word has length 85 [2019-08-05 11:13:43,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:43,732 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 130 transitions. [2019-08-05 11:13:43,732 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 11:13:43,732 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 130 transitions. [2019-08-05 11:13:43,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 11:13:43,732 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:43,732 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:13:43,732 INFO L418 AbstractCegarLoop]: === Iteration 114 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:43,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:43,733 INFO L82 PathProgramCache]: Analyzing trace with hash -791165570, now seen corresponding path program 110 times [2019-08-05 11:13:43,733 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:43,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:43,739 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:13:43,740 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:43,978 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 5 proven. 160 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2019-08-05 11:13:43,978 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:43,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 11:13:43,978 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 11:13:43,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 11:13:43,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=508, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:13:43,979 INFO L87 Difference]: Start difference. First operand 113 states and 130 transitions. Second operand 25 states. [2019-08-05 11:13:44,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:44,309 INFO L93 Difference]: Finished difference Result 161 states and 186 transitions. [2019-08-05 11:13:44,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 11:13:44,310 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 85 [2019-08-05 11:13:44,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:44,311 INFO L225 Difference]: With dead ends: 161 [2019-08-05 11:13:44,311 INFO L226 Difference]: Without dead ends: 161 [2019-08-05 11:13:44,312 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=191, Invalid=999, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 11:13:44,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-08-05 11:13:44,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 109. [2019-08-05 11:13:44,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-08-05 11:13:44,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 125 transitions. [2019-08-05 11:13:44,315 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 125 transitions. Word has length 85 [2019-08-05 11:13:44,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:44,315 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 125 transitions. [2019-08-05 11:13:44,315 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 11:13:44,316 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 125 transitions. [2019-08-05 11:13:44,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 11:13:44,316 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:44,316 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:13:44,316 INFO L418 AbstractCegarLoop]: === Iteration 115 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:44,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:44,317 INFO L82 PathProgramCache]: Analyzing trace with hash -570880002, now seen corresponding path program 111 times [2019-08-05 11:13:44,317 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:44,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:44,323 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 11:13:44,324 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:44,538 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 4 proven. 159 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2019-08-05 11:13:44,539 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:44,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 11:13:44,539 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 11:13:44,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 11:13:44,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=515, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:13:44,540 INFO L87 Difference]: Start difference. First operand 109 states and 125 transitions. Second operand 25 states. [2019-08-05 11:13:44,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:44,882 INFO L93 Difference]: Finished difference Result 169 states and 196 transitions. [2019-08-05 11:13:44,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 11:13:44,883 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 85 [2019-08-05 11:13:44,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:44,884 INFO L225 Difference]: With dead ends: 169 [2019-08-05 11:13:44,884 INFO L226 Difference]: Without dead ends: 169 [2019-08-05 11:13:44,885 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=196, Invalid=1136, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 11:13:44,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-08-05 11:13:44,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 85. [2019-08-05 11:13:44,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-08-05 11:13:44,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 97 transitions. [2019-08-05 11:13:44,888 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 97 transitions. Word has length 85 [2019-08-05 11:13:44,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:44,888 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 97 transitions. [2019-08-05 11:13:44,888 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 11:13:44,889 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 97 transitions. [2019-08-05 11:13:44,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 11:13:44,889 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:44,889 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:13:44,889 INFO L418 AbstractCegarLoop]: === Iteration 116 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:44,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:44,890 INFO L82 PathProgramCache]: Analyzing trace with hash 967902459, now seen corresponding path program 112 times [2019-08-05 11:13:44,890 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:44,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:44,898 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 11:13:44,899 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:45,430 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2019-08-05 11:13:45,430 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:45,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 11:13:45,430 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 11:13:45,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 11:13:45,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=434, Unknown=0, NotChecked=0, Total=552 [2019-08-05 11:13:45,431 INFO L87 Difference]: Start difference. First operand 85 states and 97 transitions. Second operand 24 states. [2019-08-05 11:13:45,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:45,681 INFO L93 Difference]: Finished difference Result 153 states and 174 transitions. [2019-08-05 11:13:45,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 11:13:45,681 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 85 [2019-08-05 11:13:45,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:45,684 INFO L225 Difference]: With dead ends: 153 [2019-08-05 11:13:45,685 INFO L226 Difference]: Without dead ends: 153 [2019-08-05 11:13:45,685 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=235, Invalid=821, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 11:13:45,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-08-05 11:13:45,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 113. [2019-08-05 11:13:45,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-08-05 11:13:45,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 132 transitions. [2019-08-05 11:13:45,688 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 132 transitions. Word has length 85 [2019-08-05 11:13:45,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:45,689 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 132 transitions. [2019-08-05 11:13:45,689 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 11:13:45,689 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 132 transitions. [2019-08-05 11:13:45,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 11:13:45,689 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:45,690 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1] [2019-08-05 11:13:45,690 INFO L418 AbstractCegarLoop]: === Iteration 117 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:45,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:45,690 INFO L82 PathProgramCache]: Analyzing trace with hash -1934118657, now seen corresponding path program 113 times [2019-08-05 11:13:45,691 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:45,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:45,699 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 11:13:45,701 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:45,906 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 4 proven. 150 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-08-05 11:13:45,906 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:45,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 11:13:45,906 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 11:13:45,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 11:13:45,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=446, Unknown=0, NotChecked=0, Total=552 [2019-08-05 11:13:45,907 INFO L87 Difference]: Start difference. First operand 113 states and 132 transitions. Second operand 24 states. [2019-08-05 11:13:46,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:46,074 INFO L93 Difference]: Finished difference Result 209 states and 238 transitions. [2019-08-05 11:13:46,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 11:13:46,075 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 85 [2019-08-05 11:13:46,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:46,076 INFO L225 Difference]: With dead ends: 209 [2019-08-05 11:13:46,076 INFO L226 Difference]: Without dead ends: 209 [2019-08-05 11:13:46,076 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=161, Invalid=651, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:13:46,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-08-05 11:13:46,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 137. [2019-08-05 11:13:46,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-08-05 11:13:46,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 159 transitions. [2019-08-05 11:13:46,080 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 159 transitions. Word has length 85 [2019-08-05 11:13:46,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:46,080 INFO L475 AbstractCegarLoop]: Abstraction has 137 states and 159 transitions. [2019-08-05 11:13:46,080 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 11:13:46,080 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 159 transitions. [2019-08-05 11:13:46,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 11:13:46,081 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:46,081 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:13:46,081 INFO L418 AbstractCegarLoop]: === Iteration 118 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:46,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:46,081 INFO L82 PathProgramCache]: Analyzing trace with hash 2123269502, now seen corresponding path program 114 times [2019-08-05 11:13:46,082 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:46,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:46,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 11:13:46,090 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:46,321 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 5 proven. 158 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2019-08-05 11:13:46,321 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:46,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 11:13:46,321 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 11:13:46,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 11:13:46,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=513, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:13:46,322 INFO L87 Difference]: Start difference. First operand 137 states and 159 transitions. Second operand 25 states. [2019-08-05 11:13:46,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:46,859 INFO L93 Difference]: Finished difference Result 221 states and 256 transitions. [2019-08-05 11:13:46,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:13:46,859 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 85 [2019-08-05 11:13:46,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:46,860 INFO L225 Difference]: With dead ends: 221 [2019-08-05 11:13:46,860 INFO L226 Difference]: Without dead ends: 221 [2019-08-05 11:13:46,861 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=224, Invalid=1258, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 11:13:46,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2019-08-05 11:13:46,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 129. [2019-08-05 11:13:46,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-08-05 11:13:46,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 150 transitions. [2019-08-05 11:13:46,865 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 150 transitions. Word has length 85 [2019-08-05 11:13:46,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:46,866 INFO L475 AbstractCegarLoop]: Abstraction has 129 states and 150 transitions. [2019-08-05 11:13:46,866 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 11:13:46,866 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 150 transitions. [2019-08-05 11:13:46,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 11:13:46,866 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:46,866 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:13:46,867 INFO L418 AbstractCegarLoop]: === Iteration 119 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:46,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:46,867 INFO L82 PathProgramCache]: Analyzing trace with hash 1902983934, now seen corresponding path program 115 times [2019-08-05 11:13:46,867 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:46,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:46,873 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:13:46,874 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:47,197 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 6 proven. 159 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2019-08-05 11:13:47,197 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:47,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 11:13:47,197 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 11:13:47,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 11:13:47,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=512, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:13:47,198 INFO L87 Difference]: Start difference. First operand 129 states and 150 transitions. Second operand 25 states. [2019-08-05 11:13:47,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:47,550 INFO L93 Difference]: Finished difference Result 217 states and 250 transitions. [2019-08-05 11:13:47,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 11:13:47,551 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 85 [2019-08-05 11:13:47,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:47,552 INFO L225 Difference]: With dead ends: 217 [2019-08-05 11:13:47,552 INFO L226 Difference]: Without dead ends: 217 [2019-08-05 11:13:47,553 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=200, Invalid=1060, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 11:13:47,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-08-05 11:13:47,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 133. [2019-08-05 11:13:47,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-08-05 11:13:47,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 155 transitions. [2019-08-05 11:13:47,556 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 155 transitions. Word has length 85 [2019-08-05 11:13:47,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:47,557 INFO L475 AbstractCegarLoop]: Abstraction has 133 states and 155 transitions. [2019-08-05 11:13:47,557 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 11:13:47,557 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 155 transitions. [2019-08-05 11:13:47,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 11:13:47,557 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:47,557 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 8, 8, 8, 8, 8, 8, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:13:47,558 INFO L418 AbstractCegarLoop]: === Iteration 120 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:47,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:47,558 INFO L82 PathProgramCache]: Analyzing trace with hash 1205481596, now seen corresponding path program 116 times [2019-08-05 11:13:47,559 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:47,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:47,564 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 11:13:47,565 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:47,725 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 1 proven. 174 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2019-08-05 11:13:47,726 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:47,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 11:13:47,726 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 11:13:47,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 11:13:47,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=458, Unknown=0, NotChecked=0, Total=552 [2019-08-05 11:13:47,727 INFO L87 Difference]: Start difference. First operand 133 states and 155 transitions. Second operand 24 states. [2019-08-05 11:13:48,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:48,041 INFO L93 Difference]: Finished difference Result 201 states and 229 transitions. [2019-08-05 11:13:48,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 11:13:48,042 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 85 [2019-08-05 11:13:48,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:48,043 INFO L225 Difference]: With dead ends: 201 [2019-08-05 11:13:48,043 INFO L226 Difference]: Without dead ends: 201 [2019-08-05 11:13:48,043 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=251, Invalid=1155, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 11:13:48,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-08-05 11:13:48,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 129. [2019-08-05 11:13:48,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-08-05 11:13:48,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 150 transitions. [2019-08-05 11:13:48,047 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 150 transitions. Word has length 85 [2019-08-05 11:13:48,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:48,047 INFO L475 AbstractCegarLoop]: Abstraction has 129 states and 150 transitions. [2019-08-05 11:13:48,047 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 11:13:48,048 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 150 transitions. [2019-08-05 11:13:48,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 11:13:48,048 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:48,048 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:13:48,048 INFO L418 AbstractCegarLoop]: === Iteration 121 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:48,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:48,048 INFO L82 PathProgramCache]: Analyzing trace with hash -1810616194, now seen corresponding path program 117 times [2019-08-05 11:13:48,049 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:48,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:48,054 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 11:13:48,055 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:48,246 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 7 proven. 156 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2019-08-05 11:13:48,246 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:48,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 11:13:48,247 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 11:13:48,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 11:13:48,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=513, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:13:48,247 INFO L87 Difference]: Start difference. First operand 129 states and 150 transitions. Second operand 25 states. [2019-08-05 11:13:48,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:48,635 INFO L93 Difference]: Finished difference Result 213 states and 245 transitions. [2019-08-05 11:13:48,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 11:13:48,635 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 85 [2019-08-05 11:13:48,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:48,637 INFO L225 Difference]: With dead ends: 213 [2019-08-05 11:13:48,637 INFO L226 Difference]: Without dead ends: 213 [2019-08-05 11:13:48,637 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=220, Invalid=1262, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 11:13:48,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-08-05 11:13:48,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 133. [2019-08-05 11:13:48,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-08-05 11:13:48,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 155 transitions. [2019-08-05 11:13:48,641 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 155 transitions. Word has length 85 [2019-08-05 11:13:48,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:48,641 INFO L475 AbstractCegarLoop]: Abstraction has 133 states and 155 transitions. [2019-08-05 11:13:48,641 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 11:13:48,641 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 155 transitions. [2019-08-05 11:13:48,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 11:13:48,642 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:48,642 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 7, 7, 7, 7, 7, 7, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:13:48,642 INFO L418 AbstractCegarLoop]: === Iteration 122 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:48,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:48,642 INFO L82 PathProgramCache]: Analyzing trace with hash -2048195331, now seen corresponding path program 118 times [2019-08-05 11:13:48,643 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:48,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:48,650 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 11:13:48,651 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:48,992 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 6 proven. 164 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-08-05 11:13:48,992 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:48,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 11:13:48,992 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 11:13:48,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 11:13:48,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=510, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:13:48,993 INFO L87 Difference]: Start difference. First operand 133 states and 155 transitions. Second operand 25 states. [2019-08-05 11:13:49,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:49,321 INFO L93 Difference]: Finished difference Result 205 states and 238 transitions. [2019-08-05 11:13:49,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 11:13:49,322 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 85 [2019-08-05 11:13:49,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:49,323 INFO L225 Difference]: With dead ends: 205 [2019-08-05 11:13:49,323 INFO L226 Difference]: Without dead ends: 205 [2019-08-05 11:13:49,324 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=206, Invalid=1054, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 11:13:49,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-08-05 11:13:49,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 117. [2019-08-05 11:13:49,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-08-05 11:13:49,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 136 transitions. [2019-08-05 11:13:49,327 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 136 transitions. Word has length 85 [2019-08-05 11:13:49,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:49,327 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 136 transitions. [2019-08-05 11:13:49,327 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 11:13:49,327 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 136 transitions. [2019-08-05 11:13:49,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 11:13:49,328 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:49,328 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 8, 8, 8, 8, 8, 8, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:13:49,328 INFO L418 AbstractCegarLoop]: === Iteration 123 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:49,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:49,328 INFO L82 PathProgramCache]: Analyzing trace with hash 624114428, now seen corresponding path program 119 times [2019-08-05 11:13:49,329 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:49,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:49,335 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 11:13:49,336 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:49,552 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 2 proven. 179 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-08-05 11:13:49,552 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:49,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 11:13:49,553 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 11:13:49,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 11:13:49,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=493, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:13:49,553 INFO L87 Difference]: Start difference. First operand 117 states and 136 transitions. Second operand 25 states. [2019-08-05 11:13:49,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:49,860 INFO L93 Difference]: Finished difference Result 205 states and 235 transitions. [2019-08-05 11:13:49,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 11:13:49,861 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 85 [2019-08-05 11:13:49,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:49,862 INFO L225 Difference]: With dead ends: 205 [2019-08-05 11:13:49,862 INFO L226 Difference]: Without dead ends: 205 [2019-08-05 11:13:49,863 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=221, Invalid=969, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 11:13:49,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-08-05 11:13:49,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 113. [2019-08-05 11:13:49,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-08-05 11:13:49,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 131 transitions. [2019-08-05 11:13:49,867 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 131 transitions. Word has length 85 [2019-08-05 11:13:49,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:49,867 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 131 transitions. [2019-08-05 11:13:49,867 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 11:13:49,867 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 131 transitions. [2019-08-05 11:13:49,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 11:13:49,868 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:49,868 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 8, 8, 8, 8, 8, 8, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:13:49,868 INFO L418 AbstractCegarLoop]: === Iteration 124 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:49,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:49,868 INFO L82 PathProgramCache]: Analyzing trace with hash 844399996, now seen corresponding path program 120 times [2019-08-05 11:13:49,869 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:49,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:49,875 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 11:13:49,876 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:50,058 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 3 proven. 178 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-08-05 11:13:50,058 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:50,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 11:13:50,059 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 11:13:50,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 11:13:50,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=493, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:13:50,059 INFO L87 Difference]: Start difference. First operand 113 states and 131 transitions. Second operand 25 states. [2019-08-05 11:13:50,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:50,345 INFO L93 Difference]: Finished difference Result 209 states and 241 transitions. [2019-08-05 11:13:50,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 11:13:50,346 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 85 [2019-08-05 11:13:50,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:50,347 INFO L225 Difference]: With dead ends: 209 [2019-08-05 11:13:50,347 INFO L226 Difference]: Without dead ends: 209 [2019-08-05 11:13:50,348 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=221, Invalid=969, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 11:13:50,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-08-05 11:13:50,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 121. [2019-08-05 11:13:50,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-08-05 11:13:50,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 140 transitions. [2019-08-05 11:13:50,352 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 140 transitions. Word has length 85 [2019-08-05 11:13:50,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:50,352 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 140 transitions. [2019-08-05 11:13:50,352 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 11:13:50,352 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 140 transitions. [2019-08-05 11:13:50,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 11:13:50,352 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:50,353 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:13:50,353 INFO L418 AbstractCegarLoop]: === Iteration 125 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:50,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:50,353 INFO L82 PathProgramCache]: Analyzing trace with hash 551252094, now seen corresponding path program 121 times [2019-08-05 11:13:50,353 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:50,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:50,359 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:13:50,359 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:50,547 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 8 proven. 157 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2019-08-05 11:13:50,547 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:50,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 11:13:50,548 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 11:13:50,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 11:13:50,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=512, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:13:50,548 INFO L87 Difference]: Start difference. First operand 121 states and 140 transitions. Second operand 25 states. [2019-08-05 11:13:50,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:50,923 INFO L93 Difference]: Finished difference Result 209 states and 240 transitions. [2019-08-05 11:13:50,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 11:13:50,924 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 85 [2019-08-05 11:13:50,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:50,925 INFO L225 Difference]: With dead ends: 209 [2019-08-05 11:13:50,925 INFO L226 Difference]: Without dead ends: 209 [2019-08-05 11:13:50,926 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=214, Invalid=1192, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 11:13:50,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-08-05 11:13:50,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 133. [2019-08-05 11:13:50,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-08-05 11:13:50,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 154 transitions. [2019-08-05 11:13:50,929 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 154 transitions. Word has length 85 [2019-08-05 11:13:50,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:50,929 INFO L475 AbstractCegarLoop]: Abstraction has 133 states and 154 transitions. [2019-08-05 11:13:50,930 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 11:13:50,930 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 154 transitions. [2019-08-05 11:13:50,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 11:13:50,930 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:50,930 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:13:50,930 INFO L418 AbstractCegarLoop]: === Iteration 126 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:50,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:50,931 INFO L82 PathProgramCache]: Analyzing trace with hash 1132619262, now seen corresponding path program 122 times [2019-08-05 11:13:50,931 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:50,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:50,937 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:13:50,938 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:51,126 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 10 proven. 155 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2019-08-05 11:13:51,126 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:51,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 11:13:51,126 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 11:13:51,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 11:13:51,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=512, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:13:51,127 INFO L87 Difference]: Start difference. First operand 133 states and 154 transitions. Second operand 25 states. [2019-08-05 11:13:51,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:51,521 INFO L93 Difference]: Finished difference Result 213 states and 244 transitions. [2019-08-05 11:13:51,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 11:13:51,522 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 85 [2019-08-05 11:13:51,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:51,523 INFO L225 Difference]: With dead ends: 213 [2019-08-05 11:13:51,523 INFO L226 Difference]: Without dead ends: 213 [2019-08-05 11:13:51,523 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=222, Invalid=1260, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 11:13:51,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-08-05 11:13:51,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 137. [2019-08-05 11:13:51,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-08-05 11:13:51,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 159 transitions. [2019-08-05 11:13:51,527 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 159 transitions. Word has length 85 [2019-08-05 11:13:51,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:51,527 INFO L475 AbstractCegarLoop]: Abstraction has 137 states and 159 transitions. [2019-08-05 11:13:51,527 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 11:13:51,527 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 159 transitions. [2019-08-05 11:13:51,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 11:13:51,528 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:51,528 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 7, 7, 7, 7, 7, 7, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:13:51,529 INFO L418 AbstractCegarLoop]: === Iteration 127 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:51,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:51,530 INFO L82 PathProgramCache]: Analyzing trace with hash 1081979133, now seen corresponding path program 123 times [2019-08-05 11:13:51,531 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:51,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:51,537 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 11:13:51,537 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:51,856 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 2 proven. 162 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2019-08-05 11:13:51,856 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:51,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 11:13:51,856 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 11:13:51,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 11:13:51,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=468, Unknown=0, NotChecked=0, Total=552 [2019-08-05 11:13:51,857 INFO L87 Difference]: Start difference. First operand 137 states and 159 transitions. Second operand 24 states. [2019-08-05 11:13:52,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:52,390 INFO L93 Difference]: Finished difference Result 225 states and 256 transitions. [2019-08-05 11:13:52,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 11:13:52,391 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 85 [2019-08-05 11:13:52,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:52,392 INFO L225 Difference]: With dead ends: 225 [2019-08-05 11:13:52,392 INFO L226 Difference]: Without dead ends: 225 [2019-08-05 11:13:52,392 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=204, Invalid=986, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 11:13:52,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2019-08-05 11:13:52,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 125. [2019-08-05 11:13:52,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-08-05 11:13:52,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 145 transitions. [2019-08-05 11:13:52,396 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 145 transitions. Word has length 85 [2019-08-05 11:13:52,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:52,396 INFO L475 AbstractCegarLoop]: Abstraction has 125 states and 145 transitions. [2019-08-05 11:13:52,396 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 11:13:52,396 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 145 transitions. [2019-08-05 11:13:52,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 11:13:52,397 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:52,397 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 7, 7, 7, 7, 7, 7, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:13:52,397 INFO L418 AbstractCegarLoop]: === Iteration 128 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:52,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:52,398 INFO L82 PathProgramCache]: Analyzing trace with hash 895040125, now seen corresponding path program 124 times [2019-08-05 11:13:52,399 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:52,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:52,406 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:13:52,407 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:53,098 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 9 proven. 163 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2019-08-05 11:13:53,099 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:53,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 11:13:53,099 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 11:13:53,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 11:13:53,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=502, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:13:53,100 INFO L87 Difference]: Start difference. First operand 125 states and 145 transitions. Second operand 25 states. [2019-08-05 11:13:53,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:53,470 INFO L93 Difference]: Finished difference Result 205 states and 238 transitions. [2019-08-05 11:13:53,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 11:13:53,470 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 85 [2019-08-05 11:13:53,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:53,472 INFO L225 Difference]: With dead ends: 205 [2019-08-05 11:13:53,472 INFO L226 Difference]: Without dead ends: 205 [2019-08-05 11:13:53,473 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=207, Invalid=983, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 11:13:53,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-08-05 11:13:53,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 113. [2019-08-05 11:13:53,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-08-05 11:13:53,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 131 transitions. [2019-08-05 11:13:53,476 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 131 transitions. Word has length 85 [2019-08-05 11:13:53,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:53,477 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 131 transitions. [2019-08-05 11:13:53,477 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 11:13:53,477 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 131 transitions. [2019-08-05 11:13:53,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 11:13:53,478 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:53,478 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 8, 8, 8, 8, 8, 8, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:13:53,478 INFO L418 AbstractCegarLoop]: === Iteration 129 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:53,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:53,478 INFO L82 PathProgramCache]: Analyzing trace with hash -1243738116, now seen corresponding path program 125 times [2019-08-05 11:13:53,479 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:53,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:53,485 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 11:13:53,487 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:53,773 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 4 proven. 177 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-08-05 11:13:53,773 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:53,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 11:13:53,773 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 11:13:53,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 11:13:53,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=493, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:13:53,774 INFO L87 Difference]: Start difference. First operand 113 states and 131 transitions. Second operand 25 states. [2019-08-05 11:13:54,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:54,099 INFO L93 Difference]: Finished difference Result 209 states and 241 transitions. [2019-08-05 11:13:54,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 11:13:54,099 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 85 [2019-08-05 11:13:54,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:54,100 INFO L225 Difference]: With dead ends: 209 [2019-08-05 11:13:54,100 INFO L226 Difference]: Without dead ends: 209 [2019-08-05 11:13:54,100 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=221, Invalid=969, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 11:13:54,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-08-05 11:13:54,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 125. [2019-08-05 11:13:54,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-08-05 11:13:54,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 145 transitions. [2019-08-05 11:13:54,105 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 145 transitions. Word has length 85 [2019-08-05 11:13:54,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:54,105 INFO L475 AbstractCegarLoop]: Abstraction has 125 states and 145 transitions. [2019-08-05 11:13:54,105 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 11:13:54,105 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 145 transitions. [2019-08-05 11:13:54,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 11:13:54,106 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:54,106 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:13:54,106 INFO L418 AbstractCegarLoop]: === Iteration 130 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:54,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:54,106 INFO L82 PathProgramCache]: Analyzing trace with hash -1074209922, now seen corresponding path program 126 times [2019-08-05 11:13:54,107 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:54,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:54,114 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 11:13:54,114 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:54,322 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 9 proven. 154 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2019-08-05 11:13:54,322 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:54,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 11:13:54,323 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 11:13:54,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 11:13:54,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=513, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:13:54,323 INFO L87 Difference]: Start difference. First operand 125 states and 145 transitions. Second operand 25 states. [2019-08-05 11:13:54,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:54,656 INFO L93 Difference]: Finished difference Result 209 states and 239 transitions. [2019-08-05 11:13:54,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 11:13:54,657 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 85 [2019-08-05 11:13:54,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:54,658 INFO L225 Difference]: With dead ends: 209 [2019-08-05 11:13:54,658 INFO L226 Difference]: Without dead ends: 209 [2019-08-05 11:13:54,659 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=214, Invalid=1192, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 11:13:54,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-08-05 11:13:54,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 137. [2019-08-05 11:13:54,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-08-05 11:13:54,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 159 transitions. [2019-08-05 11:13:54,662 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 159 transitions. Word has length 85 [2019-08-05 11:13:54,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:54,662 INFO L475 AbstractCegarLoop]: Abstraction has 137 states and 159 transitions. [2019-08-05 11:13:54,662 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 11:13:54,662 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 159 transitions. [2019-08-05 11:13:54,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 11:13:54,663 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:54,663 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 7, 7, 7, 7, 7, 7, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:13:54,663 INFO L418 AbstractCegarLoop]: === Iteration 131 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:54,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:54,663 INFO L82 PathProgramCache]: Analyzing trace with hash -1006158979, now seen corresponding path program 127 times [2019-08-05 11:13:54,664 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:54,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:54,671 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 11:13:54,672 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:55,190 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 5 proven. 165 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-08-05 11:13:55,191 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:55,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 11:13:55,191 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 11:13:55,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 11:13:55,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=510, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:13:55,192 INFO L87 Difference]: Start difference. First operand 137 states and 159 transitions. Second operand 25 states. [2019-08-05 11:13:55,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:55,570 INFO L93 Difference]: Finished difference Result 229 states and 261 transitions. [2019-08-05 11:13:55,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 11:13:55,571 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 85 [2019-08-05 11:13:55,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:55,572 INFO L225 Difference]: With dead ends: 229 [2019-08-05 11:13:55,572 INFO L226 Difference]: Without dead ends: 229 [2019-08-05 11:13:55,572 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=239, Invalid=1321, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 11:13:55,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2019-08-05 11:13:55,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 133. [2019-08-05 11:13:55,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-08-05 11:13:55,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 154 transitions. [2019-08-05 11:13:55,576 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 154 transitions. Word has length 85 [2019-08-05 11:13:55,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:55,576 INFO L475 AbstractCegarLoop]: Abstraction has 133 states and 154 transitions. [2019-08-05 11:13:55,576 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 11:13:55,576 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 154 transitions. [2019-08-05 11:13:55,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 11:13:55,577 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:55,577 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 7, 7, 7, 7, 7, 7, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:13:55,577 INFO L418 AbstractCegarLoop]: === Iteration 132 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:55,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:55,577 INFO L82 PathProgramCache]: Analyzing trace with hash -1311789059, now seen corresponding path program 128 times [2019-08-05 11:13:55,578 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:55,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:55,583 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:13:55,584 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:55,769 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 8 proven. 164 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2019-08-05 11:13:55,769 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:55,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 11:13:55,769 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 11:13:55,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 11:13:55,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=502, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:13:55,770 INFO L87 Difference]: Start difference. First operand 133 states and 154 transitions. Second operand 25 states. [2019-08-05 11:13:56,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:56,096 INFO L93 Difference]: Finished difference Result 205 states and 237 transitions. [2019-08-05 11:13:56,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 11:13:56,097 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 85 [2019-08-05 11:13:56,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:56,097 INFO L225 Difference]: With dead ends: 205 [2019-08-05 11:13:56,097 INFO L226 Difference]: Without dead ends: 205 [2019-08-05 11:13:56,098 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=207, Invalid=983, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 11:13:56,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-08-05 11:13:56,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 125. [2019-08-05 11:13:56,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-08-05 11:13:56,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 145 transitions. [2019-08-05 11:13:56,100 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 145 transitions. Word has length 85 [2019-08-05 11:13:56,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:56,101 INFO L475 AbstractCegarLoop]: Abstraction has 125 states and 145 transitions. [2019-08-05 11:13:56,101 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 11:13:56,101 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 145 transitions. [2019-08-05 11:13:56,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 11:13:56,101 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:56,101 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 7, 7, 7, 7, 7, 7, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:13:56,101 INFO L418 AbstractCegarLoop]: === Iteration 133 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:56,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:56,102 INFO L82 PathProgramCache]: Analyzing trace with hash -1532074627, now seen corresponding path program 129 times [2019-08-05 11:13:56,102 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:56,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:56,107 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:13:56,108 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:56,305 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 7 proven. 165 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2019-08-05 11:13:56,305 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:56,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 11:13:56,305 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 11:13:56,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 11:13:56,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=502, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:13:56,306 INFO L87 Difference]: Start difference. First operand 125 states and 145 transitions. Second operand 25 states. [2019-08-05 11:13:56,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:56,598 INFO L93 Difference]: Finished difference Result 209 states and 241 transitions. [2019-08-05 11:13:56,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 11:13:56,606 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 85 [2019-08-05 11:13:56,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:56,607 INFO L225 Difference]: With dead ends: 209 [2019-08-05 11:13:56,607 INFO L226 Difference]: Without dead ends: 209 [2019-08-05 11:13:56,607 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=207, Invalid=983, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 11:13:56,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-08-05 11:13:56,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 129. [2019-08-05 11:13:56,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-08-05 11:13:56,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 150 transitions. [2019-08-05 11:13:56,611 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 150 transitions. Word has length 85 [2019-08-05 11:13:56,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:56,612 INFO L475 AbstractCegarLoop]: Abstraction has 129 states and 150 transitions. [2019-08-05 11:13:56,612 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 11:13:56,612 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 150 transitions. [2019-08-05 11:13:56,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 11:13:56,612 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:56,612 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 7, 7, 7, 7, 7, 7, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:13:56,613 INFO L418 AbstractCegarLoop]: === Iteration 134 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:56,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:56,613 INFO L82 PathProgramCache]: Analyzing trace with hash -950707459, now seen corresponding path program 130 times [2019-08-05 11:13:56,614 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:56,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:56,619 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 11:13:56,620 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:57,124 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 8 proven. 162 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-08-05 11:13:57,124 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:57,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 11:13:57,125 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 11:13:57,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 11:13:57,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=510, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:13:57,125 INFO L87 Difference]: Start difference. First operand 129 states and 150 transitions. Second operand 25 states. [2019-08-05 11:13:57,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:57,507 INFO L93 Difference]: Finished difference Result 205 states and 235 transitions. [2019-08-05 11:13:57,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 11:13:57,508 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 85 [2019-08-05 11:13:57,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:57,509 INFO L225 Difference]: With dead ends: 205 [2019-08-05 11:13:57,509 INFO L226 Difference]: Without dead ends: 205 [2019-08-05 11:13:57,510 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=239, Invalid=1321, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 11:13:57,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-08-05 11:13:57,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 133. [2019-08-05 11:13:57,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-08-05 11:13:57,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 155 transitions. [2019-08-05 11:13:57,513 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 155 transitions. Word has length 85 [2019-08-05 11:13:57,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:57,514 INFO L475 AbstractCegarLoop]: Abstraction has 133 states and 155 transitions. [2019-08-05 11:13:57,514 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 11:13:57,514 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 155 transitions. [2019-08-05 11:13:57,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 11:13:57,514 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:57,514 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 8, 8, 8, 8, 8, 8, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:13:57,515 INFO L418 AbstractCegarLoop]: === Iteration 135 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:57,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:57,515 INFO L82 PathProgramCache]: Analyzing trace with hash -1188286596, now seen corresponding path program 131 times [2019-08-05 11:13:57,515 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:57,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:57,520 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 11:13:57,521 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:57,714 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 7 proven. 174 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-08-05 11:13:57,714 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:57,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 11:13:57,714 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 11:13:57,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 11:13:57,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=493, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:13:57,715 INFO L87 Difference]: Start difference. First operand 133 states and 155 transitions. Second operand 25 states. [2019-08-05 11:13:58,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:58,014 INFO L93 Difference]: Finished difference Result 185 states and 213 transitions. [2019-08-05 11:13:58,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 11:13:58,014 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 85 [2019-08-05 11:13:58,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:58,015 INFO L225 Difference]: With dead ends: 185 [2019-08-05 11:13:58,016 INFO L226 Difference]: Without dead ends: 185 [2019-08-05 11:13:58,016 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=221, Invalid=969, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 11:13:58,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-08-05 11:13:58,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 113. [2019-08-05 11:13:58,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-08-05 11:13:58,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 130 transitions. [2019-08-05 11:13:58,021 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 130 transitions. Word has length 85 [2019-08-05 11:13:58,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:58,021 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 130 transitions. [2019-08-05 11:13:58,022 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 11:13:58,022 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 130 transitions. [2019-08-05 11:13:58,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 11:13:58,022 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:58,022 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:13:58,023 INFO L418 AbstractCegarLoop]: === Iteration 136 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:58,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:58,023 INFO L82 PathProgramCache]: Analyzing trace with hash -229038594, now seen corresponding path program 132 times [2019-08-05 11:13:58,024 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:58,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:58,031 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 11:13:58,032 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:58,474 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 4 proven. 159 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2019-08-05 11:13:58,474 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:58,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 11:13:58,474 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 11:13:58,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 11:13:58,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=513, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:13:58,475 INFO L87 Difference]: Start difference. First operand 113 states and 130 transitions. Second operand 25 states. [2019-08-05 11:13:58,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:58,974 INFO L93 Difference]: Finished difference Result 225 states and 258 transitions. [2019-08-05 11:13:58,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:13:58,975 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 85 [2019-08-05 11:13:58,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:58,976 INFO L225 Difference]: With dead ends: 225 [2019-08-05 11:13:58,976 INFO L226 Difference]: Without dead ends: 225 [2019-08-05 11:13:58,977 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=230, Invalid=1330, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 11:13:58,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2019-08-05 11:13:58,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 129. [2019-08-05 11:13:58,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-08-05 11:13:58,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 148 transitions. [2019-08-05 11:13:58,981 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 148 transitions. Word has length 85 [2019-08-05 11:13:58,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:58,981 INFO L475 AbstractCegarLoop]: Abstraction has 129 states and 148 transitions. [2019-08-05 11:13:58,981 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 11:13:58,981 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 148 transitions. [2019-08-05 11:13:58,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 11:13:58,981 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:58,982 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:13:58,982 INFO L418 AbstractCegarLoop]: === Iteration 137 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:58,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:58,982 INFO L82 PathProgramCache]: Analyzing trace with hash 352328574, now seen corresponding path program 133 times [2019-08-05 11:13:58,982 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:58,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:58,988 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 11:13:58,988 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:59,190 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 6 proven. 157 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2019-08-05 11:13:59,190 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:59,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 11:13:59,190 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 11:13:59,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 11:13:59,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=513, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:13:59,191 INFO L87 Difference]: Start difference. First operand 129 states and 148 transitions. Second operand 25 states. [2019-08-05 11:13:59,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:59,562 INFO L93 Difference]: Finished difference Result 229 states and 261 transitions. [2019-08-05 11:13:59,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 11:13:59,562 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 85 [2019-08-05 11:13:59,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:59,564 INFO L225 Difference]: With dead ends: 229 [2019-08-05 11:13:59,564 INFO L226 Difference]: Without dead ends: 229 [2019-08-05 11:13:59,564 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=220, Invalid=1262, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 11:13:59,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2019-08-05 11:13:59,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 133. [2019-08-05 11:13:59,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-08-05 11:13:59,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 153 transitions. [2019-08-05 11:13:59,569 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 153 transitions. Word has length 85 [2019-08-05 11:13:59,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:59,569 INFO L475 AbstractCegarLoop]: Abstraction has 133 states and 153 transitions. [2019-08-05 11:13:59,569 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 11:13:59,569 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 153 transitions. [2019-08-05 11:13:59,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 11:13:59,570 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:59,570 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 7, 7, 7, 7, 7, 7, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:13:59,570 INFO L418 AbstractCegarLoop]: === Iteration 138 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:59,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:59,570 INFO L82 PathProgramCache]: Analyzing trace with hash -1587526147, now seen corresponding path program 134 times [2019-08-05 11:13:59,571 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:59,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:59,576 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 11:13:59,577 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:59,823 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 3 proven. 167 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-08-05 11:13:59,823 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:59,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 11:13:59,824 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 11:13:59,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 11:13:59,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=510, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:13:59,824 INFO L87 Difference]: Start difference. First operand 133 states and 153 transitions. Second operand 25 states. [2019-08-05 11:14:00,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:00,217 INFO L93 Difference]: Finished difference Result 229 states and 262 transitions. [2019-08-05 11:14:00,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 11:14:00,217 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 85 [2019-08-05 11:14:00,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:00,218 INFO L225 Difference]: With dead ends: 229 [2019-08-05 11:14:00,218 INFO L226 Difference]: Without dead ends: 229 [2019-08-05 11:14:00,218 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=230, Invalid=1252, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 11:14:00,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2019-08-05 11:14:00,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 121. [2019-08-05 11:14:00,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-08-05 11:14:00,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 139 transitions. [2019-08-05 11:14:00,221 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 139 transitions. Word has length 85 [2019-08-05 11:14:00,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:00,222 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 139 transitions. [2019-08-05 11:14:00,222 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 11:14:00,222 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 139 transitions. [2019-08-05 11:14:00,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 11:14:00,222 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:00,222 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 8, 8, 8, 8, 8, 8, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:14:00,222 INFO L418 AbstractCegarLoop]: === Iteration 139 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:00,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:00,223 INFO L82 PathProgramCache]: Analyzing trace with hash 107993724, now seen corresponding path program 135 times [2019-08-05 11:14:00,223 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:00,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:00,228 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 11:14:00,229 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:00,426 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 5 proven. 176 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-08-05 11:14:00,426 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:00,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 11:14:00,426 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 11:14:00,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 11:14:00,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=493, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:14:00,427 INFO L87 Difference]: Start difference. First operand 121 states and 139 transitions. Second operand 25 states. [2019-08-05 11:14:00,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:00,721 INFO L93 Difference]: Finished difference Result 229 states and 266 transitions. [2019-08-05 11:14:00,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 11:14:00,721 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 85 [2019-08-05 11:14:00,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:00,722 INFO L225 Difference]: With dead ends: 229 [2019-08-05 11:14:00,723 INFO L226 Difference]: Without dead ends: 229 [2019-08-05 11:14:00,723 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=221, Invalid=969, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 11:14:00,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2019-08-05 11:14:00,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 137. [2019-08-05 11:14:00,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-08-05 11:14:00,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 158 transitions. [2019-08-05 11:14:00,727 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 158 transitions. Word has length 85 [2019-08-05 11:14:00,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:00,727 INFO L475 AbstractCegarLoop]: Abstraction has 137 states and 158 transitions. [2019-08-05 11:14:00,727 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 11:14:00,727 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 158 transitions. [2019-08-05 11:14:00,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 11:14:00,728 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:00,728 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 7, 7, 7, 7, 7, 7, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:14:00,728 INFO L418 AbstractCegarLoop]: === Iteration 140 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:00,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:00,728 INFO L82 PathProgramCache]: Analyzing trace with hash 345572861, now seen corresponding path program 136 times [2019-08-05 11:14:00,729 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:00,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:00,734 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 11:14:00,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:00,925 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 6 proven. 164 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-08-05 11:14:00,925 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:00,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 11:14:00,926 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 11:14:00,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 11:14:00,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=510, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:14:00,926 INFO L87 Difference]: Start difference. First operand 137 states and 158 transitions. Second operand 25 states. [2019-08-05 11:14:01,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:01,288 INFO L93 Difference]: Finished difference Result 237 states and 272 transitions. [2019-08-05 11:14:01,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 11:14:01,289 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 85 [2019-08-05 11:14:01,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:01,290 INFO L225 Difference]: With dead ends: 237 [2019-08-05 11:14:01,290 INFO L226 Difference]: Without dead ends: 237 [2019-08-05 11:14:01,290 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=239, Invalid=1321, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 11:14:01,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2019-08-05 11:14:01,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 133. [2019-08-05 11:14:01,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-08-05 11:14:01,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 153 transitions. [2019-08-05 11:14:01,294 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 153 transitions. Word has length 85 [2019-08-05 11:14:01,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:01,294 INFO L475 AbstractCegarLoop]: Abstraction has 133 states and 153 transitions. [2019-08-05 11:14:01,294 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 11:14:01,294 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 153 transitions. [2019-08-05 11:14:01,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 11:14:01,295 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:01,295 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 7, 7, 7, 7, 7, 7, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:14:01,295 INFO L418 AbstractCegarLoop]: === Iteration 141 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:01,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:01,295 INFO L82 PathProgramCache]: Analyzing trace with hash 114749437, now seen corresponding path program 137 times [2019-08-05 11:14:01,296 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:01,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:01,301 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 11:14:01,302 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:01,489 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 5 proven. 165 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-08-05 11:14:01,489 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:01,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 11:14:01,490 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 11:14:01,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 11:14:01,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=510, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:14:01,490 INFO L87 Difference]: Start difference. First operand 133 states and 153 transitions. Second operand 25 states. [2019-08-05 11:14:01,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:01,833 INFO L93 Difference]: Finished difference Result 201 states and 231 transitions. [2019-08-05 11:14:01,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 11:14:01,834 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 85 [2019-08-05 11:14:01,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:01,835 INFO L225 Difference]: With dead ends: 201 [2019-08-05 11:14:01,835 INFO L226 Difference]: Without dead ends: 201 [2019-08-05 11:14:01,836 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=214, Invalid=1118, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 11:14:01,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-08-05 11:14:01,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 121. [2019-08-05 11:14:01,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-08-05 11:14:01,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 139 transitions. [2019-08-05 11:14:01,840 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 139 transitions. Word has length 85 [2019-08-05 11:14:01,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:01,840 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 139 transitions. [2019-08-05 11:14:01,841 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 11:14:01,841 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 139 transitions. [2019-08-05 11:14:01,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 11:14:01,841 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:01,841 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 7, 7, 7, 7, 7, 7, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:14:01,842 INFO L418 AbstractCegarLoop]: === Iteration 142 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:01,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:01,842 INFO L82 PathProgramCache]: Analyzing trace with hash -235794307, now seen corresponding path program 138 times [2019-08-05 11:14:01,842 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:01,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:01,850 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:14:01,851 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:02,458 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 5 proven. 167 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2019-08-05 11:14:02,458 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:02,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 11:14:02,458 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 11:14:02,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 11:14:02,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=502, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:14:02,459 INFO L87 Difference]: Start difference. First operand 121 states and 139 transitions. Second operand 25 states. [2019-08-05 11:14:02,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:02,757 INFO L93 Difference]: Finished difference Result 221 states and 254 transitions. [2019-08-05 11:14:02,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 11:14:02,758 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 85 [2019-08-05 11:14:02,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:02,759 INFO L225 Difference]: With dead ends: 221 [2019-08-05 11:14:02,759 INFO L226 Difference]: Without dead ends: 221 [2019-08-05 11:14:02,760 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=207, Invalid=983, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 11:14:02,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2019-08-05 11:14:02,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 117. [2019-08-05 11:14:02,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-08-05 11:14:02,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 134 transitions. [2019-08-05 11:14:02,763 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 134 transitions. Word has length 85 [2019-08-05 11:14:02,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:02,763 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 134 transitions. [2019-08-05 11:14:02,763 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 11:14:02,763 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 134 transitions. [2019-08-05 11:14:02,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 11:14:02,764 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:02,764 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 7, 7, 7, 7, 7, 7, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:14:02,764 INFO L418 AbstractCegarLoop]: === Iteration 143 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:02,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:02,764 INFO L82 PathProgramCache]: Analyzing trace with hash -15508739, now seen corresponding path program 139 times [2019-08-05 11:14:02,765 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:02,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:02,772 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 11:14:02,774 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:03,010 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 4 proven. 166 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-08-05 11:14:03,010 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:03,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 11:14:03,011 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 11:14:03,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 11:14:03,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=510, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:14:03,011 INFO L87 Difference]: Start difference. First operand 117 states and 134 transitions. Second operand 25 states. [2019-08-05 11:14:03,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:03,356 INFO L93 Difference]: Finished difference Result 213 states and 245 transitions. [2019-08-05 11:14:03,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 11:14:03,357 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 85 [2019-08-05 11:14:03,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:03,358 INFO L225 Difference]: With dead ends: 213 [2019-08-05 11:14:03,358 INFO L226 Difference]: Without dead ends: 213 [2019-08-05 11:14:03,359 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=222, Invalid=1184, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 11:14:03,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-08-05 11:14:03,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 125. [2019-08-05 11:14:03,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-08-05 11:14:03,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 143 transitions. [2019-08-05 11:14:03,362 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 143 transitions. Word has length 85 [2019-08-05 11:14:03,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:03,362 INFO L475 AbstractCegarLoop]: Abstraction has 125 states and 143 transitions. [2019-08-05 11:14:03,362 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 11:14:03,362 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 143 transitions. [2019-08-05 11:14:03,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 11:14:03,363 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:03,363 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:14:03,363 INFO L418 AbstractCegarLoop]: === Iteration 144 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:03,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:03,363 INFO L82 PathProgramCache]: Analyzing trace with hash 222070398, now seen corresponding path program 140 times [2019-08-05 11:14:03,364 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:03,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:03,369 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 11:14:03,370 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:03,627 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 3 proven. 154 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2019-08-05 11:14:03,628 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:03,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 11:14:03,628 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 11:14:03,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 11:14:03,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=464, Unknown=0, NotChecked=0, Total=552 [2019-08-05 11:14:03,628 INFO L87 Difference]: Start difference. First operand 125 states and 143 transitions. Second operand 24 states. [2019-08-05 11:14:03,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:03,861 INFO L93 Difference]: Finished difference Result 209 states and 237 transitions. [2019-08-05 11:14:03,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 11:14:03,862 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 85 [2019-08-05 11:14:03,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:03,863 INFO L225 Difference]: With dead ends: 209 [2019-08-05 11:14:03,863 INFO L226 Difference]: Without dead ends: 209 [2019-08-05 11:14:03,863 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=174, Invalid=818, Unknown=0, NotChecked=0, Total=992 [2019-08-05 11:14:03,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-08-05 11:14:03,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 105. [2019-08-05 11:14:03,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-08-05 11:14:03,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 120 transitions. [2019-08-05 11:14:03,867 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 120 transitions. Word has length 85 [2019-08-05 11:14:03,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:03,867 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 120 transitions. [2019-08-05 11:14:03,867 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 11:14:03,867 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 120 transitions. [2019-08-05 11:14:03,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 11:14:03,868 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:03,868 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 8, 8, 8, 8, 8, 8, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:14:03,868 INFO L418 AbstractCegarLoop]: === Iteration 145 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:03,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:03,868 INFO L82 PathProgramCache]: Analyzing trace with hash -1968577284, now seen corresponding path program 141 times [2019-08-05 11:14:03,869 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:03,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:03,875 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 11:14:03,876 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:04,072 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 6 proven. 175 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-08-05 11:14:04,073 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:04,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 11:14:04,073 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 11:14:04,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 11:14:04,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=493, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:14:04,073 INFO L87 Difference]: Start difference. First operand 105 states and 120 transitions. Second operand 25 states. [2019-08-05 11:14:04,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:04,370 INFO L93 Difference]: Finished difference Result 177 states and 203 transitions. [2019-08-05 11:14:04,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 11:14:04,371 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 85 [2019-08-05 11:14:04,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:04,371 INFO L225 Difference]: With dead ends: 177 [2019-08-05 11:14:04,372 INFO L226 Difference]: Without dead ends: 177 [2019-08-05 11:14:04,372 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=221, Invalid=969, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 11:14:04,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-08-05 11:14:04,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 117. [2019-08-05 11:14:04,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-08-05 11:14:04,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 135 transitions. [2019-08-05 11:14:04,375 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 135 transitions. Word has length 85 [2019-08-05 11:14:04,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:04,375 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 135 transitions. [2019-08-05 11:14:04,375 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 11:14:04,375 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 135 transitions. [2019-08-05 11:14:04,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 11:14:04,375 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:04,376 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:14:04,376 INFO L418 AbstractCegarLoop]: === Iteration 146 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:04,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:04,376 INFO L82 PathProgramCache]: Analyzing trace with hash -1854500610, now seen corresponding path program 142 times [2019-08-05 11:14:04,376 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:04,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:04,382 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 11:14:04,383 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:04,609 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 8 proven. 155 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2019-08-05 11:14:04,609 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:04,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 11:14:04,610 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 11:14:04,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 11:14:04,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=513, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:14:04,610 INFO L87 Difference]: Start difference. First operand 117 states and 135 transitions. Second operand 25 states. [2019-08-05 11:14:04,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:04,998 INFO L93 Difference]: Finished difference Result 201 states and 229 transitions. [2019-08-05 11:14:04,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 11:14:04,999 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 85 [2019-08-05 11:14:04,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:05,000 INFO L225 Difference]: With dead ends: 201 [2019-08-05 11:14:05,000 INFO L226 Difference]: Without dead ends: 201 [2019-08-05 11:14:05,001 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=214, Invalid=1192, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 11:14:05,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-08-05 11:14:05,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 125. [2019-08-05 11:14:05,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-08-05 11:14:05,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 144 transitions. [2019-08-05 11:14:05,004 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 144 transitions. Word has length 85 [2019-08-05 11:14:05,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:05,004 INFO L475 AbstractCegarLoop]: Abstraction has 125 states and 144 transitions. [2019-08-05 11:14:05,004 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 11:14:05,004 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 144 transitions. [2019-08-05 11:14:05,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 11:14:05,005 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:05,005 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 7, 7, 7, 7, 7, 7, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:14:05,005 INFO L418 AbstractCegarLoop]: === Iteration 147 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:05,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:05,005 INFO L82 PathProgramCache]: Analyzing trace with hash -1730998147, now seen corresponding path program 143 times [2019-08-05 11:14:05,006 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:05,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:05,011 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 11:14:05,012 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:05,198 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 7 proven. 163 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-08-05 11:14:05,198 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:05,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 11:14:05,198 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 11:14:05,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 11:14:05,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=510, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:14:05,199 INFO L87 Difference]: Start difference. First operand 125 states and 144 transitions. Second operand 25 states. [2019-08-05 11:14:05,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:05,573 INFO L93 Difference]: Finished difference Result 209 states and 238 transitions. [2019-08-05 11:14:05,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 11:14:05,573 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 85 [2019-08-05 11:14:05,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:05,574 INFO L225 Difference]: With dead ends: 209 [2019-08-05 11:14:05,575 INFO L226 Difference]: Without dead ends: 209 [2019-08-05 11:14:05,575 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=239, Invalid=1321, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 11:14:05,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-08-05 11:14:05,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 121. [2019-08-05 11:14:05,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-08-05 11:14:05,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 139 transitions. [2019-08-05 11:14:05,580 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 139 transitions. Word has length 85 [2019-08-05 11:14:05,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:05,580 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 139 transitions. [2019-08-05 11:14:05,580 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 11:14:05,580 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 139 transitions. [2019-08-05 11:14:05,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 11:14:05,581 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:05,581 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 7, 7, 7, 7, 7, 7, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:14:05,581 INFO L418 AbstractCegarLoop]: === Iteration 148 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:05,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:05,582 INFO L82 PathProgramCache]: Analyzing trace with hash -2092079747, now seen corresponding path program 144 times [2019-08-05 11:14:05,582 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:05,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:05,590 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:14:05,591 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:06,061 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 7 proven. 165 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2019-08-05 11:14:06,062 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:06,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 11:14:06,062 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 11:14:06,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 11:14:06,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=502, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:14:06,063 INFO L87 Difference]: Start difference. First operand 121 states and 139 transitions. Second operand 25 states. [2019-08-05 11:14:06,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:06,349 INFO L93 Difference]: Finished difference Result 189 states and 217 transitions. [2019-08-05 11:14:06,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 11:14:06,349 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 85 [2019-08-05 11:14:06,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:06,350 INFO L225 Difference]: With dead ends: 189 [2019-08-05 11:14:06,351 INFO L226 Difference]: Without dead ends: 189 [2019-08-05 11:14:06,351 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=207, Invalid=983, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 11:14:06,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-08-05 11:14:06,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 113. [2019-08-05 11:14:06,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-08-05 11:14:06,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 130 transitions. [2019-08-05 11:14:06,355 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 130 transitions. Word has length 85 [2019-08-05 11:14:06,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:06,355 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 130 transitions. [2019-08-05 11:14:06,355 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 11:14:06,355 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 130 transitions. [2019-08-05 11:14:06,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 11:14:06,356 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:06,356 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 7, 7, 7, 7, 7, 7, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:14:06,356 INFO L418 AbstractCegarLoop]: === Iteration 149 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:06,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:06,356 INFO L82 PathProgramCache]: Analyzing trace with hash 1982601981, now seen corresponding path program 145 times [2019-08-05 11:14:06,357 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:06,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:06,362 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:14:06,363 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:06,577 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 6 proven. 166 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2019-08-05 11:14:06,577 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:06,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 11:14:06,577 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 11:14:06,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 11:14:06,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=502, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:14:06,578 INFO L87 Difference]: Start difference. First operand 113 states and 130 transitions. Second operand 25 states. [2019-08-05 11:14:06,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:06,895 INFO L93 Difference]: Finished difference Result 193 states and 221 transitions. [2019-08-05 11:14:06,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 11:14:06,896 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 85 [2019-08-05 11:14:06,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:06,897 INFO L225 Difference]: With dead ends: 193 [2019-08-05 11:14:06,897 INFO L226 Difference]: Without dead ends: 193 [2019-08-05 11:14:06,897 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=207, Invalid=983, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 11:14:06,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-08-05 11:14:06,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 93. [2019-08-05 11:14:06,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-08-05 11:14:06,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 106 transitions. [2019-08-05 11:14:06,901 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 106 transitions. Word has length 85 [2019-08-05 11:14:06,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:06,901 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 106 transitions. [2019-08-05 11:14:06,902 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 11:14:06,902 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 106 transitions. [2019-08-05 11:14:06,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:14:06,902 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:06,902 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1] [2019-08-05 11:14:06,903 INFO L418 AbstractCegarLoop]: === Iteration 150 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:06,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:06,903 INFO L82 PathProgramCache]: Analyzing trace with hash -1185987936, now seen corresponding path program 146 times [2019-08-05 11:14:06,904 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:06,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:06,912 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 11:14:06,913 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:07,715 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 4 proven. 182 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2019-08-05 11:14:07,716 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:07,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 11:14:07,716 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 11:14:07,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 11:14:07,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=539, Unknown=0, NotChecked=0, Total=650 [2019-08-05 11:14:07,716 INFO L87 Difference]: Start difference. First operand 93 states and 106 transitions. Second operand 26 states. [2019-08-05 11:14:07,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:07,909 INFO L93 Difference]: Finished difference Result 209 states and 237 transitions. [2019-08-05 11:14:07,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 11:14:07,910 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 93 [2019-08-05 11:14:07,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:07,911 INFO L225 Difference]: With dead ends: 209 [2019-08-05 11:14:07,912 INFO L226 Difference]: Without dead ends: 209 [2019-08-05 11:14:07,912 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=166, Invalid=764, Unknown=0, NotChecked=0, Total=930 [2019-08-05 11:14:07,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-08-05 11:14:07,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 121. [2019-08-05 11:14:07,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-08-05 11:14:07,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 138 transitions. [2019-08-05 11:14:07,917 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 138 transitions. Word has length 93 [2019-08-05 11:14:07,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:07,917 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 138 transitions. [2019-08-05 11:14:07,917 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 11:14:07,917 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 138 transitions. [2019-08-05 11:14:07,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:14:07,918 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:07,918 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1] [2019-08-05 11:14:07,918 INFO L418 AbstractCegarLoop]: === Iteration 151 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:07,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:07,919 INFO L82 PathProgramCache]: Analyzing trace with hash -194950625, now seen corresponding path program 147 times [2019-08-05 11:14:07,919 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:07,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:07,928 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:14:07,929 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:08,340 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 5 proven. 189 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2019-08-05 11:14:08,340 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:08,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:14:08,341 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:14:08,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:14:08,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=607, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:14:08,341 INFO L87 Difference]: Start difference. First operand 121 states and 138 transitions. Second operand 27 states. [2019-08-05 11:14:08,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:08,756 INFO L93 Difference]: Finished difference Result 229 states and 265 transitions. [2019-08-05 11:14:08,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:14:08,756 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:14:08,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:08,758 INFO L225 Difference]: With dead ends: 229 [2019-08-05 11:14:08,758 INFO L226 Difference]: Without dead ends: 229 [2019-08-05 11:14:08,758 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=239, Invalid=1483, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 11:14:08,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2019-08-05 11:14:08,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 113. [2019-08-05 11:14:08,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-08-05 11:14:08,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 129 transitions. [2019-08-05 11:14:08,763 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 129 transitions. Word has length 93 [2019-08-05 11:14:08,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:08,763 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 129 transitions. [2019-08-05 11:14:08,763 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:14:08,764 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 129 transitions. [2019-08-05 11:14:08,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:14:08,764 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:08,764 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1] [2019-08-05 11:14:08,764 INFO L418 AbstractCegarLoop]: === Iteration 152 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:08,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:08,764 INFO L82 PathProgramCache]: Analyzing trace with hash -678330465, now seen corresponding path program 148 times [2019-08-05 11:14:08,765 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:08,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:08,771 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:14:08,772 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:08,996 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 6 proven. 191 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2019-08-05 11:14:08,996 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:08,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:14:08,997 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:14:08,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:14:08,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=605, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:14:08,997 INFO L87 Difference]: Start difference. First operand 113 states and 129 transitions. Second operand 27 states. [2019-08-05 11:14:09,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:09,362 INFO L93 Difference]: Finished difference Result 217 states and 250 transitions. [2019-08-05 11:14:09,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:14:09,362 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:14:09,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:09,364 INFO L225 Difference]: With dead ends: 217 [2019-08-05 11:14:09,364 INFO L226 Difference]: Without dead ends: 217 [2019-08-05 11:14:09,364 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=217, Invalid=1265, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 11:14:09,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-08-05 11:14:09,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 117. [2019-08-05 11:14:09,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-08-05 11:14:09,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 134 transitions. [2019-08-05 11:14:09,367 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 134 transitions. Word has length 93 [2019-08-05 11:14:09,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:09,367 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 134 transitions. [2019-08-05 11:14:09,367 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:14:09,368 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 134 transitions. [2019-08-05 11:14:09,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:14:09,368 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:09,368 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 9, 9, 9, 9, 9, 9, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:14:09,368 INFO L418 AbstractCegarLoop]: === Iteration 153 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:09,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:09,368 INFO L82 PathProgramCache]: Analyzing trace with hash -24681828, now seen corresponding path program 149 times [2019-08-05 11:14:09,369 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:09,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:09,374 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 11:14:09,375 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:10,302 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 0 proven. 214 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2019-08-05 11:14:10,303 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:10,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 11:14:10,303 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 11:14:10,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 11:14:10,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=519, Unknown=0, NotChecked=0, Total=650 [2019-08-05 11:14:10,304 INFO L87 Difference]: Start difference. First operand 117 states and 134 transitions. Second operand 26 states. [2019-08-05 11:14:11,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:11,432 INFO L93 Difference]: Finished difference Result 205 states and 237 transitions. [2019-08-05 11:14:11,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 11:14:11,433 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 93 [2019-08-05 11:14:11,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:11,434 INFO L225 Difference]: With dead ends: 205 [2019-08-05 11:14:11,434 INFO L226 Difference]: Without dead ends: 205 [2019-08-05 11:14:11,434 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=248, Invalid=942, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 11:14:11,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-08-05 11:14:11,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 141. [2019-08-05 11:14:11,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-08-05 11:14:11,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 164 transitions. [2019-08-05 11:14:11,438 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 164 transitions. Word has length 93 [2019-08-05 11:14:11,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:11,438 INFO L475 AbstractCegarLoop]: Abstraction has 141 states and 164 transitions. [2019-08-05 11:14:11,438 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 11:14:11,438 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 164 transitions. [2019-08-05 11:14:11,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:14:11,439 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:11,439 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:14:11,439 INFO L418 AbstractCegarLoop]: === Iteration 154 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:11,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:11,439 INFO L82 PathProgramCache]: Analyzing trace with hash -1015719139, now seen corresponding path program 150 times [2019-08-05 11:14:11,440 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:11,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:11,446 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 11:14:11,447 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:11,664 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 1 proven. 200 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2019-08-05 11:14:11,664 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:11,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 11:14:11,665 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 11:14:11,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 11:14:11,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=545, Unknown=0, NotChecked=0, Total=650 [2019-08-05 11:14:11,665 INFO L87 Difference]: Start difference. First operand 141 states and 164 transitions. Second operand 26 states. [2019-08-05 11:14:12,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:12,021 INFO L93 Difference]: Finished difference Result 237 states and 272 transitions. [2019-08-05 11:14:12,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 11:14:12,022 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 93 [2019-08-05 11:14:12,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:12,023 INFO L225 Difference]: With dead ends: 237 [2019-08-05 11:14:12,023 INFO L226 Difference]: Without dead ends: 237 [2019-08-05 11:14:12,023 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=262, Invalid=1298, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 11:14:12,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2019-08-05 11:14:12,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 137. [2019-08-05 11:14:12,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-08-05 11:14:12,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 159 transitions. [2019-08-05 11:14:12,028 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 159 transitions. Word has length 93 [2019-08-05 11:14:12,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:12,028 INFO L475 AbstractCegarLoop]: Abstraction has 137 states and 159 transitions. [2019-08-05 11:14:12,028 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 11:14:12,029 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 159 transitions. [2019-08-05 11:14:12,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:14:12,029 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:12,029 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1] [2019-08-05 11:14:12,030 INFO L418 AbstractCegarLoop]: === Iteration 155 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:12,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:12,030 INFO L82 PathProgramCache]: Analyzing trace with hash 1707734303, now seen corresponding path program 151 times [2019-08-05 11:14:12,031 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:12,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:12,039 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:14:12,040 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:12,727 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 7 proven. 187 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2019-08-05 11:14:12,728 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:12,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:14:12,728 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:14:12,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:14:12,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=607, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:14:12,729 INFO L87 Difference]: Start difference. First operand 137 states and 159 transitions. Second operand 27 states. [2019-08-05 11:14:13,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:13,175 INFO L93 Difference]: Finished difference Result 233 states and 270 transitions. [2019-08-05 11:14:13,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:14:13,176 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:14:13,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:13,177 INFO L225 Difference]: With dead ends: 233 [2019-08-05 11:14:13,177 INFO L226 Difference]: Without dead ends: 233 [2019-08-05 11:14:13,178 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=235, Invalid=1487, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 11:14:13,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2019-08-05 11:14:13,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 141. [2019-08-05 11:14:13,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-08-05 11:14:13,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 164 transitions. [2019-08-05 11:14:13,181 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 164 transitions. Word has length 93 [2019-08-05 11:14:13,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:13,181 INFO L475 AbstractCegarLoop]: Abstraction has 141 states and 164 transitions. [2019-08-05 11:14:13,181 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:14:13,182 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 164 transitions. [2019-08-05 11:14:13,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:14:13,182 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:13,182 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 7, 7, 7, 7, 7, 7, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:14:13,182 INFO L418 AbstractCegarLoop]: === Iteration 156 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:13,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:13,183 INFO L82 PathProgramCache]: Analyzing trace with hash -1596195682, now seen corresponding path program 152 times [2019-08-05 11:14:13,183 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:13,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:13,191 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:14:13,192 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:13,421 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 6 proven. 193 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2019-08-05 11:14:13,422 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:13,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:14:13,422 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:14:13,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:14:13,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=602, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:14:13,423 INFO L87 Difference]: Start difference. First operand 141 states and 164 transitions. Second operand 27 states. [2019-08-05 11:14:13,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:13,820 INFO L93 Difference]: Finished difference Result 241 states and 283 transitions. [2019-08-05 11:14:13,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:14:13,820 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:14:13,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:13,822 INFO L225 Difference]: With dead ends: 241 [2019-08-05 11:14:13,822 INFO L226 Difference]: Without dead ends: 241 [2019-08-05 11:14:13,822 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=225, Invalid=1257, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 11:14:13,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2019-08-05 11:14:13,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 125. [2019-08-05 11:14:13,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-08-05 11:14:13,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 145 transitions. [2019-08-05 11:14:13,826 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 145 transitions. Word has length 93 [2019-08-05 11:14:13,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:13,826 INFO L475 AbstractCegarLoop]: Abstraction has 125 states and 145 transitions. [2019-08-05 11:14:13,826 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:14:13,826 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 145 transitions. [2019-08-05 11:14:13,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:14:13,827 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:13,827 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1] [2019-08-05 11:14:13,827 INFO L418 AbstractCegarLoop]: === Iteration 157 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:13,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:13,827 INFO L82 PathProgramCache]: Analyzing trace with hash -1596902113, now seen corresponding path program 153 times [2019-08-05 11:14:13,828 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:13,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:13,833 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:14:13,834 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:14,058 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 8 proven. 189 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2019-08-05 11:14:14,059 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:14,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:14:14,059 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:14:14,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:14:14,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=605, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:14:14,060 INFO L87 Difference]: Start difference. First operand 125 states and 145 transitions. Second operand 27 states. [2019-08-05 11:14:14,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:14,461 INFO L93 Difference]: Finished difference Result 221 states and 256 transitions. [2019-08-05 11:14:14,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:14:14,462 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:14:14,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:14,463 INFO L225 Difference]: With dead ends: 221 [2019-08-05 11:14:14,463 INFO L226 Difference]: Without dead ends: 221 [2019-08-05 11:14:14,464 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=231, Invalid=1409, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:14:14,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2019-08-05 11:14:14,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 137. [2019-08-05 11:14:14,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-08-05 11:14:14,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 159 transitions. [2019-08-05 11:14:14,467 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 159 transitions. Word has length 93 [2019-08-05 11:14:14,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:14,468 INFO L475 AbstractCegarLoop]: Abstraction has 137 states and 159 transitions. [2019-08-05 11:14:14,468 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:14:14,468 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 159 transitions. [2019-08-05 11:14:14,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:14:14,468 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:14,468 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1] [2019-08-05 11:14:14,469 INFO L418 AbstractCegarLoop]: === Iteration 158 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:14,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:14,469 INFO L82 PathProgramCache]: Analyzing trace with hash 789162655, now seen corresponding path program 154 times [2019-08-05 11:14:14,469 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:14,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:14,475 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:14:14,476 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:15,297 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 10 proven. 187 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2019-08-05 11:14:15,297 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:15,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:14:15,297 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:14:15,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:14:15,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=605, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:14:15,298 INFO L87 Difference]: Start difference. First operand 137 states and 159 transitions. Second operand 27 states. [2019-08-05 11:14:15,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:15,724 INFO L93 Difference]: Finished difference Result 209 states and 242 transitions. [2019-08-05 11:14:15,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:14:15,725 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:14:15,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:15,726 INFO L225 Difference]: With dead ends: 209 [2019-08-05 11:14:15,726 INFO L226 Difference]: Without dead ends: 209 [2019-08-05 11:14:15,726 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=239, Invalid=1483, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 11:14:15,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-08-05 11:14:15,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 141. [2019-08-05 11:14:15,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-08-05 11:14:15,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 164 transitions. [2019-08-05 11:14:15,730 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 164 transitions. Word has length 93 [2019-08-05 11:14:15,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:15,730 INFO L475 AbstractCegarLoop]: Abstraction has 141 states and 164 transitions. [2019-08-05 11:14:15,730 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:14:15,731 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 164 transitions. [2019-08-05 11:14:15,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:14:15,731 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:15,731 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:14:15,732 INFO L418 AbstractCegarLoop]: === Iteration 159 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:15,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:15,732 INFO L82 PathProgramCache]: Analyzing trace with hash 893183389, now seen corresponding path program 155 times [2019-08-05 11:14:15,732 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:15,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:15,742 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:14:15,743 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:16,258 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 2 proven. 206 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2019-08-05 11:14:16,259 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:16,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:14:16,259 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:14:16,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:14:16,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=583, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:14:16,259 INFO L87 Difference]: Start difference. First operand 141 states and 164 transitions. Second operand 27 states. [2019-08-05 11:14:16,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:16,612 INFO L93 Difference]: Finished difference Result 245 states and 284 transitions. [2019-08-05 11:14:16,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:14:16,613 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:14:16,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:16,614 INFO L225 Difference]: With dead ends: 245 [2019-08-05 11:14:16,614 INFO L226 Difference]: Without dead ends: 245 [2019-08-05 11:14:16,615 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=244, Invalid=1162, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 11:14:16,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2019-08-05 11:14:16,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 137. [2019-08-05 11:14:16,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-08-05 11:14:16,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 159 transitions. [2019-08-05 11:14:16,619 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 159 transitions. Word has length 93 [2019-08-05 11:14:16,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:16,619 INFO L475 AbstractCegarLoop]: Abstraction has 137 states and 159 transitions. [2019-08-05 11:14:16,620 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:14:16,620 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 159 transitions. [2019-08-05 11:14:16,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:14:16,620 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:16,620 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 7, 7, 7, 7, 7, 7, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:14:16,621 INFO L418 AbstractCegarLoop]: === Iteration 160 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:16,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:16,621 INFO L82 PathProgramCache]: Analyzing trace with hash 1780199966, now seen corresponding path program 156 times [2019-08-05 11:14:16,621 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:16,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:16,629 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:14:16,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:16,902 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 9 proven. 193 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2019-08-05 11:14:16,902 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:16,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:14:16,903 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:14:16,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:14:16,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=593, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:14:16,903 INFO L87 Difference]: Start difference. First operand 137 states and 159 transitions. Second operand 27 states. [2019-08-05 11:14:17,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:17,287 INFO L93 Difference]: Finished difference Result 213 states and 249 transitions. [2019-08-05 11:14:17,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:14:17,288 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:14:17,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:17,289 INFO L225 Difference]: With dead ends: 213 [2019-08-05 11:14:17,289 INFO L226 Difference]: Without dead ends: 213 [2019-08-05 11:14:17,290 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=228, Invalid=1178, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 11:14:17,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-08-05 11:14:17,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 125. [2019-08-05 11:14:17,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-08-05 11:14:17,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 145 transitions. [2019-08-05 11:14:17,295 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 145 transitions. Word has length 93 [2019-08-05 11:14:17,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:17,295 INFO L475 AbstractCegarLoop]: Abstraction has 125 states and 145 transitions. [2019-08-05 11:14:17,295 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:14:17,296 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 145 transitions. [2019-08-05 11:14:17,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:14:17,296 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:17,296 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:14:17,297 INFO L418 AbstractCegarLoop]: === Iteration 161 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:17,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:17,297 INFO L82 PathProgramCache]: Analyzing trace with hash 1376563229, now seen corresponding path program 157 times [2019-08-05 11:14:17,298 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:17,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:17,307 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:14:17,309 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:17,862 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 3 proven. 205 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2019-08-05 11:14:17,862 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:17,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:14:17,863 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:14:17,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:14:17,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=583, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:14:17,863 INFO L87 Difference]: Start difference. First operand 125 states and 145 transitions. Second operand 27 states. [2019-08-05 11:14:18,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:18,186 INFO L93 Difference]: Finished difference Result 237 states and 276 transitions. [2019-08-05 11:14:18,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:14:18,186 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:14:18,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:18,188 INFO L225 Difference]: With dead ends: 237 [2019-08-05 11:14:18,188 INFO L226 Difference]: Without dead ends: 237 [2019-08-05 11:14:18,188 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=244, Invalid=1162, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 11:14:18,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2019-08-05 11:14:18,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 133. [2019-08-05 11:14:18,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-08-05 11:14:18,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 154 transitions. [2019-08-05 11:14:18,192 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 154 transitions. Word has length 93 [2019-08-05 11:14:18,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:18,192 INFO L475 AbstractCegarLoop]: Abstraction has 133 states and 154 transitions. [2019-08-05 11:14:18,192 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:14:18,192 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 154 transitions. [2019-08-05 11:14:18,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:14:18,193 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:18,193 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1] [2019-08-05 11:14:18,193 INFO L418 AbstractCegarLoop]: === Iteration 162 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:18,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:18,193 INFO L82 PathProgramCache]: Analyzing trace with hash -2137939937, now seen corresponding path program 158 times [2019-08-05 11:14:18,194 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:18,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:18,200 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:14:18,201 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:18,425 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 9 proven. 185 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2019-08-05 11:14:18,425 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:18,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:14:18,426 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:14:18,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:14:18,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=607, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:14:18,426 INFO L87 Difference]: Start difference. First operand 133 states and 154 transitions. Second operand 27 states. [2019-08-05 11:14:18,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:18,792 INFO L93 Difference]: Finished difference Result 233 states and 268 transitions. [2019-08-05 11:14:18,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:14:18,792 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:14:18,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:18,793 INFO L225 Difference]: With dead ends: 233 [2019-08-05 11:14:18,794 INFO L226 Difference]: Without dead ends: 233 [2019-08-05 11:14:18,794 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=229, Invalid=1411, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:14:18,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2019-08-05 11:14:18,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 145. [2019-08-05 11:14:18,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-08-05 11:14:18,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 168 transitions. [2019-08-05 11:14:18,798 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 168 transitions. Word has length 93 [2019-08-05 11:14:18,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:18,798 INFO L475 AbstractCegarLoop]: Abstraction has 145 states and 168 transitions. [2019-08-05 11:14:18,798 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:14:18,798 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 168 transitions. [2019-08-05 11:14:18,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:14:18,798 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:18,798 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 7, 7, 7, 7, 7, 7, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:14:18,799 INFO L418 AbstractCegarLoop]: === Iteration 163 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:18,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:18,799 INFO L82 PathProgramCache]: Analyzing trace with hash -1146902626, now seen corresponding path program 159 times [2019-08-05 11:14:18,799 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:18,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:18,805 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:14:18,806 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:19,021 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 8 proven. 194 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2019-08-05 11:14:19,021 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:19,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:14:19,022 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:14:19,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:14:19,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=593, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:14:19,023 INFO L87 Difference]: Start difference. First operand 145 states and 168 transitions. Second operand 27 states. [2019-08-05 11:14:19,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:19,443 INFO L93 Difference]: Finished difference Result 233 states and 272 transitions. [2019-08-05 11:14:19,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:14:19,444 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:14:19,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:19,445 INFO L225 Difference]: With dead ends: 233 [2019-08-05 11:14:19,445 INFO L226 Difference]: Without dead ends: 233 [2019-08-05 11:14:19,445 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=228, Invalid=1178, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 11:14:19,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2019-08-05 11:14:19,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 137. [2019-08-05 11:14:19,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-08-05 11:14:19,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 159 transitions. [2019-08-05 11:14:19,449 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 159 transitions. Word has length 93 [2019-08-05 11:14:19,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:19,449 INFO L475 AbstractCegarLoop]: Abstraction has 137 states and 159 transitions. [2019-08-05 11:14:19,449 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:14:19,449 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 159 transitions. [2019-08-05 11:14:19,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:14:19,449 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:19,449 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 7, 7, 7, 7, 7, 7, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:14:19,450 INFO L418 AbstractCegarLoop]: === Iteration 164 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:19,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:19,450 INFO L82 PathProgramCache]: Analyzing trace with hash 385525918, now seen corresponding path program 160 times [2019-08-05 11:14:19,450 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:19,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:19,456 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 11:14:19,457 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:19,648 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 2 proven. 190 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2019-08-05 11:14:19,649 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:19,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 11:14:19,649 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 11:14:19,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 11:14:19,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=557, Unknown=0, NotChecked=0, Total=650 [2019-08-05 11:14:19,650 INFO L87 Difference]: Start difference. First operand 137 states and 159 transitions. Second operand 26 states. [2019-08-05 11:14:20,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:20,727 INFO L93 Difference]: Finished difference Result 241 states and 276 transitions. [2019-08-05 11:14:20,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 11:14:20,728 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 93 [2019-08-05 11:14:20,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:20,729 INFO L225 Difference]: With dead ends: 241 [2019-08-05 11:14:20,729 INFO L226 Difference]: Without dead ends: 241 [2019-08-05 11:14:20,729 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=213, Invalid=1119, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 11:14:20,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2019-08-05 11:14:20,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 125. [2019-08-05 11:14:20,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-08-05 11:14:20,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 145 transitions. [2019-08-05 11:14:20,733 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 145 transitions. Word has length 93 [2019-08-05 11:14:20,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:20,733 INFO L475 AbstractCegarLoop]: Abstraction has 125 states and 145 transitions. [2019-08-05 11:14:20,733 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 11:14:20,733 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 145 transitions. [2019-08-05 11:14:20,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:14:20,733 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:20,734 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:14:20,734 INFO L418 AbstractCegarLoop]: === Iteration 165 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:20,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:20,734 INFO L82 PathProgramCache]: Analyzing trace with hash 8698525, now seen corresponding path program 161 times [2019-08-05 11:14:20,734 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:20,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:20,742 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:14:20,743 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:20,955 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 4 proven. 204 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2019-08-05 11:14:20,955 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:20,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:14:20,956 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:14:20,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:14:20,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=583, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:14:20,956 INFO L87 Difference]: Start difference. First operand 125 states and 145 transitions. Second operand 27 states. [2019-08-05 11:14:21,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:21,313 INFO L93 Difference]: Finished difference Result 237 states and 277 transitions. [2019-08-05 11:14:21,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:14:21,314 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:14:21,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:21,315 INFO L225 Difference]: With dead ends: 237 [2019-08-05 11:14:21,315 INFO L226 Difference]: Without dead ends: 237 [2019-08-05 11:14:21,316 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=244, Invalid=1162, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 11:14:21,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2019-08-05 11:14:21,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 137. [2019-08-05 11:14:21,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-08-05 11:14:21,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 159 transitions. [2019-08-05 11:14:21,320 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 159 transitions. Word has length 93 [2019-08-05 11:14:21,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:21,320 INFO L475 AbstractCegarLoop]: Abstraction has 137 states and 159 transitions. [2019-08-05 11:14:21,320 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:14:21,320 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 159 transitions. [2019-08-05 11:14:21,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:14:21,320 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:21,321 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 7, 7, 7, 7, 7, 7, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:14:21,321 INFO L418 AbstractCegarLoop]: === Iteration 166 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:21,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:21,321 INFO L82 PathProgramCache]: Analyzing trace with hash -982338786, now seen corresponding path program 162 times [2019-08-05 11:14:21,321 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:21,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:21,327 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:14:21,328 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:21,541 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 5 proven. 194 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2019-08-05 11:14:21,541 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:21,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:14:21,542 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:14:21,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:14:21,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=602, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:14:21,542 INFO L87 Difference]: Start difference. First operand 137 states and 159 transitions. Second operand 27 states. [2019-08-05 11:14:21,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:21,960 INFO L93 Difference]: Finished difference Result 229 states and 264 transitions. [2019-08-05 11:14:21,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:14:21,961 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:14:21,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:21,962 INFO L225 Difference]: With dead ends: 229 [2019-08-05 11:14:21,962 INFO L226 Difference]: Without dead ends: 229 [2019-08-05 11:14:21,963 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=258, Invalid=1548, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 11:14:21,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2019-08-05 11:14:21,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 133. [2019-08-05 11:14:21,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-08-05 11:14:21,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 154 transitions. [2019-08-05 11:14:21,967 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 154 transitions. Word has length 93 [2019-08-05 11:14:21,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:21,968 INFO L475 AbstractCegarLoop]: Abstraction has 133 states and 154 transitions. [2019-08-05 11:14:21,968 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:14:21,968 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 154 transitions. [2019-08-05 11:14:21,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:14:21,968 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:21,969 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 7, 7, 7, 7, 7, 7, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:14:21,969 INFO L418 AbstractCegarLoop]: === Iteration 167 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:21,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:21,969 INFO L82 PathProgramCache]: Analyzing trace with hash 926563742, now seen corresponding path program 163 times [2019-08-05 11:14:21,970 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:21,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:21,978 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:14:21,979 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:22,374 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 3 proven. 196 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2019-08-05 11:14:22,375 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:22,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:14:22,375 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:14:22,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:14:22,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=602, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:14:22,376 INFO L87 Difference]: Start difference. First operand 133 states and 154 transitions. Second operand 27 states. [2019-08-05 11:14:22,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:22,999 INFO L93 Difference]: Finished difference Result 241 states and 278 transitions. [2019-08-05 11:14:22,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:14:23,000 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:14:23,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:23,001 INFO L225 Difference]: With dead ends: 241 [2019-08-05 11:14:23,001 INFO L226 Difference]: Without dead ends: 241 [2019-08-05 11:14:23,001 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=249, Invalid=1473, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 11:14:23,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2019-08-05 11:14:23,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 121. [2019-08-05 11:14:23,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-08-05 11:14:23,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 140 transitions. [2019-08-05 11:14:23,005 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 140 transitions. Word has length 93 [2019-08-05 11:14:23,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:23,006 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 140 transitions. [2019-08-05 11:14:23,006 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:14:23,006 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 140 transitions. [2019-08-05 11:14:23,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:14:23,006 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:23,006 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 7, 7, 7, 7, 7, 7, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:14:23,006 INFO L418 AbstractCegarLoop]: === Iteration 168 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:23,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:23,007 INFO L82 PathProgramCache]: Analyzing trace with hash -1630282466, now seen corresponding path program 164 times [2019-08-05 11:14:23,007 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:23,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:23,014 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:14:23,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:23,232 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 7 proven. 195 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2019-08-05 11:14:23,233 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:23,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:14:23,233 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:14:23,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:14:23,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=593, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:14:23,233 INFO L87 Difference]: Start difference. First operand 121 states and 140 transitions. Second operand 27 states. [2019-08-05 11:14:23,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:23,561 INFO L93 Difference]: Finished difference Result 221 states and 257 transitions. [2019-08-05 11:14:23,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:14:23,562 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:14:23,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:23,563 INFO L225 Difference]: With dead ends: 221 [2019-08-05 11:14:23,563 INFO L226 Difference]: Without dead ends: 221 [2019-08-05 11:14:23,563 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=228, Invalid=1178, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 11:14:23,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2019-08-05 11:14:23,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 125. [2019-08-05 11:14:23,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-08-05 11:14:23,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 145 transitions. [2019-08-05 11:14:23,568 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 145 transitions. Word has length 93 [2019-08-05 11:14:23,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:23,568 INFO L475 AbstractCegarLoop]: Abstraction has 125 states and 145 transitions. [2019-08-05 11:14:23,568 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:14:23,568 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 145 transitions. [2019-08-05 11:14:23,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:14:23,568 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:23,568 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:14:23,569 INFO L418 AbstractCegarLoop]: === Iteration 169 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:23,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:23,569 INFO L82 PathProgramCache]: Analyzing trace with hash 927270173, now seen corresponding path program 165 times [2019-08-05 11:14:23,569 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:23,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:23,575 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:14:23,576 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:23,779 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 5 proven. 203 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2019-08-05 11:14:23,779 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:23,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:14:23,779 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:14:23,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:14:23,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=583, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:14:23,780 INFO L87 Difference]: Start difference. First operand 125 states and 145 transitions. Second operand 27 states. [2019-08-05 11:14:24,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:24,161 INFO L93 Difference]: Finished difference Result 229 states and 268 transitions. [2019-08-05 11:14:24,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:14:24,162 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:14:24,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:24,163 INFO L225 Difference]: With dead ends: 229 [2019-08-05 11:14:24,163 INFO L226 Difference]: Without dead ends: 229 [2019-08-05 11:14:24,163 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=244, Invalid=1162, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 11:14:24,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2019-08-05 11:14:24,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 141. [2019-08-05 11:14:24,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-08-05 11:14:24,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 164 transitions. [2019-08-05 11:14:24,172 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 164 transitions. Word has length 93 [2019-08-05 11:14:24,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:24,172 INFO L475 AbstractCegarLoop]: Abstraction has 141 states and 164 transitions. [2019-08-05 11:14:24,172 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:14:24,172 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 164 transitions. [2019-08-05 11:14:24,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:14:24,173 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:24,173 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 7, 7, 7, 7, 7, 7, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:14:24,173 INFO L418 AbstractCegarLoop]: === Iteration 170 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:24,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:24,173 INFO L82 PathProgramCache]: Analyzing trace with hash -63767138, now seen corresponding path program 166 times [2019-08-05 11:14:24,174 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:24,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:24,180 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:14:24,181 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:24,385 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 6 proven. 193 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2019-08-05 11:14:24,385 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:24,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:14:24,386 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:14:24,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:14:24,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=602, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:14:24,386 INFO L87 Difference]: Start difference. First operand 141 states and 164 transitions. Second operand 27 states. [2019-08-05 11:14:24,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:24,792 INFO L93 Difference]: Finished difference Result 229 states and 265 transitions. [2019-08-05 11:14:24,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:14:24,793 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:14:24,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:24,794 INFO L225 Difference]: With dead ends: 229 [2019-08-05 11:14:24,794 INFO L226 Difference]: Without dead ends: 229 [2019-08-05 11:14:24,794 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=258, Invalid=1548, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 11:14:24,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2019-08-05 11:14:24,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 137. [2019-08-05 11:14:24,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-08-05 11:14:24,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 159 transitions. [2019-08-05 11:14:24,798 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 159 transitions. Word has length 93 [2019-08-05 11:14:24,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:24,798 INFO L475 AbstractCegarLoop]: Abstraction has 137 states and 159 transitions. [2019-08-05 11:14:24,798 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:14:24,798 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 159 transitions. [2019-08-05 11:14:24,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:14:24,799 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:24,799 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 7, 7, 7, 7, 7, 7, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:14:24,799 INFO L418 AbstractCegarLoop]: === Iteration 171 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:24,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:24,799 INFO L82 PathProgramCache]: Analyzing trace with hash 1845135390, now seen corresponding path program 167 times [2019-08-05 11:14:24,800 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:24,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:24,808 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:14:24,809 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:25,046 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 5 proven. 197 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2019-08-05 11:14:25,046 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:25,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:14:25,047 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:14:25,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:14:25,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=593, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:14:25,053 INFO L87 Difference]: Start difference. First operand 137 states and 159 transitions. Second operand 27 states. [2019-08-05 11:14:25,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:25,397 INFO L93 Difference]: Finished difference Result 217 states and 252 transitions. [2019-08-05 11:14:25,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:14:25,398 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:14:25,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:25,399 INFO L225 Difference]: With dead ends: 217 [2019-08-05 11:14:25,399 INFO L226 Difference]: Without dead ends: 217 [2019-08-05 11:14:25,399 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=228, Invalid=1178, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 11:14:25,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-08-05 11:14:25,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 133. [2019-08-05 11:14:25,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-08-05 11:14:25,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 154 transitions. [2019-08-05 11:14:25,403 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 154 transitions. Word has length 93 [2019-08-05 11:14:25,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:25,403 INFO L475 AbstractCegarLoop]: Abstraction has 133 states and 154 transitions. [2019-08-05 11:14:25,403 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:14:25,403 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 154 transitions. [2019-08-05 11:14:25,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:14:25,403 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:25,404 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 7, 7, 7, 7, 7, 7, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:14:25,404 INFO L418 AbstractCegarLoop]: === Iteration 172 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:25,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:25,404 INFO L82 PathProgramCache]: Analyzing trace with hash 755782302, now seen corresponding path program 168 times [2019-08-05 11:14:25,404 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:25,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:25,411 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:14:25,412 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:25,618 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 8 proven. 191 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2019-08-05 11:14:25,619 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:25,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:14:25,619 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:14:25,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:14:25,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=602, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:14:25,619 INFO L87 Difference]: Start difference. First operand 133 states and 154 transitions. Second operand 27 states. [2019-08-05 11:14:26,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:26,064 INFO L93 Difference]: Finished difference Result 233 states and 269 transitions. [2019-08-05 11:14:26,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:14:26,065 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:14:26,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:26,066 INFO L225 Difference]: With dead ends: 233 [2019-08-05 11:14:26,066 INFO L226 Difference]: Without dead ends: 233 [2019-08-05 11:14:26,066 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=258, Invalid=1548, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 11:14:26,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2019-08-05 11:14:26,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 137. [2019-08-05 11:14:26,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-08-05 11:14:26,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 159 transitions. [2019-08-05 11:14:26,070 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 159 transitions. Word has length 93 [2019-08-05 11:14:26,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:26,070 INFO L475 AbstractCegarLoop]: Abstraction has 137 states and 159 transitions. [2019-08-05 11:14:26,070 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:14:26,070 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 159 transitions. [2019-08-05 11:14:26,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:14:26,071 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:26,071 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 7, 7, 7, 7, 7, 7, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:14:26,071 INFO L418 AbstractCegarLoop]: === Iteration 173 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:26,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:26,071 INFO L82 PathProgramCache]: Analyzing trace with hash -1966452066, now seen corresponding path program 169 times [2019-08-05 11:14:26,072 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:26,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:26,079 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:14:26,080 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:26,342 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 4 proven. 195 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2019-08-05 11:14:26,342 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:26,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:14:26,342 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:14:26,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:14:26,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=602, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:14:26,343 INFO L87 Difference]: Start difference. First operand 137 states and 159 transitions. Second operand 27 states. [2019-08-05 11:14:26,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:26,743 INFO L93 Difference]: Finished difference Result 237 states and 276 transitions. [2019-08-05 11:14:26,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:14:26,744 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:14:26,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:26,745 INFO L225 Difference]: With dead ends: 237 [2019-08-05 11:14:26,745 INFO L226 Difference]: Without dead ends: 237 [2019-08-05 11:14:26,746 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=241, Invalid=1399, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:14:26,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2019-08-05 11:14:26,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 145. [2019-08-05 11:14:26,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-08-05 11:14:26,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 168 transitions. [2019-08-05 11:14:26,749 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 168 transitions. Word has length 93 [2019-08-05 11:14:26,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:26,749 INFO L475 AbstractCegarLoop]: Abstraction has 145 states and 168 transitions. [2019-08-05 11:14:26,749 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:14:26,749 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 168 transitions. [2019-08-05 11:14:26,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:14:26,750 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:26,750 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:14:26,750 INFO L418 AbstractCegarLoop]: === Iteration 174 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:26,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:26,750 INFO L82 PathProgramCache]: Analyzing trace with hash 1746819613, now seen corresponding path program 170 times [2019-08-05 11:14:26,751 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:26,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:26,757 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:14:26,758 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:26,978 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 7 proven. 201 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2019-08-05 11:14:26,978 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:26,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:14:26,979 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:14:26,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:14:26,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=583, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:14:26,979 INFO L87 Difference]: Start difference. First operand 145 states and 168 transitions. Second operand 27 states. [2019-08-05 11:14:27,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:27,316 INFO L93 Difference]: Finished difference Result 225 states and 262 transitions. [2019-08-05 11:14:27,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:14:27,316 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:14:27,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:27,317 INFO L225 Difference]: With dead ends: 225 [2019-08-05 11:14:27,318 INFO L226 Difference]: Without dead ends: 225 [2019-08-05 11:14:27,318 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=244, Invalid=1162, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 11:14:27,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2019-08-05 11:14:27,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 121. [2019-08-05 11:14:27,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-08-05 11:14:27,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 139 transitions. [2019-08-05 11:14:27,321 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 139 transitions. Word has length 93 [2019-08-05 11:14:27,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:27,321 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 139 transitions. [2019-08-05 11:14:27,321 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:14:27,321 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 139 transitions. [2019-08-05 11:14:27,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:14:27,322 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:27,322 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1] [2019-08-05 11:14:27,322 INFO L418 AbstractCegarLoop]: === Iteration 175 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:27,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:27,322 INFO L82 PathProgramCache]: Analyzing trace with hash 899705503, now seen corresponding path program 171 times [2019-08-05 11:14:27,323 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:27,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:27,328 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:14:27,329 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:27,604 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 4 proven. 190 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2019-08-05 11:14:27,604 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:27,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:14:27,604 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:14:27,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:14:27,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=607, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:14:27,605 INFO L87 Difference]: Start difference. First operand 121 states and 139 transitions. Second operand 27 states. [2019-08-05 11:14:28,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:28,217 INFO L93 Difference]: Finished difference Result 225 states and 259 transitions. [2019-08-05 11:14:28,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:14:28,218 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:14:28,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:28,219 INFO L225 Difference]: With dead ends: 225 [2019-08-05 11:14:28,219 INFO L226 Difference]: Without dead ends: 225 [2019-08-05 11:14:28,219 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=245, Invalid=1561, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 11:14:28,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2019-08-05 11:14:28,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 137. [2019-08-05 11:14:28,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-08-05 11:14:28,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 157 transitions. [2019-08-05 11:14:28,223 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 157 transitions. Word has length 93 [2019-08-05 11:14:28,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:28,223 INFO L475 AbstractCegarLoop]: Abstraction has 137 states and 157 transitions. [2019-08-05 11:14:28,223 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:14:28,224 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 157 transitions. [2019-08-05 11:14:28,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:14:28,224 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:28,224 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1] [2019-08-05 11:14:28,225 INFO L418 AbstractCegarLoop]: === Iteration 176 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:28,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:28,225 INFO L82 PathProgramCache]: Analyzing trace with hash 1337477919, now seen corresponding path program 172 times [2019-08-05 11:14:28,225 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:28,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:28,233 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 11:14:28,234 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:28,454 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 3 proven. 184 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2019-08-05 11:14:28,454 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:28,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 11:14:28,455 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 11:14:28,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 11:14:28,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=555, Unknown=0, NotChecked=0, Total=650 [2019-08-05 11:14:28,455 INFO L87 Difference]: Start difference. First operand 137 states and 157 transitions. Second operand 26 states. [2019-08-05 11:14:28,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:28,714 INFO L93 Difference]: Finished difference Result 225 states and 256 transitions. [2019-08-05 11:14:28,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 11:14:28,714 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 93 [2019-08-05 11:14:28,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:28,715 INFO L225 Difference]: With dead ends: 225 [2019-08-05 11:14:28,716 INFO L226 Difference]: Without dead ends: 225 [2019-08-05 11:14:28,716 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=181, Invalid=941, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 11:14:28,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2019-08-05 11:14:28,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 117. [2019-08-05 11:14:28,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-08-05 11:14:28,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 134 transitions. [2019-08-05 11:14:28,720 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 134 transitions. Word has length 93 [2019-08-05 11:14:28,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:28,720 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 134 transitions. [2019-08-05 11:14:28,720 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 11:14:28,720 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 134 transitions. [2019-08-05 11:14:28,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:14:28,720 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:28,720 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1] [2019-08-05 11:14:28,721 INFO L418 AbstractCegarLoop]: === Iteration 177 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:28,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:28,721 INFO L82 PathProgramCache]: Analyzing trace with hash -1009197025, now seen corresponding path program 173 times [2019-08-05 11:14:28,721 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:28,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:28,729 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:14:28,730 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:28,954 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 6 proven. 188 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2019-08-05 11:14:28,955 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:28,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:14:28,955 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:14:28,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:14:28,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=607, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:14:28,955 INFO L87 Difference]: Start difference. First operand 117 states and 134 transitions. Second operand 27 states. [2019-08-05 11:14:29,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:29,366 INFO L93 Difference]: Finished difference Result 201 states and 230 transitions. [2019-08-05 11:14:29,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:14:29,367 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:14:29,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:29,368 INFO L225 Difference]: With dead ends: 201 [2019-08-05 11:14:29,368 INFO L226 Difference]: Without dead ends: 201 [2019-08-05 11:14:29,368 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=235, Invalid=1487, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 11:14:29,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-08-05 11:14:29,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 121. [2019-08-05 11:14:29,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-08-05 11:14:29,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 139 transitions. [2019-08-05 11:14:29,372 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 139 transitions. Word has length 93 [2019-08-05 11:14:29,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:29,372 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 139 transitions. [2019-08-05 11:14:29,372 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:14:29,372 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 139 transitions. [2019-08-05 11:14:29,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:14:29,372 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:29,373 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 7, 7, 7, 7, 7, 7, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:14:29,373 INFO L418 AbstractCegarLoop]: === Iteration 178 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:29,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:29,373 INFO L82 PathProgramCache]: Analyzing trace with hash -18159714, now seen corresponding path program 174 times [2019-08-05 11:14:29,373 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:29,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:29,380 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:14:29,382 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:29,603 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 5 proven. 194 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2019-08-05 11:14:29,604 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:29,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:14:29,604 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:14:29,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:14:29,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=602, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:14:29,604 INFO L87 Difference]: Start difference. First operand 121 states and 139 transitions. Second operand 27 states. [2019-08-05 11:14:30,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:30,038 INFO L93 Difference]: Finished difference Result 201 states and 234 transitions. [2019-08-05 11:14:30,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:14:30,038 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:14:30,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:30,039 INFO L225 Difference]: With dead ends: 201 [2019-08-05 11:14:30,039 INFO L226 Difference]: Without dead ends: 201 [2019-08-05 11:14:30,039 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=233, Invalid=1327, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 11:14:30,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-08-05 11:14:30,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 109. [2019-08-05 11:14:30,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-08-05 11:14:30,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 125 transitions. [2019-08-05 11:14:30,047 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 125 transitions. Word has length 93 [2019-08-05 11:14:30,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:30,047 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 125 transitions. [2019-08-05 11:14:30,048 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:14:30,048 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 125 transitions. [2019-08-05 11:14:30,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:14:30,048 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:30,048 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:14:30,048 INFO L418 AbstractCegarLoop]: === Iteration 179 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:30,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:30,049 INFO L82 PathProgramCache]: Analyzing trace with hash -51540067, now seen corresponding path program 175 times [2019-08-05 11:14:30,049 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:30,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:30,054 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:14:30,055 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:30,273 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 6 proven. 202 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2019-08-05 11:14:30,273 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:30,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:14:30,274 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:14:30,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:14:30,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=583, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:14:30,274 INFO L87 Difference]: Start difference. First operand 109 states and 125 transitions. Second operand 27 states. [2019-08-05 11:14:30,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:30,611 INFO L93 Difference]: Finished difference Result 189 states and 220 transitions. [2019-08-05 11:14:30,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:14:30,612 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:14:30,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:30,613 INFO L225 Difference]: With dead ends: 189 [2019-08-05 11:14:30,613 INFO L226 Difference]: Without dead ends: 189 [2019-08-05 11:14:30,614 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=244, Invalid=1162, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 11:14:30,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-08-05 11:14:30,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 121. [2019-08-05 11:14:30,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-08-05 11:14:30,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 140 transitions. [2019-08-05 11:14:30,617 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 140 transitions. Word has length 93 [2019-08-05 11:14:30,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:30,617 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 140 transitions. [2019-08-05 11:14:30,617 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:14:30,617 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 140 transitions. [2019-08-05 11:14:30,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:14:30,617 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:30,617 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1] [2019-08-05 11:14:30,618 INFO L418 AbstractCegarLoop]: === Iteration 180 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:30,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:30,618 INFO L82 PathProgramCache]: Analyzing trace with hash 358667679, now seen corresponding path program 176 times [2019-08-05 11:14:30,618 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:30,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:30,624 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:14:30,625 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:30,833 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 8 proven. 186 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2019-08-05 11:14:30,833 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:30,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:14:30,833 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:14:30,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:14:30,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=607, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:14:30,834 INFO L87 Difference]: Start difference. First operand 121 states and 140 transitions. Second operand 27 states. [2019-08-05 11:14:31,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:31,220 INFO L93 Difference]: Finished difference Result 189 states and 217 transitions. [2019-08-05 11:14:31,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:14:31,221 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:14:31,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:31,222 INFO L225 Difference]: With dead ends: 189 [2019-08-05 11:14:31,222 INFO L226 Difference]: Without dead ends: 189 [2019-08-05 11:14:31,222 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=229, Invalid=1411, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:14:31,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-08-05 11:14:31,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 129. [2019-08-05 11:14:31,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-08-05 11:14:31,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 149 transitions. [2019-08-05 11:14:31,226 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 149 transitions. Word has length 93 [2019-08-05 11:14:31,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:31,226 INFO L475 AbstractCegarLoop]: Abstraction has 129 states and 149 transitions. [2019-08-05 11:14:31,226 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:14:31,226 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 149 transitions. [2019-08-05 11:14:31,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:14:31,226 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:31,226 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 7, 7, 7, 7, 7, 7, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:14:31,227 INFO L418 AbstractCegarLoop]: === Iteration 181 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:31,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:31,227 INFO L82 PathProgramCache]: Analyzing trace with hash 1349704990, now seen corresponding path program 177 times [2019-08-05 11:14:31,227 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:31,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:31,233 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:14:31,234 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:31,442 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 7 proven. 195 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2019-08-05 11:14:31,442 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:31,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:14:31,442 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:14:31,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:14:31,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=593, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:14:31,443 INFO L87 Difference]: Start difference. First operand 129 states and 149 transitions. Second operand 27 states. [2019-08-05 11:14:31,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:31,782 INFO L93 Difference]: Finished difference Result 189 states and 220 transitions. [2019-08-05 11:14:31,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:14:31,783 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:14:31,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:31,784 INFO L225 Difference]: With dead ends: 189 [2019-08-05 11:14:31,784 INFO L226 Difference]: Without dead ends: 189 [2019-08-05 11:14:31,784 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=228, Invalid=1178, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 11:14:31,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-08-05 11:14:31,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 121. [2019-08-05 11:14:31,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-08-05 11:14:31,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 140 transitions. [2019-08-05 11:14:31,787 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 140 transitions. Word has length 93 [2019-08-05 11:14:31,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:31,788 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 140 transitions. [2019-08-05 11:14:31,788 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:14:31,788 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 140 transitions. [2019-08-05 11:14:31,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:14:31,788 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:31,788 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 7, 7, 7, 7, 7, 7, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:14:31,788 INFO L418 AbstractCegarLoop]: === Iteration 182 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:31,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:31,789 INFO L82 PathProgramCache]: Analyzing trace with hash -1042577378, now seen corresponding path program 178 times [2019-08-05 11:14:31,789 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:31,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:31,796 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:14:31,798 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:32,033 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 7 proven. 192 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2019-08-05 11:14:32,033 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:32,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:14:32,033 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:14:32,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:14:32,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=602, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:14:32,034 INFO L87 Difference]: Start difference. First operand 121 states and 140 transitions. Second operand 27 states. [2019-08-05 11:14:32,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:32,487 INFO L93 Difference]: Finished difference Result 197 states and 227 transitions. [2019-08-05 11:14:32,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:14:32,487 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:14:32,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:32,488 INFO L225 Difference]: With dead ends: 197 [2019-08-05 11:14:32,489 INFO L226 Difference]: Without dead ends: 197 [2019-08-05 11:14:32,489 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=258, Invalid=1548, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 11:14:32,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-08-05 11:14:32,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 117. [2019-08-05 11:14:32,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-08-05 11:14:32,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 135 transitions. [2019-08-05 11:14:32,493 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 135 transitions. Word has length 93 [2019-08-05 11:14:32,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:32,493 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 135 transitions. [2019-08-05 11:14:32,493 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:14:32,493 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 135 transitions. [2019-08-05 11:14:32,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:14:32,494 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:32,494 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 7, 7, 7, 7, 7, 7, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:14:32,494 INFO L418 AbstractCegarLoop]: === Iteration 183 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:32,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:32,494 INFO L82 PathProgramCache]: Analyzing trace with hash 866325150, now seen corresponding path program 179 times [2019-08-05 11:14:32,495 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:32,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:32,503 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:14:32,504 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:32,865 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 6 proven. 196 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2019-08-05 11:14:32,865 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:32,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:14:32,866 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:14:32,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:14:32,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=593, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:14:32,866 INFO L87 Difference]: Start difference. First operand 117 states and 135 transitions. Second operand 27 states. [2019-08-05 11:14:33,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:33,233 INFO L93 Difference]: Finished difference Result 189 states and 219 transitions. [2019-08-05 11:14:33,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:14:33,233 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:14:33,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:33,234 INFO L225 Difference]: With dead ends: 189 [2019-08-05 11:14:33,234 INFO L226 Difference]: Without dead ends: 189 [2019-08-05 11:14:33,235 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=228, Invalid=1178, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 11:14:33,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-08-05 11:14:33,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 93. [2019-08-05 11:14:33,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-08-05 11:14:33,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 106 transitions. [2019-08-05 11:14:33,238 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 106 transitions. Word has length 93 [2019-08-05 11:14:33,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:33,238 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 106 transitions. [2019-08-05 11:14:33,238 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:14:33,238 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 106 transitions. [2019-08-05 11:14:33,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:14:33,238 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:33,238 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:14:33,239 INFO L418 AbstractCegarLoop]: === Iteration 184 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:33,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:33,239 INFO L82 PathProgramCache]: Analyzing trace with hash 594941467, now seen corresponding path program 180 times [2019-08-05 11:14:33,239 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:33,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:33,245 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 11:14:33,246 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:33,567 INFO L134 CoverageAnalysis]: Checked inductivity of 433 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2019-08-05 11:14:33,567 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:33,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 11:14:33,568 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 11:14:33,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 11:14:33,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=510, Unknown=0, NotChecked=0, Total=650 [2019-08-05 11:14:33,568 INFO L87 Difference]: Start difference. First operand 93 states and 106 transitions. Second operand 26 states. [2019-08-05 11:14:33,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:33,871 INFO L93 Difference]: Finished difference Result 169 states and 192 transitions. [2019-08-05 11:14:33,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 11:14:33,871 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 93 [2019-08-05 11:14:33,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:33,872 INFO L225 Difference]: With dead ends: 169 [2019-08-05 11:14:33,872 INFO L226 Difference]: Without dead ends: 169 [2019-08-05 11:14:33,873 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=280, Invalid=980, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 11:14:33,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-08-05 11:14:33,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 125. [2019-08-05 11:14:33,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-08-05 11:14:33,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 146 transitions. [2019-08-05 11:14:33,875 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 146 transitions. Word has length 93 [2019-08-05 11:14:33,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:33,876 INFO L475 AbstractCegarLoop]: Abstraction has 125 states and 146 transitions. [2019-08-05 11:14:33,876 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 11:14:33,876 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 146 transitions. [2019-08-05 11:14:33,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:14:33,876 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:33,876 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 9, 9, 9, 9, 9, 9, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:14:33,877 INFO L418 AbstractCegarLoop]: === Iteration 185 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:33,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:33,877 INFO L82 PathProgramCache]: Analyzing trace with hash -396095844, now seen corresponding path program 181 times [2019-08-05 11:14:33,877 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:33,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:33,884 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 11:14:33,884 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:34,068 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 1 proven. 213 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2019-08-05 11:14:34,069 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:34,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 11:14:34,069 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 11:14:34,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 11:14:34,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=538, Unknown=0, NotChecked=0, Total=650 [2019-08-05 11:14:34,070 INFO L87 Difference]: Start difference. First operand 125 states and 146 transitions. Second operand 26 states. [2019-08-05 11:14:34,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:34,514 INFO L93 Difference]: Finished difference Result 217 states and 246 transitions. [2019-08-05 11:14:34,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 11:14:34,515 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 93 [2019-08-05 11:14:34,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:34,516 INFO L225 Difference]: With dead ends: 217 [2019-08-05 11:14:34,516 INFO L226 Difference]: Without dead ends: 217 [2019-08-05 11:14:34,516 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=307, Invalid=1415, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 11:14:34,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-08-05 11:14:34,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 121. [2019-08-05 11:14:34,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-08-05 11:14:34,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 141 transitions. [2019-08-05 11:14:34,520 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 141 transitions. Word has length 93 [2019-08-05 11:14:34,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:34,520 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 141 transitions. [2019-08-05 11:14:34,520 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 11:14:34,520 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 141 transitions. [2019-08-05 11:14:34,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:14:34,521 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:34,521 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 9, 9, 9, 9, 9, 9, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:14:34,521 INFO L418 AbstractCegarLoop]: === Iteration 186 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:34,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:34,521 INFO L82 PathProgramCache]: Analyzing trace with hash 1512806684, now seen corresponding path program 182 times [2019-08-05 11:14:34,522 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:34,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:34,531 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:14:34,532 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:34,826 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 2 proven. 219 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-08-05 11:14:34,826 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:34,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:14:34,827 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:14:34,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:14:34,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=575, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:14:34,827 INFO L87 Difference]: Start difference. First operand 121 states and 141 transitions. Second operand 27 states. [2019-08-05 11:14:35,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:35,171 INFO L93 Difference]: Finished difference Result 233 states and 267 transitions. [2019-08-05 11:14:35,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:14:35,172 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:14:35,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:35,173 INFO L225 Difference]: With dead ends: 233 [2019-08-05 11:14:35,173 INFO L226 Difference]: Without dead ends: 233 [2019-08-05 11:14:35,173 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=263, Invalid=1143, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 11:14:35,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2019-08-05 11:14:35,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 117. [2019-08-05 11:14:35,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-08-05 11:14:35,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 136 transitions. [2019-08-05 11:14:35,177 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 136 transitions. Word has length 93 [2019-08-05 11:14:35,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:35,177 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 136 transitions. [2019-08-05 11:14:35,177 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:14:35,178 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 136 transitions. [2019-08-05 11:14:35,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:14:35,178 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:35,178 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1] [2019-08-05 11:14:35,178 INFO L418 AbstractCegarLoop]: === Iteration 187 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:35,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:35,178 INFO L82 PathProgramCache]: Analyzing trace with hash -75554785, now seen corresponding path program 183 times [2019-08-05 11:14:35,179 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:35,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:35,184 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:14:35,185 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:35,396 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 5 proven. 189 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2019-08-05 11:14:35,396 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:35,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:14:35,397 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:14:35,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:14:35,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=596, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:14:35,397 INFO L87 Difference]: Start difference. First operand 117 states and 136 transitions. Second operand 27 states. [2019-08-05 11:14:35,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:35,869 INFO L93 Difference]: Finished difference Result 247 states and 284 transitions. [2019-08-05 11:14:35,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-05 11:14:35,869 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:14:35,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:35,870 INFO L225 Difference]: With dead ends: 247 [2019-08-05 11:14:35,870 INFO L226 Difference]: Without dead ends: 247 [2019-08-05 11:14:35,871 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=287, Invalid=1693, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 11:14:35,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2019-08-05 11:14:35,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 141. [2019-08-05 11:14:35,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-08-05 11:14:35,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 163 transitions. [2019-08-05 11:14:35,875 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 163 transitions. Word has length 93 [2019-08-05 11:14:35,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:35,875 INFO L475 AbstractCegarLoop]: Abstraction has 141 states and 163 transitions. [2019-08-05 11:14:35,875 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:14:35,875 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 163 transitions. [2019-08-05 11:14:35,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:14:35,875 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:35,875 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1] [2019-08-05 11:14:35,876 INFO L418 AbstractCegarLoop]: === Iteration 188 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:35,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:35,876 INFO L82 PathProgramCache]: Analyzing trace with hash -1984457313, now seen corresponding path program 184 times [2019-08-05 11:14:35,876 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:35,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:35,884 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:14:35,885 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:36,101 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 7 proven. 187 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2019-08-05 11:14:36,102 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:36,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:14:36,102 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:14:36,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:14:36,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=596, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:14:36,103 INFO L87 Difference]: Start difference. First operand 141 states and 163 transitions. Second operand 27 states. [2019-08-05 11:14:36,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:36,529 INFO L93 Difference]: Finished difference Result 249 states and 285 transitions. [2019-08-05 11:14:36,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:14:36,530 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:14:36,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:36,531 INFO L225 Difference]: With dead ends: 249 [2019-08-05 11:14:36,531 INFO L226 Difference]: Without dead ends: 249 [2019-08-05 11:14:36,532 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=277, Invalid=1615, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 11:14:36,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2019-08-05 11:14:36,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 145. [2019-08-05 11:14:36,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-08-05 11:14:36,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 168 transitions. [2019-08-05 11:14:36,536 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 168 transitions. Word has length 93 [2019-08-05 11:14:36,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:36,536 INFO L475 AbstractCegarLoop]: Abstraction has 145 states and 168 transitions. [2019-08-05 11:14:36,536 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:14:36,536 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 168 transitions. [2019-08-05 11:14:36,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:14:36,536 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:36,537 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 7, 7, 7, 7, 7, 7, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:14:36,537 INFO L418 AbstractCegarLoop]: === Iteration 189 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:36,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:36,537 INFO L82 PathProgramCache]: Analyzing trace with hash -993420002, now seen corresponding path program 185 times [2019-08-05 11:14:36,537 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:36,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:36,543 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:14:36,544 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:36,756 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 6 proven. 193 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2019-08-05 11:14:36,756 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:36,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:14:36,757 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:14:36,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:14:36,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=603, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:14:36,757 INFO L87 Difference]: Start difference. First operand 145 states and 168 transitions. Second operand 27 states. [2019-08-05 11:14:37,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:37,205 INFO L93 Difference]: Finished difference Result 249 states and 289 transitions. [2019-08-05 11:14:37,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:14:37,205 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:14:37,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:37,206 INFO L225 Difference]: With dead ends: 249 [2019-08-05 11:14:37,206 INFO L226 Difference]: Without dead ends: 249 [2019-08-05 11:14:37,207 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=261, Invalid=1461, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 11:14:37,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2019-08-05 11:14:37,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 133. [2019-08-05 11:14:37,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-08-05 11:14:37,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 154 transitions. [2019-08-05 11:14:37,211 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 154 transitions. Word has length 93 [2019-08-05 11:14:37,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:37,212 INFO L475 AbstractCegarLoop]: Abstraction has 133 states and 154 transitions. [2019-08-05 11:14:37,212 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:14:37,212 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 154 transitions. [2019-08-05 11:14:37,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:14:37,212 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:37,212 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1] [2019-08-05 11:14:37,212 INFO L418 AbstractCegarLoop]: === Iteration 190 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:37,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:37,213 INFO L82 PathProgramCache]: Analyzing trace with hash -616592609, now seen corresponding path program 186 times [2019-08-05 11:14:37,213 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:37,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:37,218 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:14:37,219 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:37,434 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 9 proven. 185 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2019-08-05 11:14:37,434 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:37,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:14:37,434 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:14:37,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:14:37,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=596, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:14:37,435 INFO L87 Difference]: Start difference. First operand 133 states and 154 transitions. Second operand 27 states. [2019-08-05 11:14:37,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:37,915 INFO L93 Difference]: Finished difference Result 245 states and 279 transitions. [2019-08-05 11:14:37,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:14:37,915 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:14:37,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:37,916 INFO L225 Difference]: With dead ends: 245 [2019-08-05 11:14:37,916 INFO L226 Difference]: Without dead ends: 245 [2019-08-05 11:14:37,916 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=250, Invalid=1390, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:14:37,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2019-08-05 11:14:37,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 145. [2019-08-05 11:14:37,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-08-05 11:14:37,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 168 transitions. [2019-08-05 11:14:37,920 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 168 transitions. Word has length 93 [2019-08-05 11:14:37,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:37,920 INFO L475 AbstractCegarLoop]: Abstraction has 145 states and 168 transitions. [2019-08-05 11:14:37,920 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:14:37,920 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 168 transitions. [2019-08-05 11:14:37,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:14:37,921 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:37,921 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 9, 9, 9, 9, 9, 9, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:14:37,921 INFO L418 AbstractCegarLoop]: === Iteration 191 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:37,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:37,921 INFO L82 PathProgramCache]: Analyzing trace with hash 1996186524, now seen corresponding path program 187 times [2019-08-05 11:14:37,922 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:37,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:37,929 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:14:37,930 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:38,261 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 3 proven. 218 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-08-05 11:14:38,261 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:38,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:14:38,262 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:14:38,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:14:38,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=575, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:14:38,262 INFO L87 Difference]: Start difference. First operand 145 states and 168 transitions. Second operand 27 states. [2019-08-05 11:14:38,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:38,620 INFO L93 Difference]: Finished difference Result 257 states and 297 transitions. [2019-08-05 11:14:38,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:14:38,621 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:14:38,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:38,622 INFO L225 Difference]: With dead ends: 257 [2019-08-05 11:14:38,622 INFO L226 Difference]: Without dead ends: 257 [2019-08-05 11:14:38,623 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=263, Invalid=1143, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 11:14:38,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2019-08-05 11:14:38,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 153. [2019-08-05 11:14:38,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-08-05 11:14:38,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 177 transitions. [2019-08-05 11:14:38,626 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 177 transitions. Word has length 93 [2019-08-05 11:14:38,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:38,627 INFO L475 AbstractCegarLoop]: Abstraction has 153 states and 177 transitions. [2019-08-05 11:14:38,627 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:14:38,627 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 177 transitions. [2019-08-05 11:14:38,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:14:38,627 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:38,627 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:14:38,627 INFO L418 AbstractCegarLoop]: === Iteration 192 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:38,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:38,628 INFO L82 PathProgramCache]: Analyzing trace with hash 1005149213, now seen corresponding path program 188 times [2019-08-05 11:14:38,628 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:38,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:38,635 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 11:14:38,636 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:38,820 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 2 proven. 199 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2019-08-05 11:14:38,820 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:38,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 11:14:38,821 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 11:14:38,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 11:14:38,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=552, Unknown=0, NotChecked=0, Total=650 [2019-08-05 11:14:38,822 INFO L87 Difference]: Start difference. First operand 153 states and 177 transitions. Second operand 26 states. [2019-08-05 11:14:39,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:39,128 INFO L93 Difference]: Finished difference Result 257 states and 292 transitions. [2019-08-05 11:14:39,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 11:14:39,129 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 93 [2019-08-05 11:14:39,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:39,130 INFO L225 Difference]: With dead ends: 257 [2019-08-05 11:14:39,130 INFO L226 Difference]: Without dead ends: 257 [2019-08-05 11:14:39,131 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=252, Invalid=1230, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 11:14:39,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2019-08-05 11:14:39,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 141. [2019-08-05 11:14:39,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-08-05 11:14:39,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 163 transitions. [2019-08-05 11:14:39,135 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 163 transitions. Word has length 93 [2019-08-05 11:14:39,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:39,135 INFO L475 AbstractCegarLoop]: Abstraction has 141 states and 163 transitions. [2019-08-05 11:14:39,135 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 11:14:39,135 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 163 transitions. [2019-08-05 11:14:39,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:14:39,136 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:39,136 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 7, 7, 7, 7, 7, 7, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:14:39,136 INFO L418 AbstractCegarLoop]: === Iteration 193 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:39,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:39,137 INFO L82 PathProgramCache]: Analyzing trace with hash 374444702, now seen corresponding path program 189 times [2019-08-05 11:14:39,137 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:39,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:39,143 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:14:39,143 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:39,360 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 8 proven. 194 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2019-08-05 11:14:39,360 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:39,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:14:39,360 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:14:39,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:14:39,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=600, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:14:39,361 INFO L87 Difference]: Start difference. First operand 141 states and 163 transitions. Second operand 27 states. [2019-08-05 11:14:39,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:39,756 INFO L93 Difference]: Finished difference Result 241 states and 278 transitions. [2019-08-05 11:14:39,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:14:39,757 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:14:39,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:39,758 INFO L225 Difference]: With dead ends: 241 [2019-08-05 11:14:39,758 INFO L226 Difference]: Without dead ends: 241 [2019-08-05 11:14:39,759 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=235, Invalid=1247, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 11:14:39,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2019-08-05 11:14:39,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 133. [2019-08-05 11:14:39,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-08-05 11:14:39,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 154 transitions. [2019-08-05 11:14:39,763 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 154 transitions. Word has length 93 [2019-08-05 11:14:39,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:39,763 INFO L475 AbstractCegarLoop]: Abstraction has 133 states and 154 transitions. [2019-08-05 11:14:39,763 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:14:39,764 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 154 transitions. [2019-08-05 11:14:39,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:14:39,764 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:39,764 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 9, 9, 9, 9, 9, 9, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:14:39,764 INFO L418 AbstractCegarLoop]: === Iteration 194 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:39,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:39,765 INFO L82 PathProgramCache]: Analyzing trace with hash 628321820, now seen corresponding path program 190 times [2019-08-05 11:14:39,765 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:39,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:39,773 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:14:39,774 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:40,003 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 4 proven. 217 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-08-05 11:14:40,004 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:40,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:14:40,004 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:14:40,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:14:40,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=575, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:14:40,004 INFO L87 Difference]: Start difference. First operand 133 states and 154 transitions. Second operand 27 states. [2019-08-05 11:14:40,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:40,375 INFO L93 Difference]: Finished difference Result 249 states and 289 transitions. [2019-08-05 11:14:40,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:14:40,376 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:14:40,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:40,377 INFO L225 Difference]: With dead ends: 249 [2019-08-05 11:14:40,377 INFO L226 Difference]: Without dead ends: 249 [2019-08-05 11:14:40,378 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=263, Invalid=1143, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 11:14:40,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2019-08-05 11:14:40,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 145. [2019-08-05 11:14:40,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-08-05 11:14:40,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 168 transitions. [2019-08-05 11:14:40,382 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 168 transitions. Word has length 93 [2019-08-05 11:14:40,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:40,382 INFO L475 AbstractCegarLoop]: Abstraction has 145 states and 168 transitions. [2019-08-05 11:14:40,382 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:14:40,382 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 168 transitions. [2019-08-05 11:14:40,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:14:40,383 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:40,383 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:14:40,383 INFO L418 AbstractCegarLoop]: === Iteration 195 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:40,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:40,383 INFO L82 PathProgramCache]: Analyzing trace with hash -362715491, now seen corresponding path program 191 times [2019-08-05 11:14:40,383 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:40,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:40,389 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:14:40,390 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:40,613 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 5 proven. 203 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2019-08-05 11:14:40,614 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:40,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:14:40,614 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:14:40,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:14:40,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=596, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:14:40,614 INFO L87 Difference]: Start difference. First operand 145 states and 168 transitions. Second operand 27 states. [2019-08-05 11:14:41,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:41,003 INFO L93 Difference]: Finished difference Result 253 states and 289 transitions. [2019-08-05 11:14:41,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:14:41,004 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:14:41,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:41,005 INFO L225 Difference]: With dead ends: 253 [2019-08-05 11:14:41,005 INFO L226 Difference]: Without dead ends: 253 [2019-08-05 11:14:41,006 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=290, Invalid=1602, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 11:14:41,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2019-08-05 11:14:41,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 141. [2019-08-05 11:14:41,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-08-05 11:14:41,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 163 transitions. [2019-08-05 11:14:41,010 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 163 transitions. Word has length 93 [2019-08-05 11:14:41,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:41,010 INFO L475 AbstractCegarLoop]: Abstraction has 141 states and 163 transitions. [2019-08-05 11:14:41,010 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:14:41,010 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 163 transitions. [2019-08-05 11:14:41,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:14:41,010 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:41,011 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:14:41,011 INFO L418 AbstractCegarLoop]: === Iteration 196 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:41,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:41,011 INFO L82 PathProgramCache]: Analyzing trace with hash 1546187037, now seen corresponding path program 192 times [2019-08-05 11:14:41,012 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:41,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:41,020 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:14:41,021 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:41,293 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 3 proven. 205 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2019-08-05 11:14:41,293 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:41,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:14:41,294 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:14:41,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:14:41,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=596, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:14:41,294 INFO L87 Difference]: Start difference. First operand 141 states and 163 transitions. Second operand 27 states. [2019-08-05 11:14:41,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:41,700 INFO L93 Difference]: Finished difference Result 249 states and 285 transitions. [2019-08-05 11:14:41,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:14:41,701 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:14:41,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:41,702 INFO L225 Difference]: With dead ends: 249 [2019-08-05 11:14:41,702 INFO L226 Difference]: Without dead ends: 249 [2019-08-05 11:14:41,702 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=280, Invalid=1526, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 11:14:41,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2019-08-05 11:14:41,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 129. [2019-08-05 11:14:41,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-08-05 11:14:41,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 149 transitions. [2019-08-05 11:14:41,706 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 149 transitions. Word has length 93 [2019-08-05 11:14:41,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:41,706 INFO L475 AbstractCegarLoop]: Abstraction has 129 states and 149 transitions. [2019-08-05 11:14:41,706 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:14:41,706 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 149 transitions. [2019-08-05 11:14:41,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:14:41,706 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:41,707 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 9, 9, 9, 9, 9, 9, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:14:41,707 INFO L418 AbstractCegarLoop]: === Iteration 197 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:41,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:41,707 INFO L82 PathProgramCache]: Analyzing trace with hash 1546893468, now seen corresponding path program 193 times [2019-08-05 11:14:41,707 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:41,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:41,713 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:14:41,714 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:41,937 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 5 proven. 216 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-08-05 11:14:41,937 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:41,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:14:41,938 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:14:41,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:14:41,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=575, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:14:41,938 INFO L87 Difference]: Start difference. First operand 129 states and 149 transitions. Second operand 27 states. [2019-08-05 11:14:42,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:42,276 INFO L93 Difference]: Finished difference Result 241 states and 280 transitions. [2019-08-05 11:14:42,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:14:42,276 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:14:42,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:42,278 INFO L225 Difference]: With dead ends: 241 [2019-08-05 11:14:42,278 INFO L226 Difference]: Without dead ends: 241 [2019-08-05 11:14:42,278 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=263, Invalid=1143, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 11:14:42,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2019-08-05 11:14:42,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 145. [2019-08-05 11:14:42,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-08-05 11:14:42,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 168 transitions. [2019-08-05 11:14:42,283 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 168 transitions. Word has length 93 [2019-08-05 11:14:42,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:42,283 INFO L475 AbstractCegarLoop]: Abstraction has 145 states and 168 transitions. [2019-08-05 11:14:42,283 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:14:42,284 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 168 transitions. [2019-08-05 11:14:42,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:14:42,284 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:42,284 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:14:42,285 INFO L418 AbstractCegarLoop]: === Iteration 198 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:42,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:42,285 INFO L82 PathProgramCache]: Analyzing trace with hash 555856157, now seen corresponding path program 194 times [2019-08-05 11:14:42,285 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:42,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:42,293 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:14:42,294 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:42,530 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 6 proven. 202 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2019-08-05 11:14:42,530 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:42,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:14:42,530 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:14:42,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:14:42,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=596, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:14:42,531 INFO L87 Difference]: Start difference. First operand 145 states and 168 transitions. Second operand 27 states. [2019-08-05 11:14:43,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:43,048 INFO L93 Difference]: Finished difference Result 245 states and 281 transitions. [2019-08-05 11:14:43,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:14:43,048 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:14:43,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:43,049 INFO L225 Difference]: With dead ends: 245 [2019-08-05 11:14:43,049 INFO L226 Difference]: Without dead ends: 245 [2019-08-05 11:14:43,050 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=290, Invalid=1602, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 11:14:43,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2019-08-05 11:14:43,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 141. [2019-08-05 11:14:43,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-08-05 11:14:43,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 163 transitions. [2019-08-05 11:14:43,053 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 163 transitions. Word has length 93 [2019-08-05 11:14:43,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:43,053 INFO L475 AbstractCegarLoop]: Abstraction has 141 states and 163 transitions. [2019-08-05 11:14:43,054 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:14:43,054 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 163 transitions. [2019-08-05 11:14:43,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:14:43,054 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:43,054 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:14:43,054 INFO L418 AbstractCegarLoop]: === Iteration 199 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:43,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:43,055 INFO L82 PathProgramCache]: Analyzing trace with hash -1830208611, now seen corresponding path program 195 times [2019-08-05 11:14:43,055 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:43,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:43,072 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:14:43,073 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:43,436 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 5 proven. 206 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2019-08-05 11:14:43,436 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:43,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:14:43,437 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:14:43,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:14:43,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=586, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:14:43,437 INFO L87 Difference]: Start difference. First operand 141 states and 163 transitions. Second operand 27 states. [2019-08-05 11:14:43,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:43,783 INFO L93 Difference]: Finished difference Result 249 states and 286 transitions. [2019-08-05 11:14:43,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:14:43,784 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:14:43,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:43,785 INFO L225 Difference]: With dead ends: 249 [2019-08-05 11:14:43,785 INFO L226 Difference]: Without dead ends: 249 [2019-08-05 11:14:43,786 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=246, Invalid=1160, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 11:14:43,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2019-08-05 11:14:43,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 137. [2019-08-05 11:14:43,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-08-05 11:14:43,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 158 transitions. [2019-08-05 11:14:43,789 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 158 transitions. Word has length 93 [2019-08-05 11:14:43,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:43,790 INFO L475 AbstractCegarLoop]: Abstraction has 137 states and 158 transitions. [2019-08-05 11:14:43,790 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:14:43,790 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 158 transitions. [2019-08-05 11:14:43,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:14:43,790 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:43,790 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 7, 7, 7, 7, 7, 7, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:14:43,791 INFO L418 AbstractCegarLoop]: === Iteration 200 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:43,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:43,791 INFO L82 PathProgramCache]: Analyzing trace with hash -108935138, now seen corresponding path program 196 times [2019-08-05 11:14:43,791 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:43,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:43,799 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:14:43,800 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:44,011 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 7 proven. 195 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2019-08-05 11:14:44,011 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:44,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:14:44,011 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:14:44,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:14:44,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=600, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:14:44,012 INFO L87 Difference]: Start difference. First operand 137 states and 158 transitions. Second operand 27 states. [2019-08-05 11:14:44,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:44,463 INFO L93 Difference]: Finished difference Result 257 states and 296 transitions. [2019-08-05 11:14:44,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:14:44,464 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:14:44,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:44,465 INFO L225 Difference]: With dead ends: 257 [2019-08-05 11:14:44,465 INFO L226 Difference]: Without dead ends: 257 [2019-08-05 11:14:44,465 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=235, Invalid=1247, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 11:14:44,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2019-08-05 11:14:44,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 141. [2019-08-05 11:14:44,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-08-05 11:14:44,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 163 transitions. [2019-08-05 11:14:44,469 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 163 transitions. Word has length 93 [2019-08-05 11:14:44,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:44,469 INFO L475 AbstractCegarLoop]: Abstraction has 141 states and 163 transitions. [2019-08-05 11:14:44,469 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:14:44,469 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 163 transitions. [2019-08-05 11:14:44,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:14:44,469 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:44,470 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 7, 7, 7, 7, 7, 7, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:14:44,470 INFO L418 AbstractCegarLoop]: === Iteration 201 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:44,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:44,470 INFO L82 PathProgramCache]: Analyzing trace with hash -2017837666, now seen corresponding path program 197 times [2019-08-05 11:14:44,470 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:44,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:44,476 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:14:44,477 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:44,839 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 8 proven. 191 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2019-08-05 11:14:44,839 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:44,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:14:44,839 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:14:44,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:14:44,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=603, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:14:44,840 INFO L87 Difference]: Start difference. First operand 141 states and 163 transitions. Second operand 27 states. [2019-08-05 11:14:45,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:45,270 INFO L93 Difference]: Finished difference Result 249 states and 286 transitions. [2019-08-05 11:14:45,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:14:45,271 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:14:45,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:45,272 INFO L225 Difference]: With dead ends: 249 [2019-08-05 11:14:45,272 INFO L226 Difference]: Without dead ends: 249 [2019-08-05 11:14:45,272 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=264, Invalid=1542, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 11:14:45,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2019-08-05 11:14:45,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 145. [2019-08-05 11:14:45,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-08-05 11:14:45,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 168 transitions. [2019-08-05 11:14:45,276 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 168 transitions. Word has length 93 [2019-08-05 11:14:45,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:45,277 INFO L475 AbstractCegarLoop]: Abstraction has 145 states and 168 transitions. [2019-08-05 11:14:45,277 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:14:45,277 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 168 transitions. [2019-08-05 11:14:45,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:14:45,277 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:45,277 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:14:45,277 INFO L418 AbstractCegarLoop]: === Iteration 202 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:45,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:45,278 INFO L82 PathProgramCache]: Analyzing trace with hash -1026800355, now seen corresponding path program 198 times [2019-08-05 11:14:45,278 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:45,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:45,286 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:14:45,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:45,499 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 7 proven. 201 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2019-08-05 11:14:45,500 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:45,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:14:45,500 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:14:45,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:14:45,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=596, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:14:45,501 INFO L87 Difference]: Start difference. First operand 145 states and 168 transitions. Second operand 27 states. [2019-08-05 11:14:45,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:45,898 INFO L93 Difference]: Finished difference Result 241 states and 280 transitions. [2019-08-05 11:14:45,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:14:45,898 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:14:45,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:45,899 INFO L225 Difference]: With dead ends: 241 [2019-08-05 11:14:45,899 INFO L226 Difference]: Without dead ends: 241 [2019-08-05 11:14:45,900 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=244, Invalid=1238, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 11:14:45,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2019-08-05 11:14:45,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 125. [2019-08-05 11:14:45,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-08-05 11:14:45,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 144 transitions. [2019-08-05 11:14:45,903 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 144 transitions. Word has length 93 [2019-08-05 11:14:45,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:45,903 INFO L475 AbstractCegarLoop]: Abstraction has 125 states and 144 transitions. [2019-08-05 11:14:45,903 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:14:45,903 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 144 transitions. [2019-08-05 11:14:45,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:14:45,904 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:45,904 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1] [2019-08-05 11:14:45,904 INFO L418 AbstractCegarLoop]: === Iteration 203 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:45,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:45,904 INFO L82 PathProgramCache]: Analyzing trace with hash 362217631, now seen corresponding path program 199 times [2019-08-05 11:14:45,905 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:45,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:45,911 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:14:45,911 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:46,126 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 11 proven. 183 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2019-08-05 11:14:46,127 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:46,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:14:46,127 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:14:46,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:14:46,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=596, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:14:46,128 INFO L87 Difference]: Start difference. First operand 125 states and 144 transitions. Second operand 27 states. [2019-08-05 11:14:46,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:46,485 INFO L93 Difference]: Finished difference Result 249 states and 283 transitions. [2019-08-05 11:14:46,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:14:46,485 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:14:46,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:46,486 INFO L225 Difference]: With dead ends: 249 [2019-08-05 11:14:46,486 INFO L226 Difference]: Without dead ends: 249 [2019-08-05 11:14:46,486 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=244, Invalid=1316, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 11:14:46,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2019-08-05 11:14:46,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 145. [2019-08-05 11:14:46,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-08-05 11:14:46,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 167 transitions. [2019-08-05 11:14:46,491 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 167 transitions. Word has length 93 [2019-08-05 11:14:46,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:46,491 INFO L475 AbstractCegarLoop]: Abstraction has 145 states and 167 transitions. [2019-08-05 11:14:46,491 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:14:46,491 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 167 transitions. [2019-08-05 11:14:46,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:14:46,491 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:46,491 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 7, 7, 7, 7, 7, 7, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:14:46,492 INFO L418 AbstractCegarLoop]: === Iteration 204 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:46,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:46,492 INFO L82 PathProgramCache]: Analyzing trace with hash 1353254942, now seen corresponding path program 200 times [2019-08-05 11:14:46,492 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:46,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:46,498 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:14:46,499 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:46,720 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 10 proven. 192 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2019-08-05 11:14:46,721 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:46,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:14:46,721 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:14:46,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:14:46,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=600, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:14:46,721 INFO L87 Difference]: Start difference. First operand 145 states and 167 transitions. Second operand 27 states. [2019-08-05 11:14:47,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:47,123 INFO L93 Difference]: Finished difference Result 249 states and 287 transitions. [2019-08-05 11:14:47,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:14:47,123 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:14:47,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:47,125 INFO L225 Difference]: With dead ends: 249 [2019-08-05 11:14:47,125 INFO L226 Difference]: Without dead ends: 249 [2019-08-05 11:14:47,125 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=251, Invalid=1389, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:14:47,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2019-08-05 11:14:47,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 137. [2019-08-05 11:14:47,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-08-05 11:14:47,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 158 transitions. [2019-08-05 11:14:47,129 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 158 transitions. Word has length 93 [2019-08-05 11:14:47,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:47,129 INFO L475 AbstractCegarLoop]: Abstraction has 137 states and 158 transitions. [2019-08-05 11:14:47,129 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:14:47,129 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 158 transitions. [2019-08-05 11:14:47,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:14:47,130 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:47,130 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:14:47,130 INFO L418 AbstractCegarLoop]: === Iteration 205 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:47,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:47,130 INFO L82 PathProgramCache]: Analyzing trace with hash -1346828771, now seen corresponding path program 201 times [2019-08-05 11:14:47,131 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:47,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:47,137 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:14:47,144 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:47,386 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 4 proven. 204 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2019-08-05 11:14:47,386 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:47,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:14:47,387 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:14:47,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:14:47,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=596, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:14:47,387 INFO L87 Difference]: Start difference. First operand 137 states and 158 transitions. Second operand 27 states. [2019-08-05 11:14:47,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:47,847 INFO L93 Difference]: Finished difference Result 253 states and 291 transitions. [2019-08-05 11:14:47,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:14:47,847 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:14:47,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:47,848 INFO L225 Difference]: With dead ends: 253 [2019-08-05 11:14:47,849 INFO L226 Difference]: Without dead ends: 253 [2019-08-05 11:14:47,849 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=271, Invalid=1451, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 11:14:47,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2019-08-05 11:14:47,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 145. [2019-08-05 11:14:47,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-08-05 11:14:47,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 167 transitions. [2019-08-05 11:14:47,853 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 167 transitions. Word has length 93 [2019-08-05 11:14:47,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:47,853 INFO L475 AbstractCegarLoop]: Abstraction has 145 states and 167 transitions. [2019-08-05 11:14:47,853 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:14:47,853 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 167 transitions. [2019-08-05 11:14:47,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:14:47,854 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:47,854 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 7, 7, 7, 7, 7, 7, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:14:47,854 INFO L418 AbstractCegarLoop]: === Iteration 206 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:47,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:47,854 INFO L82 PathProgramCache]: Analyzing trace with hash 1957101214, now seen corresponding path program 202 times [2019-08-05 11:14:47,855 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:47,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:47,860 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 11:14:47,861 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:48,110 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 3 proven. 189 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2019-08-05 11:14:48,110 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:48,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 11:14:48,111 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 11:14:48,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 11:14:48,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=552, Unknown=0, NotChecked=0, Total=650 [2019-08-05 11:14:48,111 INFO L87 Difference]: Start difference. First operand 145 states and 167 transitions. Second operand 26 states. [2019-08-05 11:14:48,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:48,480 INFO L93 Difference]: Finished difference Result 253 states and 287 transitions. [2019-08-05 11:14:48,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 11:14:48,481 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 93 [2019-08-05 11:14:48,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:48,482 INFO L225 Difference]: With dead ends: 253 [2019-08-05 11:14:48,482 INFO L226 Difference]: Without dead ends: 253 [2019-08-05 11:14:48,482 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=214, Invalid=1046, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 11:14:48,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2019-08-05 11:14:48,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 125. [2019-08-05 11:14:48,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-08-05 11:14:48,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 144 transitions. [2019-08-05 11:14:48,486 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 144 transitions. Word has length 93 [2019-08-05 11:14:48,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:48,486 INFO L475 AbstractCegarLoop]: Abstraction has 125 states and 144 transitions. [2019-08-05 11:14:48,486 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 11:14:48,486 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 144 transitions. [2019-08-05 11:14:48,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:14:48,487 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:48,487 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 7, 7, 7, 7, 7, 7, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:14:48,487 INFO L418 AbstractCegarLoop]: === Iteration 207 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:48,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:48,487 INFO L82 PathProgramCache]: Analyzing trace with hash 869875102, now seen corresponding path program 203 times [2019-08-05 11:14:48,487 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:48,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:48,494 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 11:14:48,495 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:48,713 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 9 proven. 192 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2019-08-05 11:14:48,713 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:48,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:14:48,714 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:14:48,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:14:48,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=593, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:14:48,714 INFO L87 Difference]: Start difference. First operand 125 states and 144 transitions. Second operand 27 states. [2019-08-05 11:14:49,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:49,047 INFO L93 Difference]: Finished difference Result 241 states and 277 transitions. [2019-08-05 11:14:49,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:14:49,048 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:14:49,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:49,049 INFO L225 Difference]: With dead ends: 241 [2019-08-05 11:14:49,049 INFO L226 Difference]: Without dead ends: 241 [2019-08-05 11:14:49,050 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=235, Invalid=1171, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 11:14:49,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2019-08-05 11:14:49,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 129. [2019-08-05 11:14:49,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-08-05 11:14:49,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 149 transitions. [2019-08-05 11:14:49,053 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 149 transitions. Word has length 93 [2019-08-05 11:14:49,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:49,053 INFO L475 AbstractCegarLoop]: Abstraction has 129 states and 149 transitions. [2019-08-05 11:14:49,053 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:14:49,053 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 149 transitions. [2019-08-05 11:14:49,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:14:49,054 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:49,054 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 9, 9, 9, 9, 9, 9, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:14:49,054 INFO L418 AbstractCegarLoop]: === Iteration 208 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:49,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:49,054 INFO L82 PathProgramCache]: Analyzing trace with hash 568083228, now seen corresponding path program 204 times [2019-08-05 11:14:49,055 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:49,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:49,060 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:14:49,061 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:49,269 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 6 proven. 215 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-08-05 11:14:49,269 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:49,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:14:49,270 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:14:49,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:14:49,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=575, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:14:49,270 INFO L87 Difference]: Start difference. First operand 129 states and 149 transitions. Second operand 27 states. [2019-08-05 11:14:49,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:49,586 INFO L93 Difference]: Finished difference Result 241 states and 279 transitions. [2019-08-05 11:14:49,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:14:49,587 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:14:49,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:49,594 INFO L225 Difference]: With dead ends: 241 [2019-08-05 11:14:49,594 INFO L226 Difference]: Without dead ends: 241 [2019-08-05 11:14:49,595 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=263, Invalid=1143, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 11:14:49,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2019-08-05 11:14:49,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 149. [2019-08-05 11:14:49,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-08-05 11:14:49,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 173 transitions. [2019-08-05 11:14:49,598 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 173 transitions. Word has length 93 [2019-08-05 11:14:49,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:49,598 INFO L475 AbstractCegarLoop]: Abstraction has 149 states and 173 transitions. [2019-08-05 11:14:49,598 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:14:49,598 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 173 transitions. [2019-08-05 11:14:49,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:14:49,599 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:49,599 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 7, 7, 7, 7, 7, 7, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:14:49,599 INFO L418 AbstractCegarLoop]: === Iteration 209 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:49,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:49,599 INFO L82 PathProgramCache]: Analyzing trace with hash -1039027426, now seen corresponding path program 205 times [2019-08-05 11:14:49,600 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:49,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:49,605 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:14:49,606 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:49,868 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 12 proven. 190 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2019-08-05 11:14:49,868 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:49,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:14:49,868 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:14:49,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:14:49,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=600, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:14:49,869 INFO L87 Difference]: Start difference. First operand 149 states and 173 transitions. Second operand 27 states. [2019-08-05 11:14:50,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:50,305 INFO L93 Difference]: Finished difference Result 261 states and 301 transitions. [2019-08-05 11:14:50,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:14:50,306 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:14:50,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:50,307 INFO L225 Difference]: With dead ends: 261 [2019-08-05 11:14:50,307 INFO L226 Difference]: Without dead ends: 261 [2019-08-05 11:14:50,307 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=268, Invalid=1538, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 11:14:50,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2019-08-05 11:14:50,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 153. [2019-08-05 11:14:50,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-08-05 11:14:50,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 178 transitions. [2019-08-05 11:14:50,311 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 178 transitions. Word has length 93 [2019-08-05 11:14:50,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:50,311 INFO L475 AbstractCegarLoop]: Abstraction has 153 states and 178 transitions. [2019-08-05 11:14:50,311 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:14:50,311 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 178 transitions. [2019-08-05 11:14:50,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:14:50,312 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:50,312 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:14:50,312 INFO L418 AbstractCegarLoop]: === Iteration 210 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:50,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:50,312 INFO L82 PathProgramCache]: Analyzing trace with hash -422954083, now seen corresponding path program 206 times [2019-08-05 11:14:50,312 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:50,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:50,318 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:14:50,319 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:50,520 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 7 proven. 201 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2019-08-05 11:14:50,520 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:50,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:14:50,520 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:14:50,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:14:50,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=596, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:14:50,521 INFO L87 Difference]: Start difference. First operand 153 states and 178 transitions. Second operand 27 states. [2019-08-05 11:14:50,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:50,948 INFO L93 Difference]: Finished difference Result 269 states and 309 transitions. [2019-08-05 11:14:50,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:14:50,949 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:14:50,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:50,950 INFO L225 Difference]: With dead ends: 269 [2019-08-05 11:14:50,950 INFO L226 Difference]: Without dead ends: 269 [2019-08-05 11:14:50,950 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=290, Invalid=1602, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 11:14:50,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2019-08-05 11:14:50,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 149. [2019-08-05 11:14:50,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-08-05 11:14:50,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 173 transitions. [2019-08-05 11:14:50,955 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 173 transitions. Word has length 93 [2019-08-05 11:14:50,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:50,955 INFO L475 AbstractCegarLoop]: Abstraction has 149 states and 173 transitions. [2019-08-05 11:14:50,955 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:14:50,955 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 173 transitions. [2019-08-05 11:14:50,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:14:50,956 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:50,956 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:14:50,956 INFO L418 AbstractCegarLoop]: === Iteration 211 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:50,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:50,956 INFO L82 PathProgramCache]: Analyzing trace with hash 1485948445, now seen corresponding path program 207 times [2019-08-05 11:14:50,957 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:50,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:50,963 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:14:50,963 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:51,166 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 6 proven. 205 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2019-08-05 11:14:51,167 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:51,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:14:51,167 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:14:51,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:14:51,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=586, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:14:51,168 INFO L87 Difference]: Start difference. First operand 149 states and 173 transitions. Second operand 27 states. [2019-08-05 11:14:51,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:51,517 INFO L93 Difference]: Finished difference Result 273 states and 315 transitions. [2019-08-05 11:14:51,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:14:51,518 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:14:51,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:51,519 INFO L225 Difference]: With dead ends: 273 [2019-08-05 11:14:51,519 INFO L226 Difference]: Without dead ends: 273 [2019-08-05 11:14:51,519 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=246, Invalid=1160, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 11:14:51,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2019-08-05 11:14:51,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 145. [2019-08-05 11:14:51,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-08-05 11:14:51,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 168 transitions. [2019-08-05 11:14:51,523 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 168 transitions. Word has length 93 [2019-08-05 11:14:51,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:51,523 INFO L475 AbstractCegarLoop]: Abstraction has 145 states and 168 transitions. [2019-08-05 11:14:51,523 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:14:51,523 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 168 transitions. [2019-08-05 11:14:51,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:14:51,524 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:51,524 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:14:51,524 INFO L418 AbstractCegarLoop]: === Iteration 212 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:51,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:51,524 INFO L82 PathProgramCache]: Analyzing trace with hash -47990115, now seen corresponding path program 208 times [2019-08-05 11:14:51,525 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:51,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:51,532 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:14:51,533 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:51,827 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 11 proven. 200 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2019-08-05 11:14:51,827 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:51,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:14:51,827 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:14:51,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:14:51,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=586, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:14:51,828 INFO L87 Difference]: Start difference. First operand 145 states and 168 transitions. Second operand 27 states. [2019-08-05 11:14:52,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:52,168 INFO L93 Difference]: Finished difference Result 245 states and 285 transitions. [2019-08-05 11:14:52,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:14:52,169 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:14:52,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:52,170 INFO L225 Difference]: With dead ends: 245 [2019-08-05 11:14:52,170 INFO L226 Difference]: Without dead ends: 245 [2019-08-05 11:14:52,170 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=246, Invalid=1160, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 11:14:52,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2019-08-05 11:14:52,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 129. [2019-08-05 11:14:52,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-08-05 11:14:52,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 149 transitions. [2019-08-05 11:14:52,174 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 149 transitions. Word has length 93 [2019-08-05 11:14:52,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:52,174 INFO L475 AbstractCegarLoop]: Abstraction has 129 states and 149 transitions. [2019-08-05 11:14:52,174 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:14:52,174 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 149 transitions. [2019-08-05 11:14:52,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:14:52,175 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:52,175 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:14:52,175 INFO L418 AbstractCegarLoop]: === Iteration 213 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:52,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:52,175 INFO L82 PathProgramCache]: Analyzing trace with hash 1969328285, now seen corresponding path program 209 times [2019-08-05 11:14:52,176 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:52,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:52,183 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:14:52,183 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:52,400 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 7 proven. 204 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2019-08-05 11:14:52,400 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:52,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:14:52,400 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:14:52,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:14:52,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=586, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:14:52,401 INFO L87 Difference]: Start difference. First operand 129 states and 149 transitions. Second operand 27 states. [2019-08-05 11:14:52,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:52,734 INFO L93 Difference]: Finished difference Result 253 states and 292 transitions. [2019-08-05 11:14:52,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:14:52,734 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:14:52,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:52,735 INFO L225 Difference]: With dead ends: 253 [2019-08-05 11:14:52,736 INFO L226 Difference]: Without dead ends: 253 [2019-08-05 11:14:52,736 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=246, Invalid=1160, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 11:14:52,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2019-08-05 11:14:52,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 137. [2019-08-05 11:14:52,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-08-05 11:14:52,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 158 transitions. [2019-08-05 11:14:52,740 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 158 transitions. Word has length 93 [2019-08-05 11:14:52,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:52,740 INFO L475 AbstractCegarLoop]: Abstraction has 137 states and 158 transitions. [2019-08-05 11:14:52,740 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:14:52,740 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 158 transitions. [2019-08-05 11:14:52,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:14:52,740 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:52,741 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 7, 7, 7, 7, 7, 7, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:14:52,741 INFO L418 AbstractCegarLoop]: === Iteration 214 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:52,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:52,741 INFO L82 PathProgramCache]: Analyzing trace with hash 978290974, now seen corresponding path program 210 times [2019-08-05 11:14:52,741 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:52,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:52,748 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:14:52,749 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:52,983 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 8 proven. 191 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2019-08-05 11:14:52,983 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:52,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:14:52,984 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:14:52,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:14:52,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=603, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:14:52,984 INFO L87 Difference]: Start difference. First operand 137 states and 158 transitions. Second operand 27 states. [2019-08-05 11:14:53,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:53,577 INFO L93 Difference]: Finished difference Result 253 states and 288 transitions. [2019-08-05 11:14:53,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:14:53,577 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:14:53,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:53,578 INFO L225 Difference]: With dead ends: 253 [2019-08-05 11:14:53,578 INFO L226 Difference]: Without dead ends: 253 [2019-08-05 11:14:53,579 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=257, Invalid=1465, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 11:14:53,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2019-08-05 11:14:53,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 125. [2019-08-05 11:14:53,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-08-05 11:14:53,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 144 transitions. [2019-08-05 11:14:53,582 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 144 transitions. Word has length 93 [2019-08-05 11:14:53,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:53,583 INFO L475 AbstractCegarLoop]: Abstraction has 125 states and 144 transitions. [2019-08-05 11:14:53,583 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:14:53,583 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 144 transitions. [2019-08-05 11:14:53,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:14:53,583 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:53,583 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 7, 7, 7, 7, 7, 7, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:14:53,583 INFO L418 AbstractCegarLoop]: === Iteration 215 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:53,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:53,584 INFO L82 PathProgramCache]: Analyzing trace with hash -48696546, now seen corresponding path program 211 times [2019-08-05 11:14:53,584 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:53,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:53,590 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:14:53,590 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:53,807 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 9 proven. 193 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2019-08-05 11:14:53,808 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:53,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:14:53,808 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:14:53,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:14:53,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=600, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:14:53,808 INFO L87 Difference]: Start difference. First operand 125 states and 144 transitions. Second operand 27 states. [2019-08-05 11:14:54,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:54,225 INFO L93 Difference]: Finished difference Result 237 states and 272 transitions. [2019-08-05 11:14:54,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:14:54,226 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:14:54,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:54,227 INFO L225 Difference]: With dead ends: 237 [2019-08-05 11:14:54,227 INFO L226 Difference]: Without dead ends: 237 [2019-08-05 11:14:54,228 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=259, Invalid=1463, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 11:14:54,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2019-08-05 11:14:54,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 137. [2019-08-05 11:14:54,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-08-05 11:14:54,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 158 transitions. [2019-08-05 11:14:54,231 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 158 transitions. Word has length 93 [2019-08-05 11:14:54,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:54,231 INFO L475 AbstractCegarLoop]: Abstraction has 137 states and 158 transitions. [2019-08-05 11:14:54,231 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:14:54,231 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 158 transitions. [2019-08-05 11:14:54,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:14:54,232 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:54,232 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:14:54,232 INFO L418 AbstractCegarLoop]: === Iteration 216 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:54,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:54,232 INFO L82 PathProgramCache]: Analyzing trace with hash 601463581, now seen corresponding path program 212 times [2019-08-05 11:14:54,233 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:54,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:54,239 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:14:54,239 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:54,458 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 5 proven. 203 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2019-08-05 11:14:54,458 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:54,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:14:54,458 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:14:54,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:14:54,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=596, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:14:54,459 INFO L87 Difference]: Start difference. First operand 137 states and 158 transitions. Second operand 27 states. [2019-08-05 11:14:54,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:54,901 INFO L93 Difference]: Finished difference Result 269 states and 311 transitions. [2019-08-05 11:14:54,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:14:54,901 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:14:54,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:54,902 INFO L225 Difference]: With dead ends: 269 [2019-08-05 11:14:54,902 INFO L226 Difference]: Without dead ends: 269 [2019-08-05 11:14:54,903 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=262, Invalid=1378, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:14:54,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2019-08-05 11:14:54,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 149. [2019-08-05 11:14:54,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-08-05 11:14:54,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 172 transitions. [2019-08-05 11:14:54,907 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 172 transitions. Word has length 93 [2019-08-05 11:14:54,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:54,907 INFO L475 AbstractCegarLoop]: Abstraction has 149 states and 172 transitions. [2019-08-05 11:14:54,907 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:14:54,907 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 172 transitions. [2019-08-05 11:14:54,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:14:54,908 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:54,908 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 7, 7, 7, 7, 7, 7, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:14:54,908 INFO L418 AbstractCegarLoop]: === Iteration 217 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:54,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:54,908 INFO L82 PathProgramCache]: Analyzing trace with hash -1957599074, now seen corresponding path program 213 times [2019-08-05 11:14:54,909 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:54,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:54,914 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:14:54,915 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:55,125 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 11 proven. 191 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2019-08-05 11:14:55,125 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:55,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:14:55,125 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:14:55,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:14:55,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=600, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:14:55,126 INFO L87 Difference]: Start difference. First operand 149 states and 172 transitions. Second operand 27 states. [2019-08-05 11:14:55,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:55,563 INFO L93 Difference]: Finished difference Result 245 states and 281 transitions. [2019-08-05 11:14:55,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:14:55,563 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:14:55,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:55,564 INFO L225 Difference]: With dead ends: 245 [2019-08-05 11:14:55,565 INFO L226 Difference]: Without dead ends: 245 [2019-08-05 11:14:55,565 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=268, Invalid=1538, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 11:14:55,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2019-08-05 11:14:55,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 153. [2019-08-05 11:14:55,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-08-05 11:14:55,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 177 transitions. [2019-08-05 11:14:55,569 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 177 transitions. Word has length 93 [2019-08-05 11:14:55,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:55,569 INFO L475 AbstractCegarLoop]: Abstraction has 153 states and 177 transitions. [2019-08-05 11:14:55,569 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:14:55,569 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 177 transitions. [2019-08-05 11:14:55,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:14:55,570 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:55,570 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:14:55,570 INFO L418 AbstractCegarLoop]: === Iteration 218 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:55,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:55,570 INFO L82 PathProgramCache]: Analyzing trace with hash -966561763, now seen corresponding path program 214 times [2019-08-05 11:14:55,571 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:55,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:55,577 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:14:55,578 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:55,794 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 10 proven. 201 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2019-08-05 11:14:55,794 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:55,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:14:55,794 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:14:55,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:14:55,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=586, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:14:55,795 INFO L87 Difference]: Start difference. First operand 153 states and 177 transitions. Second operand 27 states. [2019-08-05 11:14:56,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:56,132 INFO L93 Difference]: Finished difference Result 245 states and 284 transitions. [2019-08-05 11:14:56,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:14:56,133 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:14:56,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:56,134 INFO L225 Difference]: With dead ends: 245 [2019-08-05 11:14:56,134 INFO L226 Difference]: Without dead ends: 245 [2019-08-05 11:14:56,134 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=246, Invalid=1160, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 11:14:56,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2019-08-05 11:14:56,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 141. [2019-08-05 11:14:56,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-08-05 11:14:56,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 163 transitions. [2019-08-05 11:14:56,138 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 163 transitions. Word has length 93 [2019-08-05 11:14:56,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:56,138 INFO L475 AbstractCegarLoop]: Abstraction has 141 states and 163 transitions. [2019-08-05 11:14:56,138 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:14:56,138 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 163 transitions. [2019-08-05 11:14:56,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:14:56,138 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:56,139 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 7, 7, 7, 7, 7, 7, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:14:56,139 INFO L418 AbstractCegarLoop]: === Iteration 219 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:56,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:56,139 INFO L82 PathProgramCache]: Analyzing trace with hash -389573730, now seen corresponding path program 215 times [2019-08-05 11:14:56,139 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:56,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:56,145 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:14:56,146 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:56,359 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 6 proven. 193 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2019-08-05 11:14:56,360 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:56,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:14:56,360 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:14:56,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:14:56,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=603, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:14:56,360 INFO L87 Difference]: Start difference. First operand 141 states and 163 transitions. Second operand 27 states. [2019-08-05 11:14:56,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:56,793 INFO L93 Difference]: Finished difference Result 265 states and 302 transitions. [2019-08-05 11:14:56,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:14:56,794 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:14:56,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:56,795 INFO L225 Difference]: With dead ends: 265 [2019-08-05 11:14:56,795 INFO L226 Difference]: Without dead ends: 265 [2019-08-05 11:14:56,795 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=264, Invalid=1542, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 11:14:56,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2019-08-05 11:14:56,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 137. [2019-08-05 11:14:56,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-08-05 11:14:56,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 158 transitions. [2019-08-05 11:14:56,800 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 158 transitions. Word has length 93 [2019-08-05 11:14:56,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:56,800 INFO L475 AbstractCegarLoop]: Abstraction has 137 states and 158 transitions. [2019-08-05 11:14:56,800 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:14:56,800 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 158 transitions. [2019-08-05 11:14:56,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:14:56,800 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:56,801 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 7, 7, 7, 7, 7, 7, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:14:56,801 INFO L418 AbstractCegarLoop]: === Iteration 220 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:56,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:56,801 INFO L82 PathProgramCache]: Analyzing trace with hash 1519328798, now seen corresponding path program 216 times [2019-08-05 11:14:56,801 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:56,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:56,807 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:14:56,808 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:57,023 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 4 proven. 195 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2019-08-05 11:14:57,024 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:57,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:14:57,024 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:14:57,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:14:57,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=603, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:14:57,025 INFO L87 Difference]: Start difference. First operand 137 states and 158 transitions. Second operand 27 states. [2019-08-05 11:14:57,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:57,492 INFO L93 Difference]: Finished difference Result 265 states and 304 transitions. [2019-08-05 11:14:57,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:14:57,492 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:14:57,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:57,493 INFO L225 Difference]: With dead ends: 265 [2019-08-05 11:14:57,494 INFO L226 Difference]: Without dead ends: 265 [2019-08-05 11:14:57,494 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=275, Invalid=1617, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 11:14:57,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2019-08-05 11:14:57,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 117. [2019-08-05 11:14:57,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-08-05 11:14:57,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 135 transitions. [2019-08-05 11:14:57,498 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 135 transitions. Word has length 93 [2019-08-05 11:14:57,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:57,498 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 135 transitions. [2019-08-05 11:14:57,498 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:14:57,498 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 135 transitions. [2019-08-05 11:14:57,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:14:57,498 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:57,499 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 7, 7, 7, 7, 7, 7, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:14:57,499 INFO L418 AbstractCegarLoop]: === Iteration 221 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:57,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:57,499 INFO L82 PathProgramCache]: Analyzing trace with hash -589734370, now seen corresponding path program 217 times [2019-08-05 11:14:57,499 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:57,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:57,505 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:14:57,506 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:57,729 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 10 proven. 189 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2019-08-05 11:14:57,730 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:57,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:14:57,730 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:14:57,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:14:57,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=603, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:14:57,731 INFO L87 Difference]: Start difference. First operand 117 states and 135 transitions. Second operand 27 states. [2019-08-05 11:14:58,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:58,131 INFO L93 Difference]: Finished difference Result 233 states and 266 transitions. [2019-08-05 11:14:58,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:14:58,132 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:14:58,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:58,133 INFO L225 Difference]: With dead ends: 233 [2019-08-05 11:14:58,133 INFO L226 Difference]: Without dead ends: 233 [2019-08-05 11:14:58,133 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=257, Invalid=1465, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 11:14:58,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2019-08-05 11:14:58,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 129. [2019-08-05 11:14:58,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-08-05 11:14:58,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 149 transitions. [2019-08-05 11:14:58,136 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 149 transitions. Word has length 93 [2019-08-05 11:14:58,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:58,137 INFO L475 AbstractCegarLoop]: Abstraction has 129 states and 149 transitions. [2019-08-05 11:14:58,137 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:14:58,137 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 149 transitions. [2019-08-05 11:14:58,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:14:58,137 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:58,137 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:14:58,137 INFO L418 AbstractCegarLoop]: === Iteration 222 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:58,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:58,138 INFO L82 PathProgramCache]: Analyzing trace with hash 401302941, now seen corresponding path program 218 times [2019-08-05 11:14:58,138 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:58,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:58,144 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:14:58,144 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:58,706 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 9 proven. 202 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2019-08-05 11:14:58,706 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:58,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:14:58,706 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:14:58,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:14:58,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=586, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:14:58,707 INFO L87 Difference]: Start difference. First operand 129 states and 149 transitions. Second operand 27 states. [2019-08-05 11:14:59,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:59,080 INFO L93 Difference]: Finished difference Result 233 states and 270 transitions. [2019-08-05 11:14:59,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:14:59,081 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:14:59,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:59,082 INFO L225 Difference]: With dead ends: 233 [2019-08-05 11:14:59,082 INFO L226 Difference]: Without dead ends: 233 [2019-08-05 11:14:59,082 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=246, Invalid=1160, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 11:14:59,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2019-08-05 11:14:59,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 121. [2019-08-05 11:14:59,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-08-05 11:14:59,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 140 transitions. [2019-08-05 11:14:59,087 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 140 transitions. Word has length 93 [2019-08-05 11:14:59,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:59,087 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 140 transitions. [2019-08-05 11:14:59,087 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:14:59,087 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 140 transitions. [2019-08-05 11:14:59,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:14:59,087 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:59,087 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 9, 9, 9, 9, 9, 9, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:14:59,088 INFO L418 AbstractCegarLoop]: === Iteration 223 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:59,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:59,088 INFO L82 PathProgramCache]: Analyzing trace with hash -1928524388, now seen corresponding path program 219 times [2019-08-05 11:14:59,088 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:59,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:59,093 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:14:59,094 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:59,316 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 7 proven. 214 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-08-05 11:14:59,317 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:59,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:14:59,317 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:14:59,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:14:59,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=575, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:14:59,317 INFO L87 Difference]: Start difference. First operand 121 states and 140 transitions. Second operand 27 states. [2019-08-05 11:14:59,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:59,639 INFO L93 Difference]: Finished difference Result 225 states and 261 transitions. [2019-08-05 11:14:59,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:14:59,639 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:14:59,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:59,640 INFO L225 Difference]: With dead ends: 225 [2019-08-05 11:14:59,640 INFO L226 Difference]: Without dead ends: 225 [2019-08-05 11:14:59,641 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=263, Invalid=1143, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 11:14:59,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2019-08-05 11:14:59,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 145. [2019-08-05 11:14:59,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-08-05 11:14:59,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 169 transitions. [2019-08-05 11:14:59,645 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 169 transitions. Word has length 93 [2019-08-05 11:14:59,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:59,646 INFO L475 AbstractCegarLoop]: Abstraction has 145 states and 169 transitions. [2019-08-05 11:14:59,646 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:14:59,646 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 169 transitions. [2019-08-05 11:14:59,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:14:59,646 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:59,646 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:14:59,646 INFO L418 AbstractCegarLoop]: === Iteration 224 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:59,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:59,647 INFO L82 PathProgramCache]: Analyzing trace with hash 1375405597, now seen corresponding path program 220 times [2019-08-05 11:14:59,647 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:59,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:59,653 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:14:59,654 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:59,885 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 8 proven. 200 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2019-08-05 11:14:59,886 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:59,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:14:59,886 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:14:59,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:14:59,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=596, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:14:59,886 INFO L87 Difference]: Start difference. First operand 145 states and 169 transitions. Second operand 27 states. [2019-08-05 11:15:00,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:00,330 INFO L93 Difference]: Finished difference Result 249 states and 286 transitions. [2019-08-05 11:15:00,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:15:00,330 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:15:00,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:00,331 INFO L225 Difference]: With dead ends: 249 [2019-08-05 11:15:00,331 INFO L226 Difference]: Without dead ends: 249 [2019-08-05 11:15:00,331 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=290, Invalid=1602, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 11:15:00,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2019-08-05 11:15:00,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 141. [2019-08-05 11:15:00,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-08-05 11:15:00,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 164 transitions. [2019-08-05 11:15:00,335 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 164 transitions. Word has length 93 [2019-08-05 11:15:00,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:00,335 INFO L475 AbstractCegarLoop]: Abstraction has 141 states and 164 transitions. [2019-08-05 11:15:00,335 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:15:00,335 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 164 transitions. [2019-08-05 11:15:00,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:15:00,336 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:00,336 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:15:00,336 INFO L418 AbstractCegarLoop]: === Iteration 225 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:00,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:00,336 INFO L82 PathProgramCache]: Analyzing trace with hash -82076899, now seen corresponding path program 221 times [2019-08-05 11:15:00,337 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:00,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:00,343 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:15:00,343 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:00,586 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 8 proven. 203 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2019-08-05 11:15:00,586 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:00,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:15:00,586 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:15:00,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:15:00,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=586, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:15:00,587 INFO L87 Difference]: Start difference. First operand 141 states and 164 transitions. Second operand 27 states. [2019-08-05 11:15:00,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:00,909 INFO L93 Difference]: Finished difference Result 253 states and 293 transitions. [2019-08-05 11:15:00,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:15:00,910 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:15:00,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:00,911 INFO L225 Difference]: With dead ends: 253 [2019-08-05 11:15:00,911 INFO L226 Difference]: Without dead ends: 253 [2019-08-05 11:15:00,911 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=246, Invalid=1160, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 11:15:00,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2019-08-05 11:15:00,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 145. [2019-08-05 11:15:00,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-08-05 11:15:00,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 169 transitions. [2019-08-05 11:15:00,915 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 169 transitions. Word has length 93 [2019-08-05 11:15:00,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:00,915 INFO L475 AbstractCegarLoop]: Abstraction has 145 states and 169 transitions. [2019-08-05 11:15:00,915 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:15:00,915 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 169 transitions. [2019-08-05 11:15:00,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:15:00,916 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:00,916 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:15:00,916 INFO L418 AbstractCegarLoop]: === Iteration 226 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:00,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:00,916 INFO L82 PathProgramCache]: Analyzing trace with hash -1990979427, now seen corresponding path program 222 times [2019-08-05 11:15:00,917 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:00,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:00,923 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:15:00,924 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:01,130 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 9 proven. 199 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2019-08-05 11:15:01,131 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:01,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:15:01,131 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:15:01,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:15:01,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=596, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:15:01,131 INFO L87 Difference]: Start difference. First operand 145 states and 169 transitions. Second operand 27 states. [2019-08-05 11:15:01,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:01,572 INFO L93 Difference]: Finished difference Result 245 states and 282 transitions. [2019-08-05 11:15:01,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:15:01,572 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:15:01,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:01,573 INFO L225 Difference]: With dead ends: 245 [2019-08-05 11:15:01,573 INFO L226 Difference]: Without dead ends: 245 [2019-08-05 11:15:01,574 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=290, Invalid=1602, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 11:15:01,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2019-08-05 11:15:01,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 149. [2019-08-05 11:15:01,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-08-05 11:15:01,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 174 transitions. [2019-08-05 11:15:01,578 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 174 transitions. Word has length 93 [2019-08-05 11:15:01,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:01,578 INFO L475 AbstractCegarLoop]: Abstraction has 149 states and 174 transitions. [2019-08-05 11:15:01,578 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:15:01,578 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 174 transitions. [2019-08-05 11:15:01,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:15:01,578 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:01,578 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:15:01,579 INFO L418 AbstractCegarLoop]: === Iteration 227 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:01,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:01,579 INFO L82 PathProgramCache]: Analyzing trace with hash -1010659171, now seen corresponding path program 223 times [2019-08-05 11:15:01,579 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:01,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:01,592 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:15:01,593 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:01,809 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 7 proven. 204 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2019-08-05 11:15:01,809 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:01,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:15:01,810 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:15:01,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:15:01,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=586, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:15:01,810 INFO L87 Difference]: Start difference. First operand 149 states and 174 transitions. Second operand 27 states. [2019-08-05 11:15:02,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:02,162 INFO L93 Difference]: Finished difference Result 261 states and 302 transitions. [2019-08-05 11:15:02,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:15:02,162 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:15:02,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:02,164 INFO L225 Difference]: With dead ends: 261 [2019-08-05 11:15:02,164 INFO L226 Difference]: Without dead ends: 261 [2019-08-05 11:15:02,164 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=246, Invalid=1160, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 11:15:02,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2019-08-05 11:15:02,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 145. [2019-08-05 11:15:02,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-08-05 11:15:02,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 169 transitions. [2019-08-05 11:15:02,168 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 169 transitions. Word has length 93 [2019-08-05 11:15:02,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:02,168 INFO L475 AbstractCegarLoop]: Abstraction has 145 states and 169 transitions. [2019-08-05 11:15:02,168 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:15:02,168 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 169 transitions. [2019-08-05 11:15:02,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:15:02,169 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:02,169 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 9, 9, 9, 9, 9, 9, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:15:02,169 INFO L418 AbstractCegarLoop]: === Iteration 228 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:02,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:02,169 INFO L82 PathProgramCache]: Analyzing trace with hash -999942116, now seen corresponding path program 224 times [2019-08-05 11:15:02,170 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:02,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:02,175 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:15:02,176 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:02,395 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 8 proven. 213 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-08-05 11:15:02,396 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:02,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:15:02,396 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:15:02,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:15:02,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=575, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:15:02,397 INFO L87 Difference]: Start difference. First operand 145 states and 169 transitions. Second operand 27 states. [2019-08-05 11:15:02,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:02,741 INFO L93 Difference]: Finished difference Result 213 states and 246 transitions. [2019-08-05 11:15:02,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:15:02,742 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:15:02,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:02,743 INFO L225 Difference]: With dead ends: 213 [2019-08-05 11:15:02,743 INFO L226 Difference]: Without dead ends: 213 [2019-08-05 11:15:02,744 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=263, Invalid=1143, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 11:15:02,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-08-05 11:15:02,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 121. [2019-08-05 11:15:02,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-08-05 11:15:02,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 139 transitions. [2019-08-05 11:15:02,747 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 139 transitions. Word has length 93 [2019-08-05 11:15:02,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:02,747 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 139 transitions. [2019-08-05 11:15:02,747 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:15:02,747 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 139 transitions. [2019-08-05 11:15:02,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:15:02,748 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:02,748 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:15:02,748 INFO L418 AbstractCegarLoop]: === Iteration 229 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:02,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:02,748 INFO L82 PathProgramCache]: Analyzing trace with hash -527279331, now seen corresponding path program 225 times [2019-08-05 11:15:02,749 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:02,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:02,755 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:15:02,756 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:03,000 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 8 proven. 203 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2019-08-05 11:15:03,001 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:03,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:15:03,001 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:15:03,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:15:03,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=586, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:15:03,001 INFO L87 Difference]: Start difference. First operand 121 states and 139 transitions. Second operand 27 states. [2019-08-05 11:15:03,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:03,349 INFO L93 Difference]: Finished difference Result 237 states and 273 transitions. [2019-08-05 11:15:03,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:15:03,349 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:15:03,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:03,350 INFO L225 Difference]: With dead ends: 237 [2019-08-05 11:15:03,350 INFO L226 Difference]: Without dead ends: 237 [2019-08-05 11:15:03,351 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=246, Invalid=1160, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 11:15:03,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2019-08-05 11:15:03,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 129. [2019-08-05 11:15:03,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-08-05 11:15:03,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 148 transitions. [2019-08-05 11:15:03,354 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 148 transitions. Word has length 93 [2019-08-05 11:15:03,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:03,354 INFO L475 AbstractCegarLoop]: Abstraction has 129 states and 148 transitions. [2019-08-05 11:15:03,354 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:15:03,354 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 148 transitions. [2019-08-05 11:15:03,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:15:03,355 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:03,355 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1] [2019-08-05 11:15:03,355 INFO L418 AbstractCegarLoop]: === Iteration 230 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:03,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:03,355 INFO L82 PathProgramCache]: Analyzing trace with hash -566364641, now seen corresponding path program 226 times [2019-08-05 11:15:03,356 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:03,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:03,362 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 11:15:03,363 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:03,819 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 4 proven. 183 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2019-08-05 11:15:03,820 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:03,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 11:15:03,820 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 11:15:03,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 11:15:03,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=538, Unknown=0, NotChecked=0, Total=650 [2019-08-05 11:15:03,821 INFO L87 Difference]: Start difference. First operand 129 states and 148 transitions. Second operand 26 states. [2019-08-05 11:15:04,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:04,045 INFO L93 Difference]: Finished difference Result 253 states and 287 transitions. [2019-08-05 11:15:04,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 11:15:04,046 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 93 [2019-08-05 11:15:04,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:04,047 INFO L225 Difference]: With dead ends: 253 [2019-08-05 11:15:04,047 INFO L226 Difference]: Without dead ends: 253 [2019-08-05 11:15:04,047 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=193, Invalid=863, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 11:15:04,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2019-08-05 11:15:04,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 145. [2019-08-05 11:15:04,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-08-05 11:15:04,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 166 transitions. [2019-08-05 11:15:04,052 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 166 transitions. Word has length 93 [2019-08-05 11:15:04,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:04,052 INFO L475 AbstractCegarLoop]: Abstraction has 145 states and 166 transitions. [2019-08-05 11:15:04,052 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 11:15:04,052 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 166 transitions. [2019-08-05 11:15:04,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:15:04,053 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:04,053 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 7, 7, 7, 7, 7, 7, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:15:04,053 INFO L418 AbstractCegarLoop]: === Iteration 231 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:04,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:04,053 INFO L82 PathProgramCache]: Analyzing trace with hash -1518316642, now seen corresponding path program 227 times [2019-08-05 11:15:04,054 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:04,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:04,060 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:15:04,061 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:04,299 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 9 proven. 190 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2019-08-05 11:15:04,300 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:04,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:15:04,300 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:15:04,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:15:04,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=603, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:15:04,301 INFO L87 Difference]: Start difference. First operand 145 states and 166 transitions. Second operand 27 states. [2019-08-05 11:15:04,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:04,731 INFO L93 Difference]: Finished difference Result 253 states and 287 transitions. [2019-08-05 11:15:04,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:15:04,732 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:15:04,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:04,733 INFO L225 Difference]: With dead ends: 253 [2019-08-05 11:15:04,733 INFO L226 Difference]: Without dead ends: 253 [2019-08-05 11:15:04,733 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=257, Invalid=1465, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 11:15:04,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2019-08-05 11:15:04,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 133. [2019-08-05 11:15:04,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-08-05 11:15:04,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 152 transitions. [2019-08-05 11:15:04,737 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 152 transitions. Word has length 93 [2019-08-05 11:15:04,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:04,737 INFO L475 AbstractCegarLoop]: Abstraction has 133 states and 152 transitions. [2019-08-05 11:15:04,737 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:15:04,737 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 152 transitions. [2019-08-05 11:15:04,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:15:04,738 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:04,738 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 7, 7, 7, 7, 7, 7, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:15:04,738 INFO L418 AbstractCegarLoop]: === Iteration 232 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:04,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:04,738 INFO L82 PathProgramCache]: Analyzing trace with hash 424672670, now seen corresponding path program 228 times [2019-08-05 11:15:04,739 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:04,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:04,745 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:15:04,746 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:04,977 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 5 proven. 194 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2019-08-05 11:15:04,978 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:04,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:15:04,978 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:15:04,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:15:04,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=603, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:15:04,978 INFO L87 Difference]: Start difference. First operand 133 states and 152 transitions. Second operand 27 states. [2019-08-05 11:15:05,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:05,456 INFO L93 Difference]: Finished difference Result 245 states and 282 transitions. [2019-08-05 11:15:05,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:15:05,457 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:15:05,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:05,458 INFO L225 Difference]: With dead ends: 245 [2019-08-05 11:15:05,458 INFO L226 Difference]: Without dead ends: 245 [2019-08-05 11:15:05,459 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=268, Invalid=1538, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 11:15:05,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2019-08-05 11:15:05,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 125. [2019-08-05 11:15:05,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-08-05 11:15:05,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 143 transitions. [2019-08-05 11:15:05,463 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 143 transitions. Word has length 93 [2019-08-05 11:15:05,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:05,463 INFO L475 AbstractCegarLoop]: Abstraction has 125 states and 143 transitions. [2019-08-05 11:15:05,463 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:15:05,463 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 143 transitions. [2019-08-05 11:15:05,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:15:05,463 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:05,464 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 7, 7, 7, 7, 7, 7, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:15:05,464 INFO L418 AbstractCegarLoop]: === Iteration 233 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:05,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:05,464 INFO L82 PathProgramCache]: Analyzing trace with hash -58707170, now seen corresponding path program 229 times [2019-08-05 11:15:05,464 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:05,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:05,471 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:15:05,472 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:05,685 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 6 proven. 196 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2019-08-05 11:15:05,686 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:05,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:15:05,686 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:15:05,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:15:05,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=600, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:15:05,687 INFO L87 Difference]: Start difference. First operand 125 states and 143 transitions. Second operand 27 states. [2019-08-05 11:15:06,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:06,083 INFO L93 Difference]: Finished difference Result 237 states and 272 transitions. [2019-08-05 11:15:06,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:15:06,084 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:15:06,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:06,085 INFO L225 Difference]: With dead ends: 237 [2019-08-05 11:15:06,085 INFO L226 Difference]: Without dead ends: 237 [2019-08-05 11:15:06,085 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=243, Invalid=1317, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 11:15:06,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2019-08-05 11:15:06,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 129. [2019-08-05 11:15:06,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-08-05 11:15:06,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 148 transitions. [2019-08-05 11:15:06,089 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 148 transitions. Word has length 93 [2019-08-05 11:15:06,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:06,089 INFO L475 AbstractCegarLoop]: Abstraction has 129 states and 148 transitions. [2019-08-05 11:15:06,089 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:15:06,089 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 148 transitions. [2019-08-05 11:15:06,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:15:06,090 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:06,090 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 7, 7, 7, 7, 7, 7, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:15:06,090 INFO L418 AbstractCegarLoop]: === Iteration 234 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:06,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:06,090 INFO L82 PathProgramCache]: Analyzing trace with hash -1967609698, now seen corresponding path program 230 times [2019-08-05 11:15:06,091 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:06,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:06,096 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:15:06,097 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:06,315 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 7 proven. 192 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2019-08-05 11:15:06,316 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:06,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:15:06,316 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:15:06,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:15:06,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=603, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:15:06,317 INFO L87 Difference]: Start difference. First operand 129 states and 148 transitions. Second operand 27 states. [2019-08-05 11:15:06,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:06,748 INFO L93 Difference]: Finished difference Result 229 states and 262 transitions. [2019-08-05 11:15:06,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:15:06,749 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:15:06,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:06,749 INFO L225 Difference]: With dead ends: 229 [2019-08-05 11:15:06,749 INFO L226 Difference]: Without dead ends: 229 [2019-08-05 11:15:06,750 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=264, Invalid=1542, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 11:15:06,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2019-08-05 11:15:06,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 133. [2019-08-05 11:15:06,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-08-05 11:15:06,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 153 transitions. [2019-08-05 11:15:06,754 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 153 transitions. Word has length 93 [2019-08-05 11:15:06,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:06,754 INFO L475 AbstractCegarLoop]: Abstraction has 133 states and 153 transitions. [2019-08-05 11:15:06,754 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:15:06,754 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 153 transitions. [2019-08-05 11:15:06,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:15:06,755 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:06,755 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:15:06,755 INFO L418 AbstractCegarLoop]: === Iteration 235 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:06,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:06,755 INFO L82 PathProgramCache]: Analyzing trace with hash -976572387, now seen corresponding path program 231 times [2019-08-05 11:15:06,756 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:06,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:06,761 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:15:06,762 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:06,987 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 6 proven. 202 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2019-08-05 11:15:06,987 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:06,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:15:06,988 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:15:06,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:15:06,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=596, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:15:06,988 INFO L87 Difference]: Start difference. First operand 133 states and 153 transitions. Second operand 27 states. [2019-08-05 11:15:07,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:07,405 INFO L93 Difference]: Finished difference Result 225 states and 260 transitions. [2019-08-05 11:15:07,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:15:07,406 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:15:07,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:07,407 INFO L225 Difference]: With dead ends: 225 [2019-08-05 11:15:07,407 INFO L226 Difference]: Without dead ends: 225 [2019-08-05 11:15:07,407 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=253, Invalid=1307, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 11:15:07,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2019-08-05 11:15:07,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 117. [2019-08-05 11:15:07,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-08-05 11:15:07,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 134 transitions. [2019-08-05 11:15:07,411 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 134 transitions. Word has length 93 [2019-08-05 11:15:07,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:07,411 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 134 transitions. [2019-08-05 11:15:07,411 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:15:07,411 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 134 transitions. [2019-08-05 11:15:07,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:15:07,412 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:07,412 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 7, 7, 7, 7, 7, 7, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:15:07,412 INFO L418 AbstractCegarLoop]: === Iteration 236 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:07,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:07,412 INFO L82 PathProgramCache]: Analyzing trace with hash -977278818, now seen corresponding path program 232 times [2019-08-05 11:15:07,413 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:07,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:07,418 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:15:07,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:07,634 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 8 proven. 194 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2019-08-05 11:15:07,634 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:07,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:15:07,634 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:15:07,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:15:07,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=600, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:15:07,635 INFO L87 Difference]: Start difference. First operand 117 states and 134 transitions. Second operand 27 states. [2019-08-05 11:15:08,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:08,045 INFO L93 Difference]: Finished difference Result 213 states and 243 transitions. [2019-08-05 11:15:08,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:15:08,046 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:15:08,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:08,047 INFO L225 Difference]: With dead ends: 213 [2019-08-05 11:15:08,047 INFO L226 Difference]: Without dead ends: 213 [2019-08-05 11:15:08,048 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=259, Invalid=1463, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 11:15:08,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-08-05 11:15:08,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 125. [2019-08-05 11:15:08,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-08-05 11:15:08,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 143 transitions. [2019-08-05 11:15:08,051 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 143 transitions. Word has length 93 [2019-08-05 11:15:08,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:08,051 INFO L475 AbstractCegarLoop]: Abstraction has 125 states and 143 transitions. [2019-08-05 11:15:08,051 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:15:08,051 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 143 transitions. [2019-08-05 11:15:08,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:15:08,052 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:08,052 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:15:08,052 INFO L418 AbstractCegarLoop]: === Iteration 237 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:08,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:08,052 INFO L82 PathProgramCache]: Analyzing trace with hash -1895144035, now seen corresponding path program 233 times [2019-08-05 11:15:08,053 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:08,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:08,059 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:15:08,060 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:08,268 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 9 proven. 202 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2019-08-05 11:15:08,268 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:08,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:15:08,269 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:15:08,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:15:08,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=586, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:15:08,269 INFO L87 Difference]: Start difference. First operand 125 states and 143 transitions. Second operand 27 states. [2019-08-05 11:15:08,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:08,743 INFO L93 Difference]: Finished difference Result 209 states and 240 transitions. [2019-08-05 11:15:08,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:15:08,743 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:15:08,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:08,744 INFO L225 Difference]: With dead ends: 209 [2019-08-05 11:15:08,745 INFO L226 Difference]: Without dead ends: 209 [2019-08-05 11:15:08,745 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=246, Invalid=1160, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 11:15:08,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-08-05 11:15:08,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 129. [2019-08-05 11:15:08,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-08-05 11:15:08,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 148 transitions. [2019-08-05 11:15:08,749 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 148 transitions. Word has length 93 [2019-08-05 11:15:08,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:08,749 INFO L475 AbstractCegarLoop]: Abstraction has 129 states and 148 transitions. [2019-08-05 11:15:08,749 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:15:08,749 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 148 transitions. [2019-08-05 11:15:08,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:15:08,750 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:08,750 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 7, 7, 7, 7, 7, 7, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:15:08,750 INFO L418 AbstractCegarLoop]: === Iteration 238 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:08,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:08,750 INFO L82 PathProgramCache]: Analyzing trace with hash 1408785950, now seen corresponding path program 234 times [2019-08-05 11:15:08,751 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:08,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:08,757 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:15:08,757 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:09,057 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 10 proven. 192 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2019-08-05 11:15:09,058 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:09,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:15:09,058 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:15:09,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:15:09,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=600, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:15:09,058 INFO L87 Difference]: Start difference. First operand 129 states and 148 transitions. Second operand 27 states. [2019-08-05 11:15:09,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:09,492 INFO L93 Difference]: Finished difference Result 209 states and 238 transitions. [2019-08-05 11:15:09,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:15:09,492 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:15:09,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:09,493 INFO L225 Difference]: With dead ends: 209 [2019-08-05 11:15:09,493 INFO L226 Difference]: Without dead ends: 209 [2019-08-05 11:15:09,494 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=268, Invalid=1538, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 11:15:09,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-08-05 11:15:09,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 101. [2019-08-05 11:15:09,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-08-05 11:15:09,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 115 transitions. [2019-08-05 11:15:09,497 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 115 transitions. Word has length 93 [2019-08-05 11:15:09,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:09,497 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 115 transitions. [2019-08-05 11:15:09,497 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:15:09,497 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 115 transitions. [2019-08-05 11:15:09,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:15:09,498 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:09,498 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1] [2019-08-05 11:15:09,498 INFO L418 AbstractCegarLoop]: === Iteration 239 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:09,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:09,498 INFO L82 PathProgramCache]: Analyzing trace with hash -342373824, now seen corresponding path program 235 times [2019-08-05 11:15:09,498 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:09,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:09,505 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:15:09,505 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:09,752 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 5 proven. 224 refuted. 0 times theorem prover too weak. 191 trivial. 0 not checked. [2019-08-05 11:15:09,752 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:09,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:15:09,752 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:15:09,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:15:09,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=699, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:15:09,753 INFO L87 Difference]: Start difference. First operand 101 states and 115 transitions. Second operand 29 states. [2019-08-05 11:15:10,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:10,295 INFO L93 Difference]: Finished difference Result 269 states and 309 transitions. [2019-08-05 11:15:10,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-05 11:15:10,296 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:15:10,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:10,297 INFO L225 Difference]: With dead ends: 269 [2019-08-05 11:15:10,297 INFO L226 Difference]: Without dead ends: 269 [2019-08-05 11:15:10,297 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 308 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=300, Invalid=1956, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 11:15:10,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2019-08-05 11:15:10,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 129. [2019-08-05 11:15:10,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-08-05 11:15:10,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 147 transitions. [2019-08-05 11:15:10,301 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 147 transitions. Word has length 101 [2019-08-05 11:15:10,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:10,301 INFO L475 AbstractCegarLoop]: Abstraction has 129 states and 147 transitions. [2019-08-05 11:15:10,301 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:15:10,301 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 147 transitions. [2019-08-05 11:15:10,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:15:10,302 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:10,302 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 10, 10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:15:10,302 INFO L418 AbstractCegarLoop]: === Iteration 240 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:10,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:10,302 INFO L82 PathProgramCache]: Analyzing trace with hash -1752724420, now seen corresponding path program 236 times [2019-08-05 11:15:10,303 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:10,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:10,309 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:15:10,309 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:10,534 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 257 refuted. 0 times theorem prover too weak. 227 trivial. 0 not checked. [2019-08-05 11:15:10,534 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:10,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 11:15:10,535 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 11:15:10,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 11:15:10,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=602, Unknown=0, NotChecked=0, Total=756 [2019-08-05 11:15:10,535 INFO L87 Difference]: Start difference. First operand 129 states and 147 transitions. Second operand 28 states. [2019-08-05 11:15:10,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:10,851 INFO L93 Difference]: Finished difference Result 229 states and 264 transitions. [2019-08-05 11:15:10,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 11:15:10,851 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 101 [2019-08-05 11:15:10,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:10,852 INFO L225 Difference]: With dead ends: 229 [2019-08-05 11:15:10,853 INFO L226 Difference]: Without dead ends: 229 [2019-08-05 11:15:10,853 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=294, Invalid=1112, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 11:15:10,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2019-08-05 11:15:10,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 157. [2019-08-05 11:15:10,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-08-05 11:15:10,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 182 transitions. [2019-08-05 11:15:10,857 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 182 transitions. Word has length 101 [2019-08-05 11:15:10,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:10,857 INFO L475 AbstractCegarLoop]: Abstraction has 157 states and 182 transitions. [2019-08-05 11:15:10,857 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 11:15:10,857 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 182 transitions. [2019-08-05 11:15:10,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:15:10,858 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:10,858 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 9, 9, 9, 9, 9, 9, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:15:10,858 INFO L418 AbstractCegarLoop]: === Iteration 241 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:10,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:10,858 INFO L82 PathProgramCache]: Analyzing trace with hash -602058307, now seen corresponding path program 237 times [2019-08-05 11:15:10,859 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:10,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:10,866 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:15:10,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:11,091 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 1 proven. 241 refuted. 0 times theorem prover too weak. 214 trivial. 0 not checked. [2019-08-05 11:15:11,091 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:11,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 11:15:11,091 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 11:15:11,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 11:15:11,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=632, Unknown=0, NotChecked=0, Total=756 [2019-08-05 11:15:11,092 INFO L87 Difference]: Start difference. First operand 157 states and 182 transitions. Second operand 28 states. [2019-08-05 11:15:11,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:11,496 INFO L93 Difference]: Finished difference Result 269 states and 308 transitions. [2019-08-05 11:15:11,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 11:15:11,496 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 101 [2019-08-05 11:15:11,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:11,497 INFO L225 Difference]: With dead ends: 269 [2019-08-05 11:15:11,497 INFO L226 Difference]: Without dead ends: 269 [2019-08-05 11:15:11,498 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=319, Invalid=1573, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 11:15:11,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2019-08-05 11:15:11,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 153. [2019-08-05 11:15:11,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-08-05 11:15:11,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 177 transitions. [2019-08-05 11:15:11,502 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 177 transitions. Word has length 101 [2019-08-05 11:15:11,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:11,502 INFO L475 AbstractCegarLoop]: Abstraction has 153 states and 177 transitions. [2019-08-05 11:15:11,502 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 11:15:11,502 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 177 transitions. [2019-08-05 11:15:11,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:15:11,503 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:11,503 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 9, 9, 9, 9, 9, 9, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:15:11,503 INFO L418 AbstractCegarLoop]: === Iteration 242 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:11,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:11,503 INFO L82 PathProgramCache]: Analyzing trace with hash -875340739, now seen corresponding path program 238 times [2019-08-05 11:15:11,504 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:11,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:11,510 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:15:11,511 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:11,747 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 2 proven. 248 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2019-08-05 11:15:11,747 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:11,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:15:11,747 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:15:11,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:15:11,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=672, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:15:11,748 INFO L87 Difference]: Start difference. First operand 153 states and 177 transitions. Second operand 29 states. [2019-08-05 11:15:12,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:12,107 INFO L93 Difference]: Finished difference Result 277 states and 320 transitions. [2019-08-05 11:15:12,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:15:12,108 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:15:12,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:12,109 INFO L225 Difference]: With dead ends: 277 [2019-08-05 11:15:12,109 INFO L226 Difference]: Without dead ends: 277 [2019-08-05 11:15:12,110 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=288, Invalid=1352, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:15:12,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2019-08-05 11:15:12,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 149. [2019-08-05 11:15:12,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-08-05 11:15:12,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 172 transitions. [2019-08-05 11:15:12,114 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 172 transitions. Word has length 101 [2019-08-05 11:15:12,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:12,114 INFO L475 AbstractCegarLoop]: Abstraction has 149 states and 172 transitions. [2019-08-05 11:15:12,114 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:15:12,114 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 172 transitions. [2019-08-05 11:15:12,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:15:12,115 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:12,115 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1] [2019-08-05 11:15:12,115 INFO L418 AbstractCegarLoop]: === Iteration 243 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:12,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:12,115 INFO L82 PathProgramCache]: Analyzing trace with hash -69091392, now seen corresponding path program 239 times [2019-08-05 11:15:12,116 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:12,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:12,122 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:15:12,123 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:12,391 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 7 proven. 222 refuted. 0 times theorem prover too weak. 191 trivial. 0 not checked. [2019-08-05 11:15:12,392 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:12,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:15:12,392 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:15:12,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:15:12,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=699, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:15:12,392 INFO L87 Difference]: Start difference. First operand 149 states and 172 transitions. Second operand 29 states. [2019-08-05 11:15:12,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:12,926 INFO L93 Difference]: Finished difference Result 285 states and 328 transitions. [2019-08-05 11:15:12,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 11:15:12,927 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:15:12,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:12,928 INFO L225 Difference]: With dead ends: 285 [2019-08-05 11:15:12,928 INFO L226 Difference]: Without dead ends: 285 [2019-08-05 11:15:12,928 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=290, Invalid=1872, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 11:15:12,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-08-05 11:15:12,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 153. [2019-08-05 11:15:12,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-08-05 11:15:12,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 177 transitions. [2019-08-05 11:15:12,932 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 177 transitions. Word has length 101 [2019-08-05 11:15:12,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:12,932 INFO L475 AbstractCegarLoop]: Abstraction has 153 states and 177 transitions. [2019-08-05 11:15:12,932 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:15:12,932 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 177 transitions. [2019-08-05 11:15:12,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:15:12,933 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:12,933 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 9, 9, 9, 9, 9, 9, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:15:12,933 INFO L418 AbstractCegarLoop]: === Iteration 244 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:12,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:12,933 INFO L82 PathProgramCache]: Analyzing trace with hash -1580095811, now seen corresponding path program 240 times [2019-08-05 11:15:12,934 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:12,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:12,941 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:15:12,942 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:13,177 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 3 proven. 247 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2019-08-05 11:15:13,177 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:13,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:15:13,178 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:15:13,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:15:13,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=672, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:15:13,178 INFO L87 Difference]: Start difference. First operand 153 states and 177 transitions. Second operand 29 states. [2019-08-05 11:15:13,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:13,583 INFO L93 Difference]: Finished difference Result 289 states and 336 transitions. [2019-08-05 11:15:13,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:15:13,583 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:15:13,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:13,585 INFO L225 Difference]: With dead ends: 289 [2019-08-05 11:15:13,585 INFO L226 Difference]: Without dead ends: 289 [2019-08-05 11:15:13,585 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=288, Invalid=1352, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:15:13,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-08-05 11:15:13,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 161. [2019-08-05 11:15:13,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-08-05 11:15:13,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 186 transitions. [2019-08-05 11:15:13,589 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 186 transitions. Word has length 101 [2019-08-05 11:15:13,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:13,590 INFO L475 AbstractCegarLoop]: Abstraction has 161 states and 186 transitions. [2019-08-05 11:15:13,590 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:15:13,590 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 186 transitions. [2019-08-05 11:15:13,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:15:13,590 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:13,590 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 8, 8, 8, 8, 8, 8, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:15:13,590 INFO L418 AbstractCegarLoop]: === Iteration 245 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:13,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:13,591 INFO L82 PathProgramCache]: Analyzing trace with hash -429429698, now seen corresponding path program 241 times [2019-08-05 11:15:13,591 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:13,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:13,598 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:15:13,599 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:14,122 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 2 proven. 229 refuted. 0 times theorem prover too weak. 205 trivial. 0 not checked. [2019-08-05 11:15:14,123 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:14,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 11:15:14,123 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 11:15:14,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 11:15:14,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=648, Unknown=0, NotChecked=0, Total=756 [2019-08-05 11:15:14,124 INFO L87 Difference]: Start difference. First operand 161 states and 186 transitions. Second operand 28 states. [2019-08-05 11:15:14,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:14,500 INFO L93 Difference]: Finished difference Result 289 states and 330 transitions. [2019-08-05 11:15:14,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 11:15:14,500 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 101 [2019-08-05 11:15:14,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:14,501 INFO L225 Difference]: With dead ends: 289 [2019-08-05 11:15:14,501 INFO L226 Difference]: Without dead ends: 289 [2019-08-05 11:15:14,502 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=262, Invalid=1378, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:15:14,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-08-05 11:15:14,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 149. [2019-08-05 11:15:14,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-08-05 11:15:14,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 172 transitions. [2019-08-05 11:15:14,506 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 172 transitions. Word has length 101 [2019-08-05 11:15:14,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:14,506 INFO L475 AbstractCegarLoop]: Abstraction has 149 states and 172 transitions. [2019-08-05 11:15:14,506 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 11:15:14,506 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 172 transitions. [2019-08-05 11:15:14,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:15:14,507 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:14,507 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 7, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1] [2019-08-05 11:15:14,507 INFO L418 AbstractCegarLoop]: === Iteration 246 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:14,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:14,507 INFO L82 PathProgramCache]: Analyzing trace with hash -1219757505, now seen corresponding path program 242 times [2019-08-05 11:15:14,507 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:14,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:14,513 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:15:14,514 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:14,760 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 6 proven. 226 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2019-08-05 11:15:14,760 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:14,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:15:14,761 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:15:14,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:15:14,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=704, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:15:14,761 INFO L87 Difference]: Start difference. First operand 149 states and 172 transitions. Second operand 29 states. [2019-08-05 11:15:15,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:15,236 INFO L93 Difference]: Finished difference Result 277 states and 324 transitions. [2019-08-05 11:15:15,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 11:15:15,237 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:15:15,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:15,238 INFO L225 Difference]: With dead ends: 277 [2019-08-05 11:15:15,238 INFO L226 Difference]: Without dead ends: 277 [2019-08-05 11:15:15,239 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=278, Invalid=1702, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 11:15:15,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2019-08-05 11:15:15,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 137. [2019-08-05 11:15:15,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-08-05 11:15:15,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 158 transitions. [2019-08-05 11:15:15,243 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 158 transitions. Word has length 101 [2019-08-05 11:15:15,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:15,243 INFO L475 AbstractCegarLoop]: Abstraction has 137 states and 158 transitions. [2019-08-05 11:15:15,243 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:15:15,243 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 158 transitions. [2019-08-05 11:15:15,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:15:15,244 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:15,244 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1] [2019-08-05 11:15:15,244 INFO L418 AbstractCegarLoop]: === Iteration 247 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:15,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:15,244 INFO L82 PathProgramCache]: Analyzing trace with hash -1191496384, now seen corresponding path program 243 times [2019-08-05 11:15:15,245 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:15,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:15,250 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:15:15,251 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:15,524 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 9 proven. 220 refuted. 0 times theorem prover too weak. 191 trivial. 0 not checked. [2019-08-05 11:15:15,524 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:15,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:15:15,524 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:15:15,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:15:15,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=699, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:15:15,525 INFO L87 Difference]: Start difference. First operand 137 states and 158 transitions. Second operand 29 states. [2019-08-05 11:15:15,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:15,975 INFO L93 Difference]: Finished difference Result 269 states and 308 transitions. [2019-08-05 11:15:15,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:15:15,976 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:15:15,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:15,977 INFO L225 Difference]: With dead ends: 269 [2019-08-05 11:15:15,977 INFO L226 Difference]: Without dead ends: 269 [2019-08-05 11:15:15,977 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=263, Invalid=1629, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 11:15:15,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2019-08-05 11:15:15,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 149. [2019-08-05 11:15:15,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-08-05 11:15:15,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 172 transitions. [2019-08-05 11:15:15,981 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 172 transitions. Word has length 101 [2019-08-05 11:15:15,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:15,981 INFO L475 AbstractCegarLoop]: Abstraction has 149 states and 172 transitions. [2019-08-05 11:15:15,981 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:15:15,981 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 172 transitions. [2019-08-05 11:15:15,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:15:15,982 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:15,982 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 9, 9, 9, 9, 9, 9, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:15:15,982 INFO L418 AbstractCegarLoop]: === Iteration 248 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:15,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:15,982 INFO L82 PathProgramCache]: Analyzing trace with hash -457690819, now seen corresponding path program 244 times [2019-08-05 11:15:15,983 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:15,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:15,990 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:15:15,991 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:16,253 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 4 proven. 246 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2019-08-05 11:15:16,254 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:16,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:15:16,254 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:15:16,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:15:16,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=672, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:15:16,254 INFO L87 Difference]: Start difference. First operand 149 states and 172 transitions. Second operand 29 states. [2019-08-05 11:15:16,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:16,633 INFO L93 Difference]: Finished difference Result 289 states and 337 transitions. [2019-08-05 11:15:16,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:15:16,634 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:15:16,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:16,635 INFO L225 Difference]: With dead ends: 289 [2019-08-05 11:15:16,635 INFO L226 Difference]: Without dead ends: 289 [2019-08-05 11:15:16,635 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=288, Invalid=1352, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:15:16,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-08-05 11:15:16,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 161. [2019-08-05 11:15:16,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-08-05 11:15:16,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 186 transitions. [2019-08-05 11:15:16,639 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 186 transitions. Word has length 101 [2019-08-05 11:15:16,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:16,640 INFO L475 AbstractCegarLoop]: Abstraction has 161 states and 186 transitions. [2019-08-05 11:15:16,640 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:15:16,640 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 186 transitions. [2019-08-05 11:15:16,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:15:16,640 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:16,640 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 7, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1] [2019-08-05 11:15:16,640 INFO L418 AbstractCegarLoop]: === Iteration 249 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:16,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:16,641 INFO L82 PathProgramCache]: Analyzing trace with hash 1952804799, now seen corresponding path program 245 times [2019-08-05 11:15:16,641 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:16,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:16,647 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 11:15:16,648 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:16,898 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 8 proven. 228 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2019-08-05 11:15:16,898 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:16,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:15:16,899 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:15:16,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:15:16,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=700, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:15:16,899 INFO L87 Difference]: Start difference. First operand 161 states and 186 transitions. Second operand 29 states. [2019-08-05 11:15:17,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:17,374 INFO L93 Difference]: Finished difference Result 281 states and 327 transitions. [2019-08-05 11:15:17,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:15:17,374 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:15:17,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:17,376 INFO L225 Difference]: With dead ends: 281 [2019-08-05 11:15:17,376 INFO L226 Difference]: Without dead ends: 281 [2019-08-05 11:15:17,376 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=254, Invalid=1468, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 11:15:17,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-08-05 11:15:17,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 153. [2019-08-05 11:15:17,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-08-05 11:15:17,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 177 transitions. [2019-08-05 11:15:17,380 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 177 transitions. Word has length 101 [2019-08-05 11:15:17,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:17,380 INFO L475 AbstractCegarLoop]: Abstraction has 153 states and 177 transitions. [2019-08-05 11:15:17,380 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:15:17,380 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 177 transitions. [2019-08-05 11:15:17,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:15:17,381 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:17,381 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 8, 8, 8, 8, 8, 8, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:15:17,381 INFO L418 AbstractCegarLoop]: === Iteration 250 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:17,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:17,381 INFO L82 PathProgramCache]: Analyzing trace with hash 692975294, now seen corresponding path program 246 times [2019-08-05 11:15:17,382 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:17,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:17,389 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:15:17,390 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:17,644 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 5 proven. 234 refuted. 0 times theorem prover too weak. 197 trivial. 0 not checked. [2019-08-05 11:15:17,644 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:17,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:15:17,645 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:15:17,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:15:17,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=695, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:15:17,645 INFO L87 Difference]: Start difference. First operand 153 states and 177 transitions. Second operand 29 states. [2019-08-05 11:15:18,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:18,138 INFO L93 Difference]: Finished difference Result 273 states and 314 transitions. [2019-08-05 11:15:18,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:15:18,138 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:15:18,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:18,140 INFO L225 Difference]: With dead ends: 273 [2019-08-05 11:15:18,140 INFO L226 Difference]: Without dead ends: 273 [2019-08-05 11:15:18,140 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 316 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=311, Invalid=1851, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 11:15:18,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2019-08-05 11:15:18,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 149. [2019-08-05 11:15:18,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-08-05 11:15:18,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 172 transitions. [2019-08-05 11:15:18,144 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 172 transitions. Word has length 101 [2019-08-05 11:15:18,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:18,144 INFO L475 AbstractCegarLoop]: Abstraction has 149 states and 172 transitions. [2019-08-05 11:15:18,145 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:15:18,145 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 172 transitions. [2019-08-05 11:15:18,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:15:18,145 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:18,145 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 8, 8, 8, 8, 8, 8, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:15:18,145 INFO L418 AbstractCegarLoop]: === Iteration 251 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:18,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:18,145 INFO L82 PathProgramCache]: Analyzing trace with hash 419692862, now seen corresponding path program 247 times [2019-08-05 11:15:18,146 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:18,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:18,152 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:15:18,153 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:18,405 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 3 proven. 236 refuted. 0 times theorem prover too weak. 197 trivial. 0 not checked. [2019-08-05 11:15:18,405 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:18,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:15:18,406 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:15:18,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:15:18,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=695, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:15:18,406 INFO L87 Difference]: Start difference. First operand 149 states and 172 transitions. Second operand 29 states. [2019-08-05 11:15:19,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:19,082 INFO L93 Difference]: Finished difference Result 285 states and 328 transitions. [2019-08-05 11:15:19,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:15:19,083 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:15:19,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:19,083 INFO L225 Difference]: With dead ends: 285 [2019-08-05 11:15:19,083 INFO L226 Difference]: Without dead ends: 285 [2019-08-05 11:15:19,084 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=301, Invalid=1769, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 11:15:19,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-08-05 11:15:19,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 137. [2019-08-05 11:15:19,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-08-05 11:15:19,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 158 transitions. [2019-08-05 11:15:19,087 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 158 transitions. Word has length 101 [2019-08-05 11:15:19,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:19,088 INFO L475 AbstractCegarLoop]: Abstraction has 137 states and 158 transitions. [2019-08-05 11:15:19,088 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:15:19,088 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 158 transitions. [2019-08-05 11:15:19,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:15:19,088 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:19,088 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 7, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1] [2019-08-05 11:15:19,088 INFO L418 AbstractCegarLoop]: === Iteration 252 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:19,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:19,089 INFO L82 PathProgramCache]: Analyzing trace with hash -1637407425, now seen corresponding path program 248 times [2019-08-05 11:15:19,089 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:19,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:19,096 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 11:15:19,097 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:19,393 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 7 proven. 229 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2019-08-05 11:15:19,394 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:19,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:15:19,394 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:15:19,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:15:19,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=700, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:15:19,394 INFO L87 Difference]: Start difference. First operand 137 states and 158 transitions. Second operand 29 states. [2019-08-05 11:15:19,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:19,801 INFO L93 Difference]: Finished difference Result 253 states and 294 transitions. [2019-08-05 11:15:19,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:15:19,802 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:15:19,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:19,803 INFO L225 Difference]: With dead ends: 253 [2019-08-05 11:15:19,803 INFO L226 Difference]: Without dead ends: 253 [2019-08-05 11:15:19,803 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=254, Invalid=1468, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 11:15:19,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2019-08-05 11:15:19,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 141. [2019-08-05 11:15:19,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-08-05 11:15:19,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 163 transitions. [2019-08-05 11:15:19,807 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 163 transitions. Word has length 101 [2019-08-05 11:15:19,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:19,808 INFO L475 AbstractCegarLoop]: Abstraction has 141 states and 163 transitions. [2019-08-05 11:15:19,808 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:15:19,808 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 163 transitions. [2019-08-05 11:15:19,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:15:19,808 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:19,808 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 7, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1] [2019-08-05 11:15:19,808 INFO L418 AbstractCegarLoop]: === Iteration 253 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:19,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:19,809 INFO L82 PathProgramCache]: Analyzing trace with hash -1364124993, now seen corresponding path program 249 times [2019-08-05 11:15:19,809 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:19,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:19,815 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:15:19,816 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:20,089 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 8 proven. 224 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2019-08-05 11:15:20,090 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:20,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:15:20,090 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:15:20,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:15:20,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=704, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:15:20,091 INFO L87 Difference]: Start difference. First operand 141 states and 163 transitions. Second operand 29 states. [2019-08-05 11:15:20,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:20,578 INFO L93 Difference]: Finished difference Result 265 states and 307 transitions. [2019-08-05 11:15:20,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:15:20,579 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:15:20,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:20,580 INFO L225 Difference]: With dead ends: 265 [2019-08-05 11:15:20,580 INFO L226 Difference]: Without dead ends: 265 [2019-08-05 11:15:20,580 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=281, Invalid=1789, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 11:15:20,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2019-08-05 11:15:20,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 145. [2019-08-05 11:15:20,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-08-05 11:15:20,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 168 transitions. [2019-08-05 11:15:20,585 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 168 transitions. Word has length 101 [2019-08-05 11:15:20,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:20,585 INFO L475 AbstractCegarLoop]: Abstraction has 145 states and 168 transitions. [2019-08-05 11:15:20,585 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:15:20,585 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 168 transitions. [2019-08-05 11:15:20,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:15:20,586 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:20,586 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 8, 8, 8, 8, 8, 8, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:15:20,586 INFO L418 AbstractCegarLoop]: === Iteration 254 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:20,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:20,586 INFO L82 PathProgramCache]: Analyzing trace with hash 1780176190, now seen corresponding path program 250 times [2019-08-05 11:15:20,587 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:20,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:20,595 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:15:20,596 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:20,903 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 7 proven. 232 refuted. 0 times theorem prover too weak. 197 trivial. 0 not checked. [2019-08-05 11:15:20,903 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:20,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:15:20,904 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:15:20,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:15:20,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=695, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:15:20,904 INFO L87 Difference]: Start difference. First operand 145 states and 168 transitions. Second operand 29 states. [2019-08-05 11:15:21,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:21,343 INFO L93 Difference]: Finished difference Result 265 states and 311 transitions. [2019-08-05 11:15:21,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:15:21,343 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:15:21,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:21,344 INFO L225 Difference]: With dead ends: 265 [2019-08-05 11:15:21,344 INFO L226 Difference]: Without dead ends: 265 [2019-08-05 11:15:21,345 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=265, Invalid=1457, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 11:15:21,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2019-08-05 11:15:21,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 125. [2019-08-05 11:15:21,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-08-05 11:15:21,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 144 transitions. [2019-08-05 11:15:21,349 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 144 transitions. Word has length 101 [2019-08-05 11:15:21,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:21,349 INFO L475 AbstractCegarLoop]: Abstraction has 125 states and 144 transitions. [2019-08-05 11:15:21,349 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:15:21,349 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 144 transitions. [2019-08-05 11:15:21,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:15:21,349 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:21,350 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1] [2019-08-05 11:15:21,350 INFO L418 AbstractCegarLoop]: === Iteration 255 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:21,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:21,350 INFO L82 PathProgramCache]: Analyzing trace with hash -932959552, now seen corresponding path program 251 times [2019-08-05 11:15:21,351 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:21,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:21,357 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:15:21,358 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:21,679 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 11 proven. 218 refuted. 0 times theorem prover too weak. 191 trivial. 0 not checked. [2019-08-05 11:15:21,679 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:21,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:15:21,679 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:15:21,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:15:21,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=699, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:15:21,680 INFO L87 Difference]: Start difference. First operand 125 states and 144 transitions. Second operand 29 states. [2019-08-05 11:15:22,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:22,098 INFO L93 Difference]: Finished difference Result 237 states and 271 transitions. [2019-08-05 11:15:22,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:15:22,099 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:15:22,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:22,100 INFO L225 Difference]: With dead ends: 237 [2019-08-05 11:15:22,100 INFO L226 Difference]: Without dead ends: 237 [2019-08-05 11:15:22,101 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=257, Invalid=1549, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 11:15:22,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2019-08-05 11:15:22,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 145. [2019-08-05 11:15:22,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-08-05 11:15:22,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 167 transitions. [2019-08-05 11:15:22,104 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 167 transitions. Word has length 101 [2019-08-05 11:15:22,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:22,104 INFO L475 AbstractCegarLoop]: Abstraction has 145 states and 167 transitions. [2019-08-05 11:15:22,104 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:15:22,104 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 167 transitions. [2019-08-05 11:15:22,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:15:22,105 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:22,105 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 9, 9, 9, 9, 9, 9, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:15:22,105 INFO L418 AbstractCegarLoop]: === Iteration 256 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:22,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:22,106 INFO L82 PathProgramCache]: Analyzing trace with hash 723975101, now seen corresponding path program 252 times [2019-08-05 11:15:22,106 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:22,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:22,115 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:15:22,116 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:22,399 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 5 proven. 245 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2019-08-05 11:15:22,399 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:22,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:15:22,400 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:15:22,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:15:22,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=672, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:15:22,400 INFO L87 Difference]: Start difference. First operand 145 states and 167 transitions. Second operand 29 states. [2019-08-05 11:15:22,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:22,942 INFO L93 Difference]: Finished difference Result 281 states and 328 transitions. [2019-08-05 11:15:22,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:15:22,945 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:15:22,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:22,947 INFO L225 Difference]: With dead ends: 281 [2019-08-05 11:15:22,947 INFO L226 Difference]: Without dead ends: 281 [2019-08-05 11:15:22,947 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=288, Invalid=1352, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:15:22,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-08-05 11:15:22,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 161. [2019-08-05 11:15:22,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-08-05 11:15:22,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 186 transitions. [2019-08-05 11:15:22,952 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 186 transitions. Word has length 101 [2019-08-05 11:15:22,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:22,952 INFO L475 AbstractCegarLoop]: Abstraction has 161 states and 186 transitions. [2019-08-05 11:15:22,952 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:15:22,953 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 186 transitions. [2019-08-05 11:15:22,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:15:22,953 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:22,953 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 7, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1] [2019-08-05 11:15:22,954 INFO L418 AbstractCegarLoop]: === Iteration 257 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:22,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:22,954 INFO L82 PathProgramCache]: Analyzing trace with hash -2083625665, now seen corresponding path program 253 times [2019-08-05 11:15:22,955 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:22,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:22,963 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 11:15:22,964 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:23,230 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 10 proven. 226 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2019-08-05 11:15:23,230 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:23,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:15:23,230 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:15:23,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:15:23,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=700, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:15:23,231 INFO L87 Difference]: Start difference. First operand 161 states and 186 transitions. Second operand 29 states. [2019-08-05 11:15:23,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:23,701 INFO L93 Difference]: Finished difference Result 257 states and 299 transitions. [2019-08-05 11:15:23,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:15:23,701 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:15:23,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:23,702 INFO L225 Difference]: With dead ends: 257 [2019-08-05 11:15:23,702 INFO L226 Difference]: Without dead ends: 257 [2019-08-05 11:15:23,702 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=270, Invalid=1622, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 11:15:23,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2019-08-05 11:15:23,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 153. [2019-08-05 11:15:23,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-08-05 11:15:23,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 177 transitions. [2019-08-05 11:15:23,706 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 177 transitions. Word has length 101 [2019-08-05 11:15:23,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:23,706 INFO L475 AbstractCegarLoop]: Abstraction has 153 states and 177 transitions. [2019-08-05 11:15:23,706 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:15:23,706 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 177 transitions. [2019-08-05 11:15:23,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:15:23,706 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:23,707 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 7, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1] [2019-08-05 11:15:23,707 INFO L418 AbstractCegarLoop]: === Iteration 258 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:23,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:23,707 INFO L82 PathProgramCache]: Analyzing trace with hash -1378870593, now seen corresponding path program 254 times [2019-08-05 11:15:23,707 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:23,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:23,714 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 33 conjunts are in the unsatisfiable core [2019-08-05 11:15:23,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:24,198 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 9 proven. 227 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2019-08-05 11:15:24,198 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:24,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:15:24,199 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:15:24,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:15:24,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=692, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:15:24,199 INFO L87 Difference]: Start difference. First operand 153 states and 177 transitions. Second operand 29 states. [2019-08-05 11:15:24,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:24,621 INFO L93 Difference]: Finished difference Result 241 states and 280 transitions. [2019-08-05 11:15:24,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:15:24,622 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:15:24,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:24,623 INFO L225 Difference]: With dead ends: 241 [2019-08-05 11:15:24,623 INFO L226 Difference]: Without dead ends: 241 [2019-08-05 11:15:24,624 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=256, Invalid=1384, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:15:24,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2019-08-05 11:15:24,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 157. [2019-08-05 11:15:24,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-08-05 11:15:24,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 182 transitions. [2019-08-05 11:15:24,627 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 182 transitions. Word has length 101 [2019-08-05 11:15:24,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:24,628 INFO L475 AbstractCegarLoop]: Abstraction has 157 states and 182 transitions. [2019-08-05 11:15:24,628 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:15:24,628 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 182 transitions. [2019-08-05 11:15:24,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:15:24,628 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:24,628 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 8, 8, 8, 8, 8, 8, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:15:24,629 INFO L418 AbstractCegarLoop]: === Iteration 259 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:24,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:24,629 INFO L82 PathProgramCache]: Analyzing trace with hash 1874641214, now seen corresponding path program 255 times [2019-08-05 11:15:24,629 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:24,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:24,636 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:15:24,636 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:24,880 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 6 proven. 233 refuted. 0 times theorem prover too weak. 197 trivial. 0 not checked. [2019-08-05 11:15:24,880 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:24,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:15:24,880 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:15:24,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:15:24,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=695, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:15:24,881 INFO L87 Difference]: Start difference. First operand 157 states and 182 transitions. Second operand 29 states. [2019-08-05 11:15:25,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:25,339 INFO L93 Difference]: Finished difference Result 277 states and 320 transitions. [2019-08-05 11:15:25,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:15:25,340 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:15:25,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:25,341 INFO L225 Difference]: With dead ends: 277 [2019-08-05 11:15:25,341 INFO L226 Difference]: Without dead ends: 277 [2019-08-05 11:15:25,341 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 315 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=311, Invalid=1851, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 11:15:25,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2019-08-05 11:15:25,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 153. [2019-08-05 11:15:25,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-08-05 11:15:25,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 177 transitions. [2019-08-05 11:15:25,346 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 177 transitions. Word has length 101 [2019-08-05 11:15:25,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:25,346 INFO L475 AbstractCegarLoop]: Abstraction has 153 states and 177 transitions. [2019-08-05 11:15:25,346 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:15:25,346 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 177 transitions. [2019-08-05 11:15:25,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:15:25,346 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:25,346 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 8, 8, 8, 8, 8, 8, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:15:25,347 INFO L418 AbstractCegarLoop]: === Iteration 260 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:25,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:25,347 INFO L82 PathProgramCache]: Analyzing trace with hash 1601358782, now seen corresponding path program 256 times [2019-08-05 11:15:25,347 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:25,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:25,353 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 11:15:25,354 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:25,593 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 5 proven. 238 refuted. 0 times theorem prover too weak. 193 trivial. 0 not checked. [2019-08-05 11:15:25,593 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:25,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:15:25,593 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:15:25,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:15:25,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=684, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:15:25,594 INFO L87 Difference]: Start difference. First operand 153 states and 177 transitions. Second operand 29 states. [2019-08-05 11:15:25,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:25,959 INFO L93 Difference]: Finished difference Result 265 states and 307 transitions. [2019-08-05 11:15:25,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:15:25,960 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:15:25,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:25,961 INFO L225 Difference]: With dead ends: 265 [2019-08-05 11:15:25,961 INFO L226 Difference]: Without dead ends: 265 [2019-08-05 11:15:25,961 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=269, Invalid=1371, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:15:25,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2019-08-05 11:15:25,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 149. [2019-08-05 11:15:25,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-08-05 11:15:25,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 172 transitions. [2019-08-05 11:15:25,965 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 172 transitions. Word has length 101 [2019-08-05 11:15:25,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:25,965 INFO L475 AbstractCegarLoop]: Abstraction has 149 states and 172 transitions. [2019-08-05 11:15:25,965 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:15:25,965 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 172 transitions. [2019-08-05 11:15:25,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:15:25,966 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:25,966 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 7, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1] [2019-08-05 11:15:25,966 INFO L418 AbstractCegarLoop]: === Iteration 261 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:25,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:25,966 INFO L82 PathProgramCache]: Analyzing trace with hash -1105588161, now seen corresponding path program 257 times [2019-08-05 11:15:25,967 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:25,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:25,972 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 11:15:25,973 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:26,213 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 12 proven. 224 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2019-08-05 11:15:26,213 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:26,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:15:26,214 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:15:26,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:15:26,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=700, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:15:26,214 INFO L87 Difference]: Start difference. First operand 149 states and 172 transitions. Second operand 29 states. [2019-08-05 11:15:26,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:26,772 INFO L93 Difference]: Finished difference Result 245 states and 283 transitions. [2019-08-05 11:15:26,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:15:26,773 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:15:26,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:26,774 INFO L225 Difference]: With dead ends: 245 [2019-08-05 11:15:26,774 INFO L226 Difference]: Without dead ends: 245 [2019-08-05 11:15:26,774 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=287, Invalid=1783, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 11:15:26,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2019-08-05 11:15:26,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 153. [2019-08-05 11:15:26,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-08-05 11:15:26,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 177 transitions. [2019-08-05 11:15:26,778 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 177 transitions. Word has length 101 [2019-08-05 11:15:26,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:26,778 INFO L475 AbstractCegarLoop]: Abstraction has 153 states and 177 transitions. [2019-08-05 11:15:26,778 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:15:26,778 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 177 transitions. [2019-08-05 11:15:26,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:15:26,778 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:26,778 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 8, 8, 8, 8, 8, 8, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:15:26,779 INFO L418 AbstractCegarLoop]: === Iteration 262 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:26,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:26,779 INFO L82 PathProgramCache]: Analyzing trace with hash 2038713022, now seen corresponding path program 258 times [2019-08-05 11:15:26,779 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:26,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:26,785 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 11:15:26,786 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:27,053 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 11 proven. 232 refuted. 0 times theorem prover too weak. 193 trivial. 0 not checked. [2019-08-05 11:15:27,053 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:27,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:15:27,053 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:15:27,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:15:27,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=684, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:15:27,054 INFO L87 Difference]: Start difference. First operand 153 states and 177 transitions. Second operand 29 states. [2019-08-05 11:15:27,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:27,482 INFO L93 Difference]: Finished difference Result 245 states and 286 transitions. [2019-08-05 11:15:27,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:15:27,483 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:15:27,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:27,484 INFO L225 Difference]: With dead ends: 245 [2019-08-05 11:15:27,484 INFO L226 Difference]: Without dead ends: 245 [2019-08-05 11:15:27,484 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=269, Invalid=1371, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:15:27,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2019-08-05 11:15:27,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 137. [2019-08-05 11:15:27,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-08-05 11:15:27,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 158 transitions. [2019-08-05 11:15:27,489 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 158 transitions. Word has length 101 [2019-08-05 11:15:27,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:27,489 INFO L475 AbstractCegarLoop]: Abstraction has 137 states and 158 transitions. [2019-08-05 11:15:27,489 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:15:27,489 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 158 transitions. [2019-08-05 11:15:27,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:15:27,489 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:27,489 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 8, 8, 8, 8, 8, 8, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:15:27,490 INFO L418 AbstractCegarLoop]: === Iteration 263 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:27,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:27,490 INFO L82 PathProgramCache]: Analyzing trace with hash 896603710, now seen corresponding path program 259 times [2019-08-05 11:15:27,490 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:27,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:27,496 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:15:27,497 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:27,772 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 4 proven. 235 refuted. 0 times theorem prover too weak. 197 trivial. 0 not checked. [2019-08-05 11:15:27,772 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:27,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:15:27,773 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:15:27,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:15:27,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=695, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:15:27,773 INFO L87 Difference]: Start difference. First operand 137 states and 158 transitions. Second operand 29 states. [2019-08-05 11:15:28,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:28,287 INFO L93 Difference]: Finished difference Result 269 states and 312 transitions. [2019-08-05 11:15:28,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:15:28,287 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:15:28,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:28,289 INFO L225 Difference]: With dead ends: 269 [2019-08-05 11:15:28,289 INFO L226 Difference]: Without dead ends: 269 [2019-08-05 11:15:28,289 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=292, Invalid=1688, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 11:15:28,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2019-08-05 11:15:28,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 145. [2019-08-05 11:15:28,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-08-05 11:15:28,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 167 transitions. [2019-08-05 11:15:28,294 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 167 transitions. Word has length 101 [2019-08-05 11:15:28,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:28,294 INFO L475 AbstractCegarLoop]: Abstraction has 145 states and 167 transitions. [2019-08-05 11:15:28,294 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:15:28,294 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 167 transitions. [2019-08-05 11:15:28,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:15:28,294 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:28,294 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 7, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1] [2019-08-05 11:15:28,295 INFO L418 AbstractCegarLoop]: === Iteration 264 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:28,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:28,295 INFO L82 PathProgramCache]: Analyzing trace with hash 2047269823, now seen corresponding path program 260 times [2019-08-05 11:15:28,295 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:28,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:28,302 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:15:28,303 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:28,559 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 3 proven. 221 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2019-08-05 11:15:28,559 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:28,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 11:15:28,559 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 11:15:28,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 11:15:28,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=650, Unknown=0, NotChecked=0, Total=756 [2019-08-05 11:15:28,560 INFO L87 Difference]: Start difference. First operand 145 states and 167 transitions. Second operand 28 states. [2019-08-05 11:15:28,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:28,899 INFO L93 Difference]: Finished difference Result 265 states and 302 transitions. [2019-08-05 11:15:28,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 11:15:28,900 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 101 [2019-08-05 11:15:28,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:28,901 INFO L225 Difference]: With dead ends: 265 [2019-08-05 11:15:28,901 INFO L226 Difference]: Without dead ends: 265 [2019-08-05 11:15:28,902 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=222, Invalid=1184, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 11:15:28,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2019-08-05 11:15:28,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 125. [2019-08-05 11:15:28,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-08-05 11:15:28,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 144 transitions. [2019-08-05 11:15:28,906 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 144 transitions. Word has length 101 [2019-08-05 11:15:28,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:28,906 INFO L475 AbstractCegarLoop]: Abstraction has 125 states and 144 transitions. [2019-08-05 11:15:28,906 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 11:15:28,906 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 144 transitions. [2019-08-05 11:15:28,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:15:28,907 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:28,907 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 7, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1] [2019-08-05 11:15:28,907 INFO L418 AbstractCegarLoop]: === Iteration 265 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:28,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:28,907 INFO L82 PathProgramCache]: Analyzing trace with hash 1734430783, now seen corresponding path program 261 times [2019-08-05 11:15:28,908 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:28,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:28,914 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 11:15:28,915 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:29,494 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 9 proven. 227 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2019-08-05 11:15:29,494 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:29,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:15:29,495 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:15:29,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:15:29,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=700, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:15:29,495 INFO L87 Difference]: Start difference. First operand 125 states and 144 transitions. Second operand 29 states. [2019-08-05 11:15:29,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:29,947 INFO L93 Difference]: Finished difference Result 253 states and 292 transitions. [2019-08-05 11:15:29,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:15:29,947 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:15:29,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:29,948 INFO L225 Difference]: With dead ends: 253 [2019-08-05 11:15:29,948 INFO L226 Difference]: Without dead ends: 253 [2019-08-05 11:15:29,949 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=278, Invalid=1702, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 11:15:29,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2019-08-05 11:15:29,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 137. [2019-08-05 11:15:29,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-08-05 11:15:29,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 158 transitions. [2019-08-05 11:15:29,953 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 158 transitions. Word has length 101 [2019-08-05 11:15:29,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:29,953 INFO L475 AbstractCegarLoop]: Abstraction has 137 states and 158 transitions. [2019-08-05 11:15:29,953 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:15:29,953 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 158 transitions. [2019-08-05 11:15:29,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:15:29,954 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:29,954 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 7, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1] [2019-08-05 11:15:29,954 INFO L418 AbstractCegarLoop]: === Iteration 266 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:29,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:29,954 INFO L82 PathProgramCache]: Analyzing trace with hash 2007713215, now seen corresponding path program 262 times [2019-08-05 11:15:29,954 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:29,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:29,960 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 11:15:29,961 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:30,221 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 11 proven. 225 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2019-08-05 11:15:30,222 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:30,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:15:30,222 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:15:30,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:15:30,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=700, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:15:30,222 INFO L87 Difference]: Start difference. First operand 137 states and 158 transitions. Second operand 29 states. [2019-08-05 11:15:30,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:30,652 INFO L93 Difference]: Finished difference Result 241 states and 278 transitions. [2019-08-05 11:15:30,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:15:30,653 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:15:30,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:30,654 INFO L225 Difference]: With dead ends: 241 [2019-08-05 11:15:30,654 INFO L226 Difference]: Without dead ends: 241 [2019-08-05 11:15:30,654 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=287, Invalid=1783, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 11:15:30,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2019-08-05 11:15:30,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 141. [2019-08-05 11:15:30,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-08-05 11:15:30,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 163 transitions. [2019-08-05 11:15:30,659 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 163 transitions. Word has length 101 [2019-08-05 11:15:30,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:30,659 INFO L475 AbstractCegarLoop]: Abstraction has 141 states and 163 transitions. [2019-08-05 11:15:30,659 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:15:30,659 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 163 transitions. [2019-08-05 11:15:30,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:15:30,659 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:30,660 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 8, 8, 8, 8, 8, 8, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:15:30,660 INFO L418 AbstractCegarLoop]: === Iteration 267 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:30,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:30,660 INFO L82 PathProgramCache]: Analyzing trace with hash 857047102, now seen corresponding path program 263 times [2019-08-05 11:15:30,660 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:30,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:30,666 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 11:15:30,667 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:30,903 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 10 proven. 233 refuted. 0 times theorem prover too weak. 193 trivial. 0 not checked. [2019-08-05 11:15:30,904 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:30,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:15:30,904 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:15:30,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:15:30,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=684, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:15:30,904 INFO L87 Difference]: Start difference. First operand 141 states and 163 transitions. Second operand 29 states. [2019-08-05 11:15:31,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:31,318 INFO L93 Difference]: Finished difference Result 249 states and 291 transitions. [2019-08-05 11:15:31,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:15:31,319 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:15:31,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:31,320 INFO L225 Difference]: With dead ends: 249 [2019-08-05 11:15:31,320 INFO L226 Difference]: Without dead ends: 249 [2019-08-05 11:15:31,320 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=269, Invalid=1371, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:15:31,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2019-08-05 11:15:31,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 129. [2019-08-05 11:15:31,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-08-05 11:15:31,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 149 transitions. [2019-08-05 11:15:31,325 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 149 transitions. Word has length 101 [2019-08-05 11:15:31,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:31,325 INFO L475 AbstractCegarLoop]: Abstraction has 129 states and 149 transitions. [2019-08-05 11:15:31,325 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:15:31,325 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 149 transitions. [2019-08-05 11:15:31,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:15:31,326 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:31,326 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 9, 9, 9, 9, 9, 9, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:15:31,326 INFO L418 AbstractCegarLoop]: === Iteration 268 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:31,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:31,326 INFO L82 PathProgramCache]: Analyzing trace with hash 465438269, now seen corresponding path program 264 times [2019-08-05 11:15:31,327 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:31,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:31,333 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:15:31,334 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:31,630 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 6 proven. 244 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2019-08-05 11:15:31,630 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:31,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:15:31,630 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:15:31,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:15:31,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=672, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:15:31,631 INFO L87 Difference]: Start difference. First operand 129 states and 149 transitions. Second operand 29 states. [2019-08-05 11:15:32,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:32,030 INFO L93 Difference]: Finished difference Result 253 states and 296 transitions. [2019-08-05 11:15:32,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:15:32,031 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:15:32,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:32,032 INFO L225 Difference]: With dead ends: 253 [2019-08-05 11:15:32,032 INFO L226 Difference]: Without dead ends: 253 [2019-08-05 11:15:32,033 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=288, Invalid=1352, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:15:32,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2019-08-05 11:15:32,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 149. [2019-08-05 11:15:32,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-08-05 11:15:32,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 173 transitions. [2019-08-05 11:15:32,036 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 173 transitions. Word has length 101 [2019-08-05 11:15:32,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:32,036 INFO L475 AbstractCegarLoop]: Abstraction has 149 states and 173 transitions. [2019-08-05 11:15:32,037 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:15:32,037 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 173 transitions. [2019-08-05 11:15:32,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:15:32,037 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:32,037 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 7, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1] [2019-08-05 11:15:32,037 INFO L418 AbstractCegarLoop]: === Iteration 269 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:32,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:32,038 INFO L82 PathProgramCache]: Analyzing trace with hash 885308223, now seen corresponding path program 265 times [2019-08-05 11:15:32,038 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:32,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:32,044 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:15:32,045 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:32,284 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 10 proven. 222 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2019-08-05 11:15:32,284 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:32,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:15:32,285 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:15:32,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:15:32,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=704, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:15:32,285 INFO L87 Difference]: Start difference. First operand 149 states and 173 transitions. Second operand 29 states. [2019-08-05 11:15:32,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:32,744 INFO L93 Difference]: Finished difference Result 277 states and 319 transitions. [2019-08-05 11:15:32,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:15:32,745 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:15:32,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:32,746 INFO L225 Difference]: With dead ends: 277 [2019-08-05 11:15:32,746 INFO L226 Difference]: Without dead ends: 277 [2019-08-05 11:15:32,746 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=274, Invalid=1706, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 11:15:32,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2019-08-05 11:15:32,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 161. [2019-08-05 11:15:32,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-08-05 11:15:32,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 187 transitions. [2019-08-05 11:15:32,752 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 187 transitions. Word has length 101 [2019-08-05 11:15:32,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:32,752 INFO L475 AbstractCegarLoop]: Abstraction has 161 states and 187 transitions. [2019-08-05 11:15:32,752 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:15:32,752 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 187 transitions. [2019-08-05 11:15:32,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:15:32,753 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:32,753 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 8, 8, 8, 8, 8, 8, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:15:32,753 INFO L418 AbstractCegarLoop]: === Iteration 270 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:32,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:32,753 INFO L82 PathProgramCache]: Analyzing trace with hash 1616104382, now seen corresponding path program 266 times [2019-08-05 11:15:32,754 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:32,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:32,762 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:15:32,763 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:33,126 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 7 proven. 232 refuted. 0 times theorem prover too weak. 197 trivial. 0 not checked. [2019-08-05 11:15:33,126 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:33,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:15:33,127 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:15:33,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:15:33,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=695, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:15:33,127 INFO L87 Difference]: Start difference. First operand 161 states and 187 transitions. Second operand 29 states. [2019-08-05 11:15:33,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:33,620 INFO L93 Difference]: Finished difference Result 273 states and 316 transitions. [2019-08-05 11:15:33,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:15:33,621 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:15:33,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:33,621 INFO L225 Difference]: With dead ends: 273 [2019-08-05 11:15:33,621 INFO L226 Difference]: Without dead ends: 273 [2019-08-05 11:15:33,622 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 307 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=311, Invalid=1851, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 11:15:33,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2019-08-05 11:15:33,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 157. [2019-08-05 11:15:33,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-08-05 11:15:33,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 182 transitions. [2019-08-05 11:15:33,626 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 182 transitions. Word has length 101 [2019-08-05 11:15:33,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:33,627 INFO L475 AbstractCegarLoop]: Abstraction has 157 states and 182 transitions. [2019-08-05 11:15:33,627 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:15:33,627 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 182 transitions. [2019-08-05 11:15:33,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:15:33,627 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:33,627 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 8, 8, 8, 8, 8, 8, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:15:33,627 INFO L418 AbstractCegarLoop]: === Iteration 271 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:33,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:33,628 INFO L82 PathProgramCache]: Analyzing trace with hash 1342821950, now seen corresponding path program 267 times [2019-08-05 11:15:33,628 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:33,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:33,634 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 11:15:33,635 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:33,951 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 6 proven. 237 refuted. 0 times theorem prover too weak. 193 trivial. 0 not checked. [2019-08-05 11:15:33,951 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:33,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:15:33,951 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:15:33,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:15:33,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=684, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:15:33,952 INFO L87 Difference]: Start difference. First operand 157 states and 182 transitions. Second operand 29 states. [2019-08-05 11:15:34,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:34,496 INFO L93 Difference]: Finished difference Result 265 states and 308 transitions. [2019-08-05 11:15:34,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:15:34,497 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:15:34,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:34,498 INFO L225 Difference]: With dead ends: 265 [2019-08-05 11:15:34,498 INFO L226 Difference]: Without dead ends: 265 [2019-08-05 11:15:34,499 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=269, Invalid=1371, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:15:34,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2019-08-05 11:15:34,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 153. [2019-08-05 11:15:34,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-08-05 11:15:34,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 177 transitions. [2019-08-05 11:15:34,502 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 177 transitions. Word has length 101 [2019-08-05 11:15:34,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:34,502 INFO L475 AbstractCegarLoop]: Abstraction has 153 states and 177 transitions. [2019-08-05 11:15:34,503 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:15:34,503 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 177 transitions. [2019-08-05 11:15:34,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:15:34,503 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:34,503 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 8, 8, 8, 8, 8, 8, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:15:34,503 INFO L418 AbstractCegarLoop]: === Iteration 272 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:34,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:34,504 INFO L82 PathProgramCache]: Analyzing trace with hash 638066878, now seen corresponding path program 268 times [2019-08-05 11:15:34,504 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:34,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:34,510 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 11:15:34,511 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:34,748 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 7 proven. 236 refuted. 0 times theorem prover too weak. 193 trivial. 0 not checked. [2019-08-05 11:15:34,748 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:34,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:15:34,748 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:15:34,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:15:34,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=684, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:15:34,749 INFO L87 Difference]: Start difference. First operand 153 states and 177 transitions. Second operand 29 states. [2019-08-05 11:15:35,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:35,153 INFO L93 Difference]: Finished difference Result 257 states and 299 transitions. [2019-08-05 11:15:35,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:15:35,153 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:15:35,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:35,154 INFO L225 Difference]: With dead ends: 257 [2019-08-05 11:15:35,155 INFO L226 Difference]: Without dead ends: 257 [2019-08-05 11:15:35,155 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=269, Invalid=1371, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:15:35,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2019-08-05 11:15:35,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 161. [2019-08-05 11:15:35,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-08-05 11:15:35,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 186 transitions. [2019-08-05 11:15:35,159 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 186 transitions. Word has length 101 [2019-08-05 11:15:35,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:35,159 INFO L475 AbstractCegarLoop]: Abstraction has 161 states and 186 transitions. [2019-08-05 11:15:35,159 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:15:35,159 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 186 transitions. [2019-08-05 11:15:35,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:15:35,160 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:35,160 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 7, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1] [2019-08-05 11:15:35,160 INFO L418 AbstractCegarLoop]: === Iteration 273 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:35,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:35,160 INFO L82 PathProgramCache]: Analyzing trace with hash 1788732991, now seen corresponding path program 269 times [2019-08-05 11:15:35,161 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:35,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:35,169 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:15:35,170 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:35,465 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 8 proven. 224 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2019-08-05 11:15:35,466 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:35,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:15:35,466 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:15:35,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:15:35,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=704, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:15:35,466 INFO L87 Difference]: Start difference. First operand 161 states and 186 transitions. Second operand 29 states. [2019-08-05 11:15:35,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:35,904 INFO L93 Difference]: Finished difference Result 257 states and 295 transitions. [2019-08-05 11:15:35,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:15:35,904 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:15:35,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:35,905 INFO L225 Difference]: With dead ends: 257 [2019-08-05 11:15:35,906 INFO L226 Difference]: Without dead ends: 257 [2019-08-05 11:15:35,906 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=274, Invalid=1706, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 11:15:35,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2019-08-05 11:15:35,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 149. [2019-08-05 11:15:35,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-08-05 11:15:35,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 172 transitions. [2019-08-05 11:15:35,910 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 172 transitions. Word has length 101 [2019-08-05 11:15:35,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:35,910 INFO L475 AbstractCegarLoop]: Abstraction has 149 states and 172 transitions. [2019-08-05 11:15:35,910 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:15:35,910 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 172 transitions. [2019-08-05 11:15:35,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:15:35,911 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:35,911 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 8, 8, 8, 8, 8, 8, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:15:35,911 INFO L418 AbstractCegarLoop]: === Iteration 274 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:35,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:35,911 INFO L82 PathProgramCache]: Analyzing trace with hash -265357890, now seen corresponding path program 270 times [2019-08-05 11:15:35,912 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:35,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:35,918 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 11:15:35,919 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:36,164 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 9 proven. 234 refuted. 0 times theorem prover too weak. 193 trivial. 0 not checked. [2019-08-05 11:15:36,164 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:36,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:15:36,165 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:15:36,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:15:36,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=684, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:15:36,165 INFO L87 Difference]: Start difference. First operand 149 states and 172 transitions. Second operand 29 states. [2019-08-05 11:15:36,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:36,560 INFO L93 Difference]: Finished difference Result 265 states and 309 transitions. [2019-08-05 11:15:36,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:15:36,561 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:15:36,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:36,562 INFO L225 Difference]: With dead ends: 265 [2019-08-05 11:15:36,562 INFO L226 Difference]: Without dead ends: 265 [2019-08-05 11:15:36,562 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=269, Invalid=1371, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:15:36,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2019-08-05 11:15:36,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 141. [2019-08-05 11:15:36,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-08-05 11:15:36,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 163 transitions. [2019-08-05 11:15:36,566 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 163 transitions. Word has length 101 [2019-08-05 11:15:36,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:36,567 INFO L475 AbstractCegarLoop]: Abstraction has 141 states and 163 transitions. [2019-08-05 11:15:36,567 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:15:36,567 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 163 transitions. [2019-08-05 11:15:36,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:15:36,567 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:36,567 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 8, 8, 8, 8, 8, 8, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:15:36,567 INFO L418 AbstractCegarLoop]: === Iteration 275 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:36,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:36,568 INFO L82 PathProgramCache]: Analyzing trace with hash 1760471870, now seen corresponding path program 271 times [2019-08-05 11:15:36,568 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:36,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:36,574 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:15:36,575 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:36,816 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 5 proven. 234 refuted. 0 times theorem prover too weak. 197 trivial. 0 not checked. [2019-08-05 11:15:36,816 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:36,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:15:36,816 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:15:36,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:15:36,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=695, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:15:36,817 INFO L87 Difference]: Start difference. First operand 141 states and 163 transitions. Second operand 29 states. [2019-08-05 11:15:37,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:37,300 INFO L93 Difference]: Finished difference Result 269 states and 314 transitions. [2019-08-05 11:15:37,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:15:37,301 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:15:37,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:37,302 INFO L225 Difference]: With dead ends: 269 [2019-08-05 11:15:37,302 INFO L226 Difference]: Without dead ends: 269 [2019-08-05 11:15:37,302 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=283, Invalid=1609, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 11:15:37,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2019-08-05 11:15:37,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 153. [2019-08-05 11:15:37,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-08-05 11:15:37,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 177 transitions. [2019-08-05 11:15:37,306 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 177 transitions. Word has length 101 [2019-08-05 11:15:37,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:37,306 INFO L475 AbstractCegarLoop]: Abstraction has 153 states and 177 transitions. [2019-08-05 11:15:37,306 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:15:37,306 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 177 transitions. [2019-08-05 11:15:37,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:15:37,307 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:37,307 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 7, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1] [2019-08-05 11:15:37,307 INFO L418 AbstractCegarLoop]: === Iteration 276 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:37,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:37,307 INFO L82 PathProgramCache]: Analyzing trace with hash -1383829313, now seen corresponding path program 272 times [2019-08-05 11:15:37,308 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:37,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:37,314 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:15:37,315 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:37,575 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 6 proven. 226 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2019-08-05 11:15:37,576 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:37,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:15:37,576 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:15:37,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:15:37,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=704, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:15:37,576 INFO L87 Difference]: Start difference. First operand 153 states and 177 transitions. Second operand 29 states. [2019-08-05 11:15:38,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:38,072 INFO L93 Difference]: Finished difference Result 269 states and 309 transitions. [2019-08-05 11:15:38,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:15:38,072 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:15:38,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:38,073 INFO L225 Difference]: With dead ends: 269 [2019-08-05 11:15:38,074 INFO L226 Difference]: Without dead ends: 269 [2019-08-05 11:15:38,074 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=281, Invalid=1789, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 11:15:38,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2019-08-05 11:15:38,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 149. [2019-08-05 11:15:38,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-08-05 11:15:38,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 172 transitions. [2019-08-05 11:15:38,078 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 172 transitions. Word has length 101 [2019-08-05 11:15:38,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:38,078 INFO L475 AbstractCegarLoop]: Abstraction has 149 states and 172 transitions. [2019-08-05 11:15:38,078 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:15:38,078 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 172 transitions. [2019-08-05 11:15:38,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:15:38,078 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:38,078 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 8, 8, 8, 8, 8, 8, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:15:38,079 INFO L418 AbstractCegarLoop]: === Iteration 277 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:38,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:38,079 INFO L82 PathProgramCache]: Analyzing trace with hash 439397182, now seen corresponding path program 273 times [2019-08-05 11:15:38,079 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:38,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:38,086 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 11:15:38,088 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:38,404 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 8 proven. 235 refuted. 0 times theorem prover too weak. 193 trivial. 0 not checked. [2019-08-05 11:15:38,405 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:38,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:15:38,405 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:15:38,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:15:38,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=684, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:15:38,406 INFO L87 Difference]: Start difference. First operand 149 states and 172 transitions. Second operand 29 states. [2019-08-05 11:15:38,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:38,785 INFO L93 Difference]: Finished difference Result 273 states and 317 transitions. [2019-08-05 11:15:38,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:15:38,785 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:15:38,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:38,786 INFO L225 Difference]: With dead ends: 273 [2019-08-05 11:15:38,786 INFO L226 Difference]: Without dead ends: 273 [2019-08-05 11:15:38,787 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=269, Invalid=1371, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:15:38,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2019-08-05 11:15:38,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 153. [2019-08-05 11:15:38,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-08-05 11:15:38,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 177 transitions. [2019-08-05 11:15:38,790 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 177 transitions. Word has length 101 [2019-08-05 11:15:38,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:38,791 INFO L475 AbstractCegarLoop]: Abstraction has 153 states and 177 transitions. [2019-08-05 11:15:38,791 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:15:38,791 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 177 transitions. [2019-08-05 11:15:38,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:15:38,791 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:38,791 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 7, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1] [2019-08-05 11:15:38,791 INFO L418 AbstractCegarLoop]: === Iteration 278 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:38,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:38,792 INFO L82 PathProgramCache]: Analyzing trace with hash -1657111745, now seen corresponding path program 274 times [2019-08-05 11:15:38,792 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:38,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:38,798 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:15:38,799 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:39,044 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 4 proven. 228 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2019-08-05 11:15:39,045 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:39,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:15:39,045 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:15:39,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:15:39,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=704, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:15:39,045 INFO L87 Difference]: Start difference. First operand 153 states and 177 transitions. Second operand 29 states. [2019-08-05 11:15:39,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:39,711 INFO L93 Difference]: Finished difference Result 277 states and 320 transitions. [2019-08-05 11:15:39,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 11:15:39,712 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:15:39,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:39,713 INFO L225 Difference]: With dead ends: 277 [2019-08-05 11:15:39,713 INFO L226 Difference]: Without dead ends: 277 [2019-08-05 11:15:39,714 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=292, Invalid=1870, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 11:15:39,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2019-08-05 11:15:39,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 133. [2019-08-05 11:15:39,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-08-05 11:15:39,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 154 transitions. [2019-08-05 11:15:39,718 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 154 transitions. Word has length 101 [2019-08-05 11:15:39,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:39,718 INFO L475 AbstractCegarLoop]: Abstraction has 133 states and 154 transitions. [2019-08-05 11:15:39,718 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:15:39,718 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 154 transitions. [2019-08-05 11:15:39,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:15:39,718 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:39,719 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 8, 8, 8, 8, 8, 8, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:15:39,719 INFO L418 AbstractCegarLoop]: === Iteration 279 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:39,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:39,719 INFO L82 PathProgramCache]: Analyzing trace with hash 712679614, now seen corresponding path program 275 times [2019-08-05 11:15:39,719 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:39,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:39,726 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:15:39,727 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:39,977 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 9 proven. 230 refuted. 0 times theorem prover too weak. 197 trivial. 0 not checked. [2019-08-05 11:15:39,977 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:39,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:15:39,977 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:15:39,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:15:39,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=695, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:15:39,978 INFO L87 Difference]: Start difference. First operand 133 states and 154 transitions. Second operand 29 states. [2019-08-05 11:15:40,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:40,507 INFO L93 Difference]: Finished difference Result 253 states and 292 transitions. [2019-08-05 11:15:40,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:15:40,507 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:15:40,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:40,508 INFO L225 Difference]: With dead ends: 253 [2019-08-05 11:15:40,509 INFO L226 Difference]: Without dead ends: 253 [2019-08-05 11:15:40,509 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 297 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=311, Invalid=1851, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 11:15:40,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2019-08-05 11:15:40,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 137. [2019-08-05 11:15:40,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-08-05 11:15:40,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 159 transitions. [2019-08-05 11:15:40,513 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 159 transitions. Word has length 101 [2019-08-05 11:15:40,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:40,513 INFO L475 AbstractCegarLoop]: Abstraction has 137 states and 159 transitions. [2019-08-05 11:15:40,514 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:15:40,514 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 159 transitions. [2019-08-05 11:15:40,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:15:40,514 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:40,514 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 9, 9, 9, 9, 9, 9, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:15:40,514 INFO L418 AbstractCegarLoop]: === Iteration 280 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:40,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:40,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1830637757, now seen corresponding path program 276 times [2019-08-05 11:15:40,515 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:40,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:40,521 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:15:40,522 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:40,767 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 7 proven. 243 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2019-08-05 11:15:40,767 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:40,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:15:40,768 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:15:40,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:15:40,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=672, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:15:40,768 INFO L87 Difference]: Start difference. First operand 137 states and 159 transitions. Second operand 29 states. [2019-08-05 11:15:41,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:41,152 INFO L93 Difference]: Finished difference Result 241 states and 282 transitions. [2019-08-05 11:15:41,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:15:41,152 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:15:41,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:41,153 INFO L225 Difference]: With dead ends: 241 [2019-08-05 11:15:41,153 INFO L226 Difference]: Without dead ends: 241 [2019-08-05 11:15:41,154 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=288, Invalid=1352, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:15:41,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2019-08-05 11:15:41,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 161. [2019-08-05 11:15:41,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-08-05 11:15:41,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 188 transitions. [2019-08-05 11:15:41,157 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 188 transitions. Word has length 101 [2019-08-05 11:15:41,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:41,158 INFO L475 AbstractCegarLoop]: Abstraction has 161 states and 188 transitions. [2019-08-05 11:15:41,158 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:15:41,158 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 188 transitions. [2019-08-05 11:15:41,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:15:41,158 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:41,158 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 9, 9, 9, 9, 9, 9, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:15:41,158 INFO L418 AbstractCegarLoop]: === Iteration 281 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:41,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:41,159 INFO L82 PathProgramCache]: Analyzing trace with hash -437986499, now seen corresponding path program 277 times [2019-08-05 11:15:41,159 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:41,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:41,166 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:15:41,167 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:41,430 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 8 proven. 242 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2019-08-05 11:15:41,431 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:41,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:15:41,431 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:15:41,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:15:41,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=672, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:15:41,431 INFO L87 Difference]: Start difference. First operand 161 states and 188 transitions. Second operand 29 states. [2019-08-05 11:15:41,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:41,809 INFO L93 Difference]: Finished difference Result 253 states and 296 transitions. [2019-08-05 11:15:41,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:15:41,809 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:15:41,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:41,810 INFO L225 Difference]: With dead ends: 253 [2019-08-05 11:15:41,810 INFO L226 Difference]: Without dead ends: 253 [2019-08-05 11:15:41,811 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=288, Invalid=1352, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:15:41,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2019-08-05 11:15:41,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 133. [2019-08-05 11:15:41,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-08-05 11:15:41,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 154 transitions. [2019-08-05 11:15:41,814 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 154 transitions. Word has length 101 [2019-08-05 11:15:41,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:41,815 INFO L475 AbstractCegarLoop]: Abstraction has 133 states and 154 transitions. [2019-08-05 11:15:41,815 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:15:41,815 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 154 transitions. [2019-08-05 11:15:41,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:15:41,815 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:41,815 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 8, 8, 8, 8, 8, 8, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:15:41,815 INFO L418 AbstractCegarLoop]: === Iteration 282 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:41,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:41,816 INFO L82 PathProgramCache]: Analyzing trace with hash -1313663426, now seen corresponding path program 278 times [2019-08-05 11:15:41,816 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:41,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:41,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:15:41,823 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:42,073 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 8 proven. 231 refuted. 0 times theorem prover too weak. 197 trivial. 0 not checked. [2019-08-05 11:15:42,073 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:42,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:15:42,074 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:15:42,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:15:42,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=695, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:15:42,074 INFO L87 Difference]: Start difference. First operand 133 states and 154 transitions. Second operand 29 states. [2019-08-05 11:15:42,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:42,584 INFO L93 Difference]: Finished difference Result 229 states and 264 transitions. [2019-08-05 11:15:42,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:15:42,585 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:15:42,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:42,586 INFO L225 Difference]: With dead ends: 229 [2019-08-05 11:15:42,586 INFO L226 Difference]: Without dead ends: 229 [2019-08-05 11:15:42,586 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 302 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=311, Invalid=1851, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 11:15:42,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2019-08-05 11:15:42,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 129. [2019-08-05 11:15:42,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-08-05 11:15:42,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 149 transitions. [2019-08-05 11:15:42,590 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 149 transitions. Word has length 101 [2019-08-05 11:15:42,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:42,590 INFO L475 AbstractCegarLoop]: Abstraction has 129 states and 149 transitions. [2019-08-05 11:15:42,590 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:15:42,591 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 149 transitions. [2019-08-05 11:15:42,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:15:42,591 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:42,591 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1] [2019-08-05 11:15:42,591 INFO L418 AbstractCegarLoop]: === Iteration 283 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:42,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:42,591 INFO L82 PathProgramCache]: Analyzing trace with hash 1335664704, now seen corresponding path program 279 times [2019-08-05 11:15:42,592 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:42,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:42,597 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:15:42,598 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:42,827 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 4 proven. 217 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2019-08-05 11:15:42,828 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:42,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 11:15:42,828 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 11:15:42,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 11:15:42,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=638, Unknown=0, NotChecked=0, Total=756 [2019-08-05 11:15:42,829 INFO L87 Difference]: Start difference. First operand 129 states and 149 transitions. Second operand 28 states. [2019-08-05 11:15:43,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:43,100 INFO L93 Difference]: Finished difference Result 233 states and 266 transitions. [2019-08-05 11:15:43,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 11:15:43,100 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 101 [2019-08-05 11:15:43,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:43,101 INFO L225 Difference]: With dead ends: 233 [2019-08-05 11:15:43,102 INFO L226 Difference]: Without dead ends: 233 [2019-08-05 11:15:43,102 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=199, Invalid=991, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 11:15:43,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2019-08-05 11:15:43,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 145. [2019-08-05 11:15:43,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-08-05 11:15:43,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 167 transitions. [2019-08-05 11:15:43,106 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 167 transitions. Word has length 101 [2019-08-05 11:15:43,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:43,107 INFO L475 AbstractCegarLoop]: Abstraction has 145 states and 167 transitions. [2019-08-05 11:15:43,107 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 11:15:43,107 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 167 transitions. [2019-08-05 11:15:43,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:15:43,108 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:43,108 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 8, 8, 8, 8, 8, 8, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:15:43,108 INFO L418 AbstractCegarLoop]: === Iteration 284 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:43,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:43,108 INFO L82 PathProgramCache]: Analyzing trace with hash -1586945858, now seen corresponding path program 280 times [2019-08-05 11:15:43,109 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:43,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:43,118 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 11:15:43,119 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:43,720 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 7 proven. 236 refuted. 0 times theorem prover too weak. 193 trivial. 0 not checked. [2019-08-05 11:15:43,720 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:43,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:15:43,720 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:15:43,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:15:43,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=684, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:15:43,721 INFO L87 Difference]: Start difference. First operand 145 states and 167 transitions. Second operand 29 states. [2019-08-05 11:15:44,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:44,096 INFO L93 Difference]: Finished difference Result 241 states and 279 transitions. [2019-08-05 11:15:44,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:15:44,097 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:15:44,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:44,098 INFO L225 Difference]: With dead ends: 241 [2019-08-05 11:15:44,098 INFO L226 Difference]: Without dead ends: 241 [2019-08-05 11:15:44,098 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=269, Invalid=1371, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:15:44,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2019-08-05 11:15:44,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 141. [2019-08-05 11:15:44,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-08-05 11:15:44,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 162 transitions. [2019-08-05 11:15:44,102 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 162 transitions. Word has length 101 [2019-08-05 11:15:44,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:44,102 INFO L475 AbstractCegarLoop]: Abstraction has 141 states and 162 transitions. [2019-08-05 11:15:44,102 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:15:44,103 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 162 transitions. [2019-08-05 11:15:44,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:15:44,103 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:44,103 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 8, 8, 8, 8, 8, 8, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:15:44,103 INFO L418 AbstractCegarLoop]: === Iteration 285 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:44,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:44,103 INFO L82 PathProgramCache]: Analyzing trace with hash 2003266366, now seen corresponding path program 281 times [2019-08-05 11:15:44,104 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:44,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:44,110 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 11:15:44,111 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:44,348 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 8 proven. 235 refuted. 0 times theorem prover too weak. 193 trivial. 0 not checked. [2019-08-05 11:15:44,348 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:44,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:15:44,348 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:15:44,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:15:44,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=684, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:15:44,349 INFO L87 Difference]: Start difference. First operand 141 states and 162 transitions. Second operand 29 states. [2019-08-05 11:15:44,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:44,921 INFO L93 Difference]: Finished difference Result 237 states and 275 transitions. [2019-08-05 11:15:44,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:15:44,921 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:15:44,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:44,922 INFO L225 Difference]: With dead ends: 237 [2019-08-05 11:15:44,923 INFO L226 Difference]: Without dead ends: 237 [2019-08-05 11:15:44,923 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=269, Invalid=1371, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:15:44,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2019-08-05 11:15:44,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 149. [2019-08-05 11:15:44,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-08-05 11:15:44,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 171 transitions. [2019-08-05 11:15:44,927 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 171 transitions. Word has length 101 [2019-08-05 11:15:44,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:44,928 INFO L475 AbstractCegarLoop]: Abstraction has 149 states and 171 transitions. [2019-08-05 11:15:44,928 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:15:44,928 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 171 transitions. [2019-08-05 11:15:44,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:15:44,928 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:44,928 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 7, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1] [2019-08-05 11:15:44,928 INFO L418 AbstractCegarLoop]: === Iteration 286 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:44,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:44,929 INFO L82 PathProgramCache]: Analyzing trace with hash -1141034817, now seen corresponding path program 282 times [2019-08-05 11:15:44,929 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:44,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:44,935 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:15:44,936 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:45,174 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 9 proven. 223 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2019-08-05 11:15:45,174 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:45,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:15:45,174 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:15:45,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:15:45,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=704, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:15:45,175 INFO L87 Difference]: Start difference. First operand 149 states and 171 transitions. Second operand 29 states. [2019-08-05 11:15:45,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:45,598 INFO L93 Difference]: Finished difference Result 237 states and 271 transitions. [2019-08-05 11:15:45,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:15:45,598 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:15:45,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:45,600 INFO L225 Difference]: With dead ends: 237 [2019-08-05 11:15:45,600 INFO L226 Difference]: Without dead ends: 237 [2019-08-05 11:15:45,600 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=274, Invalid=1706, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 11:15:45,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2019-08-05 11:15:45,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 137. [2019-08-05 11:15:45,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-08-05 11:15:45,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 157 transitions. [2019-08-05 11:15:45,604 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 157 transitions. Word has length 101 [2019-08-05 11:15:45,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:45,605 INFO L475 AbstractCegarLoop]: Abstraction has 137 states and 157 transitions. [2019-08-05 11:15:45,605 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:15:45,605 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 157 transitions. [2019-08-05 11:15:45,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:15:45,605 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:45,605 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 8, 8, 8, 8, 8, 8, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:15:45,606 INFO L418 AbstractCegarLoop]: === Iteration 287 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:45,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:45,606 INFO L82 PathProgramCache]: Analyzing trace with hash -1169295938, now seen corresponding path program 283 times [2019-08-05 11:15:45,606 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:45,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:45,615 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 11:15:45,617 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:45,903 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 9 proven. 234 refuted. 0 times theorem prover too weak. 193 trivial. 0 not checked. [2019-08-05 11:15:45,904 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:45,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:15:45,904 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:15:45,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:15:45,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=684, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:15:45,904 INFO L87 Difference]: Start difference. First operand 137 states and 157 transitions. Second operand 29 states. [2019-08-05 11:15:46,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:46,286 INFO L93 Difference]: Finished difference Result 225 states and 261 transitions. [2019-08-05 11:15:46,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:15:46,287 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:15:46,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:46,287 INFO L225 Difference]: With dead ends: 225 [2019-08-05 11:15:46,287 INFO L226 Difference]: Without dead ends: 225 [2019-08-05 11:15:46,288 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=269, Invalid=1371, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:15:46,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2019-08-05 11:15:46,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 149. [2019-08-05 11:15:46,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-08-05 11:15:46,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 171 transitions. [2019-08-05 11:15:46,291 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 171 transitions. Word has length 101 [2019-08-05 11:15:46,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:46,291 INFO L475 AbstractCegarLoop]: Abstraction has 149 states and 171 transitions. [2019-08-05 11:15:46,291 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:15:46,291 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 171 transitions. [2019-08-05 11:15:46,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:15:46,291 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:46,292 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 7, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1] [2019-08-05 11:15:46,292 INFO L418 AbstractCegarLoop]: === Iteration 288 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:46,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:46,292 INFO L82 PathProgramCache]: Analyzing trace with hash -18629825, now seen corresponding path program 284 times [2019-08-05 11:15:46,292 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:46,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:46,298 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 11:15:46,299 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:46,541 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 10 proven. 226 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2019-08-05 11:15:46,541 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:46,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:15:46,542 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:15:46,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:15:46,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=700, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:15:46,542 INFO L87 Difference]: Start difference. First operand 149 states and 171 transitions. Second operand 29 states. [2019-08-05 11:15:47,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:47,021 INFO L93 Difference]: Finished difference Result 217 states and 249 transitions. [2019-08-05 11:15:47,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:15:47,022 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:15:47,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:47,023 INFO L225 Difference]: With dead ends: 217 [2019-08-05 11:15:47,023 INFO L226 Difference]: Without dead ends: 217 [2019-08-05 11:15:47,023 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=287, Invalid=1783, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 11:15:47,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-08-05 11:15:47,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 145. [2019-08-05 11:15:47,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-08-05 11:15:47,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 166 transitions. [2019-08-05 11:15:47,027 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 166 transitions. Word has length 101 [2019-08-05 11:15:47,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:47,027 INFO L475 AbstractCegarLoop]: Abstraction has 145 states and 166 transitions. [2019-08-05 11:15:47,027 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:15:47,027 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 166 transitions. [2019-08-05 11:15:47,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:15:47,028 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:47,028 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 7, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1] [2019-08-05 11:15:47,028 INFO L418 AbstractCegarLoop]: === Iteration 289 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:47,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:47,028 INFO L82 PathProgramCache]: Analyzing trace with hash 184998591, now seen corresponding path program 285 times [2019-08-05 11:15:47,029 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:47,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:47,034 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:15:47,035 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:47,289 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 5 proven. 227 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2019-08-05 11:15:47,289 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:47,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:15:47,290 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:15:47,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:15:47,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=704, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:15:47,290 INFO L87 Difference]: Start difference. First operand 145 states and 166 transitions. Second operand 29 states. [2019-08-05 11:15:47,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:47,845 INFO L93 Difference]: Finished difference Result 249 states and 288 transitions. [2019-08-05 11:15:47,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 11:15:47,845 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:15:47,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:47,847 INFO L225 Difference]: With dead ends: 249 [2019-08-05 11:15:47,847 INFO L226 Difference]: Without dead ends: 249 [2019-08-05 11:15:47,847 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=285, Invalid=1785, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 11:15:47,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2019-08-05 11:15:47,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 137. [2019-08-05 11:15:47,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-08-05 11:15:47,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 157 transitions. [2019-08-05 11:15:47,851 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 157 transitions. Word has length 101 [2019-08-05 11:15:47,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:47,852 INFO L475 AbstractCegarLoop]: Abstraction has 137 states and 157 transitions. [2019-08-05 11:15:47,852 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:15:47,852 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 157 transitions. [2019-08-05 11:15:47,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:15:47,852 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:47,852 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 7, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1] [2019-08-05 11:15:47,853 INFO L418 AbstractCegarLoop]: === Iteration 290 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:47,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:47,853 INFO L82 PathProgramCache]: Analyzing trace with hash -291912257, now seen corresponding path program 286 times [2019-08-05 11:15:47,853 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:47,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:47,859 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 11:15:47,860 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:48,179 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 8 proven. 228 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2019-08-05 11:15:48,179 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:48,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:15:48,180 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:15:48,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:15:48,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=700, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:15:48,180 INFO L87 Difference]: Start difference. First operand 137 states and 157 transitions. Second operand 29 states. [2019-08-05 11:15:48,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:48,646 INFO L93 Difference]: Finished difference Result 221 states and 254 transitions. [2019-08-05 11:15:48,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:15:48,647 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:15:48,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:48,648 INFO L225 Difference]: With dead ends: 221 [2019-08-05 11:15:48,648 INFO L226 Difference]: Without dead ends: 221 [2019-08-05 11:15:48,649 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=278, Invalid=1702, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 11:15:48,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2019-08-05 11:15:48,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 125. [2019-08-05 11:15:48,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-08-05 11:15:48,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 143 transitions. [2019-08-05 11:15:48,652 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 143 transitions. Word has length 101 [2019-08-05 11:15:48,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:48,652 INFO L475 AbstractCegarLoop]: Abstraction has 125 states and 143 transitions. [2019-08-05 11:15:48,652 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:15:48,652 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 143 transitions. [2019-08-05 11:15:48,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:15:48,653 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:48,653 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 7, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1] [2019-08-05 11:15:48,653 INFO L418 AbstractCegarLoop]: === Iteration 291 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:48,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:48,653 INFO L82 PathProgramCache]: Analyzing trace with hash 889753663, now seen corresponding path program 287 times [2019-08-05 11:15:48,654 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:48,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:48,660 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 11:15:48,661 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:48,940 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 6 proven. 230 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2019-08-05 11:15:48,940 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:48,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:15:48,940 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:15:48,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:15:48,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=700, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:15:48,941 INFO L87 Difference]: Start difference. First operand 125 states and 143 transitions. Second operand 29 states. [2019-08-05 11:15:49,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:49,365 INFO L93 Difference]: Finished difference Result 229 states and 264 transitions. [2019-08-05 11:15:49,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:15:49,366 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:15:49,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:49,367 INFO L225 Difference]: With dead ends: 229 [2019-08-05 11:15:49,367 INFO L226 Difference]: Without dead ends: 229 [2019-08-05 11:15:49,368 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=262, Invalid=1544, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 11:15:49,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2019-08-05 11:15:49,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 129. [2019-08-05 11:15:49,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-08-05 11:15:49,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 148 transitions. [2019-08-05 11:15:49,371 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 148 transitions. Word has length 101 [2019-08-05 11:15:49,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:49,371 INFO L475 AbstractCegarLoop]: Abstraction has 129 states and 148 transitions. [2019-08-05 11:15:49,371 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:15:49,371 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 148 transitions. [2019-08-05 11:15:49,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:15:49,372 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:49,372 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 8, 8, 8, 8, 8, 8, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:15:49,372 INFO L418 AbstractCegarLoop]: === Iteration 292 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:49,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:49,372 INFO L82 PathProgramCache]: Analyzing trace with hash 12369982, now seen corresponding path program 288 times [2019-08-05 11:15:49,373 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:49,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:49,380 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:15:49,380 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:49,910 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 6 proven. 233 refuted. 0 times theorem prover too weak. 197 trivial. 0 not checked. [2019-08-05 11:15:49,911 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:49,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:15:49,911 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:15:49,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:15:49,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=695, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:15:49,911 INFO L87 Difference]: Start difference. First operand 129 states and 148 transitions. Second operand 29 states. [2019-08-05 11:15:50,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:50,337 INFO L93 Difference]: Finished difference Result 233 states and 272 transitions. [2019-08-05 11:15:50,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:15:50,338 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:15:50,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:50,339 INFO L225 Difference]: With dead ends: 233 [2019-08-05 11:15:50,339 INFO L226 Difference]: Without dead ends: 233 [2019-08-05 11:15:50,339 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=274, Invalid=1532, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 11:15:50,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2019-08-05 11:15:50,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 133. [2019-08-05 11:15:50,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-08-05 11:15:50,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 153 transitions. [2019-08-05 11:15:50,343 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 153 transitions. Word has length 101 [2019-08-05 11:15:50,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:50,343 INFO L475 AbstractCegarLoop]: Abstraction has 133 states and 153 transitions. [2019-08-05 11:15:50,343 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:15:50,343 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 153 transitions. [2019-08-05 11:15:50,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:15:50,344 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:50,344 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 7, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1] [2019-08-05 11:15:50,344 INFO L418 AbstractCegarLoop]: === Iteration 293 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:50,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:50,344 INFO L82 PathProgramCache]: Analyzing trace with hash 1163036095, now seen corresponding path program 289 times [2019-08-05 11:15:50,345 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:50,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:50,351 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:15:50,351 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:50,633 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 7 proven. 225 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2019-08-05 11:15:50,633 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:50,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:15:50,633 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:15:50,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:15:50,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=704, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:15:50,634 INFO L87 Difference]: Start difference. First operand 133 states and 153 transitions. Second operand 29 states. [2019-08-05 11:15:51,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:51,149 INFO L93 Difference]: Finished difference Result 225 states and 259 transitions. [2019-08-05 11:15:51,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:15:51,149 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:15:51,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:51,150 INFO L225 Difference]: With dead ends: 225 [2019-08-05 11:15:51,150 INFO L226 Difference]: Without dead ends: 225 [2019-08-05 11:15:51,151 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=281, Invalid=1789, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 11:15:51,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2019-08-05 11:15:51,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 101. [2019-08-05 11:15:51,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-08-05 11:15:51,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 115 transitions. [2019-08-05 11:15:51,154 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 115 transitions. Word has length 101 [2019-08-05 11:15:51,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:51,154 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 115 transitions. [2019-08-05 11:15:51,154 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:15:51,154 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 115 transitions. [2019-08-05 11:15:51,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:15:51,155 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:51,155 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:15:51,155 INFO L418 AbstractCegarLoop]: === Iteration 294 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:51,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:51,155 INFO L82 PathProgramCache]: Analyzing trace with hash 1994549307, now seen corresponding path program 290 times [2019-08-05 11:15:51,156 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:51,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:51,162 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:15:51,163 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:51,382 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 244 trivial. 0 not checked. [2019-08-05 11:15:51,383 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:51,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 11:15:51,383 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 11:15:51,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 11:15:51,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=592, Unknown=0, NotChecked=0, Total=756 [2019-08-05 11:15:51,383 INFO L87 Difference]: Start difference. First operand 101 states and 115 transitions. Second operand 28 states. [2019-08-05 11:15:51,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:51,728 INFO L93 Difference]: Finished difference Result 185 states and 210 transitions. [2019-08-05 11:15:51,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 11:15:51,728 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 101 [2019-08-05 11:15:51,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:51,729 INFO L225 Difference]: With dead ends: 185 [2019-08-05 11:15:51,729 INFO L226 Difference]: Without dead ends: 185 [2019-08-05 11:15:51,730 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=329, Invalid=1153, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 11:15:51,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-08-05 11:15:51,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 137. [2019-08-05 11:15:51,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-08-05 11:15:51,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 160 transitions. [2019-08-05 11:15:51,733 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 160 transitions. Word has length 101 [2019-08-05 11:15:51,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:51,733 INFO L475 AbstractCegarLoop]: Abstraction has 137 states and 160 transitions. [2019-08-05 11:15:51,733 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 11:15:51,733 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 160 transitions. [2019-08-05 11:15:51,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:15:51,734 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:51,734 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1] [2019-08-05 11:15:51,734 INFO L418 AbstractCegarLoop]: === Iteration 295 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:51,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:51,734 INFO L82 PathProgramCache]: Analyzing trace with hash -198928960, now seen corresponding path program 291 times [2019-08-05 11:15:51,734 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:51,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:51,741 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:15:51,741 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:51,978 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 5 proven. 216 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2019-08-05 11:15:51,978 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:51,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 11:15:51,978 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 11:15:51,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 11:15:51,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=612, Unknown=0, NotChecked=0, Total=756 [2019-08-05 11:15:51,979 INFO L87 Difference]: Start difference. First operand 137 states and 160 transitions. Second operand 28 states. [2019-08-05 11:15:52,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:52,208 INFO L93 Difference]: Finished difference Result 277 states and 315 transitions. [2019-08-05 11:15:52,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 11:15:52,208 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 101 [2019-08-05 11:15:52,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:52,209 INFO L225 Difference]: With dead ends: 277 [2019-08-05 11:15:52,209 INFO L226 Difference]: Without dead ends: 277 [2019-08-05 11:15:52,210 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=219, Invalid=903, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 11:15:52,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2019-08-05 11:15:52,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 169. [2019-08-05 11:15:52,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-08-05 11:15:52,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 196 transitions. [2019-08-05 11:15:52,214 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 196 transitions. Word has length 101 [2019-08-05 11:15:52,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:52,214 INFO L475 AbstractCegarLoop]: Abstraction has 169 states and 196 transitions. [2019-08-05 11:15:52,214 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 11:15:52,214 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 196 transitions. [2019-08-05 11:15:52,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:15:52,214 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:52,215 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 10, 10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:15:52,215 INFO L418 AbstractCegarLoop]: === Iteration 296 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:52,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:52,215 INFO L82 PathProgramCache]: Analyzing trace with hash -1149751876, now seen corresponding path program 292 times [2019-08-05 11:15:52,215 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:52,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:52,221 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:15:52,222 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:52,436 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 1 proven. 256 refuted. 0 times theorem prover too weak. 227 trivial. 0 not checked. [2019-08-05 11:15:52,436 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:52,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 11:15:52,436 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 11:15:52,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 11:15:52,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=624, Unknown=0, NotChecked=0, Total=756 [2019-08-05 11:15:52,437 INFO L87 Difference]: Start difference. First operand 169 states and 196 transitions. Second operand 28 states. [2019-08-05 11:15:52,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:52,856 INFO L93 Difference]: Finished difference Result 261 states and 296 transitions. [2019-08-05 11:15:52,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 11:15:52,856 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 101 [2019-08-05 11:15:52,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:52,857 INFO L225 Difference]: With dead ends: 261 [2019-08-05 11:15:52,857 INFO L226 Difference]: Without dead ends: 261 [2019-08-05 11:15:52,858 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 327 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=369, Invalid=1701, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 11:15:52,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2019-08-05 11:15:52,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 165. [2019-08-05 11:15:52,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-08-05 11:15:52,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 191 transitions. [2019-08-05 11:15:52,862 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 191 transitions. Word has length 101 [2019-08-05 11:15:52,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:52,862 INFO L475 AbstractCegarLoop]: Abstraction has 165 states and 191 transitions. [2019-08-05 11:15:52,862 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 11:15:52,862 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 191 transitions. [2019-08-05 11:15:52,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:15:52,862 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:52,862 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 7, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1] [2019-08-05 11:15:52,863 INFO L418 AbstractCegarLoop]: === Iteration 297 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:52,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:52,863 INFO L82 PathProgramCache]: Analyzing trace with hash -1349595073, now seen corresponding path program 293 times [2019-08-05 11:15:52,863 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:52,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:52,869 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:15:52,870 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:53,116 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 6 proven. 226 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2019-08-05 11:15:53,116 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:53,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:15:53,117 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:15:53,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:15:53,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=696, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:15:53,117 INFO L87 Difference]: Start difference. First operand 165 states and 191 transitions. Second operand 29 states. [2019-08-05 11:15:53,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:53,645 INFO L93 Difference]: Finished difference Result 293 states and 340 transitions. [2019-08-05 11:15:53,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 11:15:53,645 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:15:53,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:53,646 INFO L225 Difference]: With dead ends: 293 [2019-08-05 11:15:53,647 INFO L226 Difference]: Without dead ends: 293 [2019-08-05 11:15:53,647 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 360 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=349, Invalid=2101, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 11:15:53,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2019-08-05 11:15:53,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 157. [2019-08-05 11:15:53,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-08-05 11:15:53,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 182 transitions. [2019-08-05 11:15:53,652 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 182 transitions. Word has length 101 [2019-08-05 11:15:53,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:53,652 INFO L475 AbstractCegarLoop]: Abstraction has 157 states and 182 transitions. [2019-08-05 11:15:53,652 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:15:53,652 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 182 transitions. [2019-08-05 11:15:53,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:15:53,653 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:53,653 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 10, 10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:15:53,653 INFO L418 AbstractCegarLoop]: === Iteration 298 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:53,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:53,653 INFO L82 PathProgramCache]: Analyzing trace with hash -1423034308, now seen corresponding path program 294 times [2019-08-05 11:15:53,654 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:53,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:53,663 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:15:53,664 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:53,921 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 2 proven. 263 refuted. 0 times theorem prover too weak. 219 trivial. 0 not checked. [2019-08-05 11:15:53,921 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:53,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:15:53,921 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:15:53,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:15:53,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=663, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:15:53,922 INFO L87 Difference]: Start difference. First operand 157 states and 182 transitions. Second operand 29 states. [2019-08-05 11:15:54,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:54,293 INFO L93 Difference]: Finished difference Result 273 states and 313 transitions. [2019-08-05 11:15:54,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:15:54,293 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:15:54,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:54,294 INFO L225 Difference]: With dead ends: 273 [2019-08-05 11:15:54,294 INFO L226 Difference]: Without dead ends: 273 [2019-08-05 11:15:54,295 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=309, Invalid=1331, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:15:54,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2019-08-05 11:15:54,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 153. [2019-08-05 11:15:54,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-08-05 11:15:54,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 177 transitions. [2019-08-05 11:15:54,298 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 177 transitions. Word has length 101 [2019-08-05 11:15:54,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:54,298 INFO L475 AbstractCegarLoop]: Abstraction has 153 states and 177 transitions. [2019-08-05 11:15:54,298 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:15:54,298 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 177 transitions. [2019-08-05 11:15:54,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:15:54,299 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:54,299 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 7, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1] [2019-08-05 11:15:54,299 INFO L418 AbstractCegarLoop]: === Iteration 299 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:54,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:54,299 INFO L82 PathProgramCache]: Analyzing trace with hash -644840001, now seen corresponding path program 295 times [2019-08-05 11:15:54,300 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:54,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:54,305 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 11:15:54,306 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:54,558 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 7 proven. 229 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2019-08-05 11:15:54,558 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:54,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:15:54,558 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:15:54,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:15:54,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=698, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:15:54,559 INFO L87 Difference]: Start difference. First operand 153 states and 177 transitions. Second operand 29 states. [2019-08-05 11:15:55,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:55,228 INFO L93 Difference]: Finished difference Result 289 states and 333 transitions. [2019-08-05 11:15:55,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 11:15:55,228 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:15:55,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:55,229 INFO L225 Difference]: With dead ends: 289 [2019-08-05 11:15:55,230 INFO L226 Difference]: Without dead ends: 289 [2019-08-05 11:15:55,230 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=296, Invalid=1684, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 11:15:55,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-08-05 11:15:55,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 157. [2019-08-05 11:15:55,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-08-05 11:15:55,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 182 transitions. [2019-08-05 11:15:55,236 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 182 transitions. Word has length 101 [2019-08-05 11:15:55,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:55,236 INFO L475 AbstractCegarLoop]: Abstraction has 157 states and 182 transitions. [2019-08-05 11:15:55,236 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:15:55,236 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 182 transitions. [2019-08-05 11:15:55,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:15:55,237 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:55,237 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 10, 10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:15:55,237 INFO L418 AbstractCegarLoop]: === Iteration 300 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:55,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:55,237 INFO L82 PathProgramCache]: Analyzing trace with hash -2127789380, now seen corresponding path program 296 times [2019-08-05 11:15:55,238 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:55,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:55,247 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:15:55,248 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:55,500 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 3 proven. 262 refuted. 0 times theorem prover too weak. 219 trivial. 0 not checked. [2019-08-05 11:15:55,500 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:55,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:15:55,501 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:15:55,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:15:55,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=663, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:15:55,501 INFO L87 Difference]: Start difference. First operand 157 states and 182 transitions. Second operand 29 states. [2019-08-05 11:15:55,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:55,892 INFO L93 Difference]: Finished difference Result 289 states and 334 transitions. [2019-08-05 11:15:55,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:15:55,893 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:15:55,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:55,893 INFO L225 Difference]: With dead ends: 289 [2019-08-05 11:15:55,894 INFO L226 Difference]: Without dead ends: 289 [2019-08-05 11:15:55,894 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=309, Invalid=1331, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:15:55,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-08-05 11:15:55,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 165. [2019-08-05 11:15:55,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-08-05 11:15:55,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 191 transitions. [2019-08-05 11:15:55,900 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 191 transitions. Word has length 101 [2019-08-05 11:15:55,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:55,900 INFO L475 AbstractCegarLoop]: Abstraction has 165 states and 191 transitions. [2019-08-05 11:15:55,900 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:15:55,900 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 191 transitions. [2019-08-05 11:15:55,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:15:55,901 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:55,901 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 9, 9, 9, 9, 9, 9, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:15:55,901 INFO L418 AbstractCegarLoop]: === Iteration 301 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:55,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:55,902 INFO L82 PathProgramCache]: Analyzing trace with hash -977123267, now seen corresponding path program 297 times [2019-08-05 11:15:55,902 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:55,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:55,911 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:15:55,912 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:56,201 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 2 proven. 240 refuted. 0 times theorem prover too weak. 214 trivial. 0 not checked. [2019-08-05 11:15:56,201 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:56,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 11:15:56,201 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 11:15:56,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 11:15:56,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=642, Unknown=0, NotChecked=0, Total=756 [2019-08-05 11:15:56,202 INFO L87 Difference]: Start difference. First operand 165 states and 191 transitions. Second operand 28 states. [2019-08-05 11:15:56,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:56,584 INFO L93 Difference]: Finished difference Result 289 states and 328 transitions. [2019-08-05 11:15:56,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 11:15:56,584 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 101 [2019-08-05 11:15:56,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:56,586 INFO L225 Difference]: With dead ends: 289 [2019-08-05 11:15:56,586 INFO L226 Difference]: Without dead ends: 289 [2019-08-05 11:15:56,586 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=306, Invalid=1500, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 11:15:56,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-08-05 11:15:56,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 153. [2019-08-05 11:15:56,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-08-05 11:15:56,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 177 transitions. [2019-08-05 11:15:56,590 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 177 transitions. Word has length 101 [2019-08-05 11:15:56,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:56,590 INFO L475 AbstractCegarLoop]: Abstraction has 153 states and 177 transitions. [2019-08-05 11:15:56,590 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 11:15:56,590 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 177 transitions. [2019-08-05 11:15:56,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:15:56,591 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:56,591 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 7, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1] [2019-08-05 11:15:56,591 INFO L418 AbstractCegarLoop]: === Iteration 302 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:56,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:56,591 INFO L82 PathProgramCache]: Analyzing trace with hash -371557569, now seen corresponding path program 298 times [2019-08-05 11:15:56,591 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:56,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:56,598 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:15:56,599 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:56,852 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 8 proven. 224 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2019-08-05 11:15:56,852 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:56,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:15:56,852 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:15:56,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:15:56,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=696, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:15:56,853 INFO L87 Difference]: Start difference. First operand 153 states and 177 transitions. Second operand 29 states. [2019-08-05 11:15:57,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:57,353 INFO L93 Difference]: Finished difference Result 285 states and 327 transitions. [2019-08-05 11:15:57,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 11:15:57,354 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:15:57,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:57,355 INFO L225 Difference]: With dead ends: 285 [2019-08-05 11:15:57,355 INFO L226 Difference]: Without dead ends: 285 [2019-08-05 11:15:57,355 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 318 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=324, Invalid=1932, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 11:15:57,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-08-05 11:15:57,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 157. [2019-08-05 11:15:57,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-08-05 11:15:57,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 182 transitions. [2019-08-05 11:15:57,359 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 182 transitions. Word has length 101 [2019-08-05 11:15:57,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:57,360 INFO L475 AbstractCegarLoop]: Abstraction has 157 states and 182 transitions. [2019-08-05 11:15:57,360 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:15:57,360 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 182 transitions. [2019-08-05 11:15:57,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:15:57,360 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:57,360 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 10, 10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:15:57,361 INFO L418 AbstractCegarLoop]: === Iteration 303 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:57,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:57,361 INFO L82 PathProgramCache]: Analyzing trace with hash -1005384388, now seen corresponding path program 299 times [2019-08-05 11:15:57,361 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:57,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:57,367 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:15:57,368 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:57,601 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 4 proven. 261 refuted. 0 times theorem prover too weak. 219 trivial. 0 not checked. [2019-08-05 11:15:57,601 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:57,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:15:57,602 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:15:57,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:15:57,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=663, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:15:57,602 INFO L87 Difference]: Start difference. First operand 157 states and 182 transitions. Second operand 29 states. [2019-08-05 11:15:58,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:58,005 INFO L93 Difference]: Finished difference Result 297 states and 345 transitions. [2019-08-05 11:15:58,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:15:58,006 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:15:58,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:58,007 INFO L225 Difference]: With dead ends: 297 [2019-08-05 11:15:58,007 INFO L226 Difference]: Without dead ends: 297 [2019-08-05 11:15:58,008 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=309, Invalid=1331, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:15:58,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2019-08-05 11:15:58,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 169. [2019-08-05 11:15:58,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-08-05 11:15:58,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 196 transitions. [2019-08-05 11:15:58,012 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 196 transitions. Word has length 101 [2019-08-05 11:15:58,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:58,012 INFO L475 AbstractCegarLoop]: Abstraction has 169 states and 196 transitions. [2019-08-05 11:15:58,012 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:15:58,012 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 196 transitions. [2019-08-05 11:15:58,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:15:58,013 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:58,013 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 9, 9, 9, 9, 9, 9, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:15:58,013 INFO L418 AbstractCegarLoop]: === Iteration 304 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:58,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:58,013 INFO L82 PathProgramCache]: Analyzing trace with hash 145281725, now seen corresponding path program 300 times [2019-08-05 11:15:58,013 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:58,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:58,019 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:15:58,020 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:58,253 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 5 proven. 245 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2019-08-05 11:15:58,253 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:58,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:15:58,254 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:15:58,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:15:58,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=688, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:15:58,254 INFO L87 Difference]: Start difference. First operand 169 states and 196 transitions. Second operand 29 states. [2019-08-05 11:15:58,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:58,765 INFO L93 Difference]: Finished difference Result 297 states and 340 transitions. [2019-08-05 11:15:58,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:15:58,766 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:15:58,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:58,767 INFO L225 Difference]: With dead ends: 297 [2019-08-05 11:15:58,767 INFO L226 Difference]: Without dead ends: 297 [2019-08-05 11:15:58,767 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=347, Invalid=1909, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 11:15:58,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2019-08-05 11:15:58,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 165. [2019-08-05 11:15:58,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-08-05 11:15:58,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 191 transitions. [2019-08-05 11:15:58,772 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 191 transitions. Word has length 101 [2019-08-05 11:15:58,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:58,772 INFO L475 AbstractCegarLoop]: Abstraction has 165 states and 191 transitions. [2019-08-05 11:15:58,772 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:15:58,772 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 191 transitions. [2019-08-05 11:15:58,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:15:58,773 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:58,773 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 9, 9, 9, 9, 9, 9, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:15:58,773 INFO L418 AbstractCegarLoop]: === Iteration 305 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:58,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:58,773 INFO L82 PathProgramCache]: Analyzing trace with hash -128000707, now seen corresponding path program 301 times [2019-08-05 11:15:58,773 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:58,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:58,780 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:15:58,781 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:59,021 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 3 proven. 247 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2019-08-05 11:15:59,021 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:59,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:15:59,021 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:15:59,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:15:59,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=688, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:15:59,022 INFO L87 Difference]: Start difference. First operand 165 states and 191 transitions. Second operand 29 states. [2019-08-05 11:15:59,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:59,520 INFO L93 Difference]: Finished difference Result 297 states and 340 transitions. [2019-08-05 11:15:59,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:15:59,520 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:15:59,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:59,521 INFO L225 Difference]: With dead ends: 297 [2019-08-05 11:15:59,521 INFO L226 Difference]: Without dead ends: 297 [2019-08-05 11:15:59,521 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 319 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=336, Invalid=1826, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 11:15:59,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2019-08-05 11:15:59,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 153. [2019-08-05 11:15:59,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-08-05 11:15:59,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 177 transitions. [2019-08-05 11:15:59,526 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 177 transitions. Word has length 101 [2019-08-05 11:15:59,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:59,526 INFO L475 AbstractCegarLoop]: Abstraction has 153 states and 177 transitions. [2019-08-05 11:15:59,526 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:15:59,526 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 177 transitions. [2019-08-05 11:15:59,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:15:59,526 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:59,526 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 10, 10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:15:59,526 INFO L418 AbstractCegarLoop]: === Iteration 306 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:59,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:59,527 INFO L82 PathProgramCache]: Analyzing trace with hash 176281532, now seen corresponding path program 302 times [2019-08-05 11:15:59,527 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:59,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:59,533 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:15:59,534 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:00,102 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 5 proven. 260 refuted. 0 times theorem prover too weak. 219 trivial. 0 not checked. [2019-08-05 11:16:00,103 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:00,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:16:00,103 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:16:00,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:16:00,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=663, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:16:00,104 INFO L87 Difference]: Start difference. First operand 153 states and 177 transitions. Second operand 29 states. [2019-08-05 11:16:00,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:00,495 INFO L93 Difference]: Finished difference Result 293 states and 341 transitions. [2019-08-05 11:16:00,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:16:00,496 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:16:00,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:00,497 INFO L225 Difference]: With dead ends: 293 [2019-08-05 11:16:00,497 INFO L226 Difference]: Without dead ends: 293 [2019-08-05 11:16:00,497 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=309, Invalid=1331, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:16:00,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2019-08-05 11:16:00,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 169. [2019-08-05 11:16:00,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-08-05 11:16:00,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 196 transitions. [2019-08-05 11:16:00,501 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 196 transitions. Word has length 101 [2019-08-05 11:16:00,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:00,502 INFO L475 AbstractCegarLoop]: Abstraction has 169 states and 196 transitions. [2019-08-05 11:16:00,502 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:16:00,502 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 196 transitions. [2019-08-05 11:16:00,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:16:00,502 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:00,502 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 8, 8, 8, 8, 8, 8, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:16:00,502 INFO L418 AbstractCegarLoop]: === Iteration 307 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:00,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:00,503 INFO L82 PathProgramCache]: Analyzing trace with hash -1522223682, now seen corresponding path program 303 times [2019-08-05 11:16:00,503 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:00,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:00,508 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:16:00,509 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:00,746 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 7 proven. 232 refuted. 0 times theorem prover too weak. 197 trivial. 0 not checked. [2019-08-05 11:16:00,746 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:00,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:16:00,747 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:16:00,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:16:00,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=699, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:16:00,747 INFO L87 Difference]: Start difference. First operand 169 states and 196 transitions. Second operand 29 states. [2019-08-05 11:16:01,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:01,198 INFO L93 Difference]: Finished difference Result 297 states and 346 transitions. [2019-08-05 11:16:01,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 11:16:01,198 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:16:01,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:01,199 INFO L225 Difference]: With dead ends: 297 [2019-08-05 11:16:01,199 INFO L226 Difference]: Without dead ends: 297 [2019-08-05 11:16:01,200 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=302, Invalid=1678, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 11:16:01,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2019-08-05 11:16:01,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 153. [2019-08-05 11:16:01,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-08-05 11:16:01,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 177 transitions. [2019-08-05 11:16:01,204 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 177 transitions. Word has length 101 [2019-08-05 11:16:01,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:01,204 INFO L475 AbstractCegarLoop]: Abstraction has 153 states and 177 transitions. [2019-08-05 11:16:01,204 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:16:01,204 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 177 transitions. [2019-08-05 11:16:01,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:16:01,205 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:01,205 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 7, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1] [2019-08-05 11:16:01,205 INFO L418 AbstractCegarLoop]: === Iteration 308 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:01,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:01,205 INFO L82 PathProgramCache]: Analyzing trace with hash -1826505921, now seen corresponding path program 304 times [2019-08-05 11:16:01,206 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:01,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:01,211 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 11:16:01,212 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:01,480 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 9 proven. 227 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2019-08-05 11:16:01,480 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:01,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:16:01,480 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:16:01,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:16:01,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=698, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:16:01,481 INFO L87 Difference]: Start difference. First operand 153 states and 177 transitions. Second operand 29 states. [2019-08-05 11:16:01,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:01,946 INFO L93 Difference]: Finished difference Result 289 states and 332 transitions. [2019-08-05 11:16:01,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:16:01,946 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:16:01,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:01,948 INFO L225 Difference]: With dead ends: 289 [2019-08-05 11:16:01,948 INFO L226 Difference]: Without dead ends: 289 [2019-08-05 11:16:01,948 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 271 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=289, Invalid=1691, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 11:16:01,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-08-05 11:16:01,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 165. [2019-08-05 11:16:01,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-08-05 11:16:01,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 191 transitions. [2019-08-05 11:16:01,952 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 191 transitions. Word has length 101 [2019-08-05 11:16:01,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:01,952 INFO L475 AbstractCegarLoop]: Abstraction has 165 states and 191 transitions. [2019-08-05 11:16:01,952 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:16:01,952 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 191 transitions. [2019-08-05 11:16:01,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:16:01,953 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:01,953 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 9, 9, 9, 9, 9, 9, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:16:01,953 INFO L418 AbstractCegarLoop]: === Iteration 309 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:01,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:01,953 INFO L82 PathProgramCache]: Analyzing trace with hash 1326947645, now seen corresponding path program 305 times [2019-08-05 11:16:01,954 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:01,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:01,962 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:16:01,963 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:02,261 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 6 proven. 244 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2019-08-05 11:16:02,262 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:02,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:16:02,262 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:16:02,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:16:02,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=688, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:16:02,263 INFO L87 Difference]: Start difference. First operand 165 states and 191 transitions. Second operand 29 states. [2019-08-05 11:16:02,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:02,769 INFO L93 Difference]: Finished difference Result 293 states and 336 transitions. [2019-08-05 11:16:02,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:16:02,770 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:16:02,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:02,771 INFO L225 Difference]: With dead ends: 293 [2019-08-05 11:16:02,771 INFO L226 Difference]: Without dead ends: 293 [2019-08-05 11:16:02,772 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 346 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=347, Invalid=1909, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 11:16:02,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2019-08-05 11:16:02,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 161. [2019-08-05 11:16:02,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-08-05 11:16:02,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 186 transitions. [2019-08-05 11:16:02,776 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 186 transitions. Word has length 101 [2019-08-05 11:16:02,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:02,776 INFO L475 AbstractCegarLoop]: Abstraction has 161 states and 186 transitions. [2019-08-05 11:16:02,776 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:16:02,776 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 186 transitions. [2019-08-05 11:16:02,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:16:02,776 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:02,777 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 9, 9, 9, 9, 9, 9, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:16:02,777 INFO L418 AbstractCegarLoop]: === Iteration 310 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:02,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:02,777 INFO L82 PathProgramCache]: Analyzing trace with hash 1053665213, now seen corresponding path program 306 times [2019-08-05 11:16:02,777 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:02,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:02,784 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 11:16:02,784 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:03,024 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 5 proven. 249 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2019-08-05 11:16:03,025 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:03,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:16:03,025 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:16:03,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:16:03,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=676, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:16:03,025 INFO L87 Difference]: Start difference. First operand 161 states and 186 transitions. Second operand 29 states. [2019-08-05 11:16:03,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:03,385 INFO L93 Difference]: Finished difference Result 297 states and 341 transitions. [2019-08-05 11:16:03,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:16:03,386 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:16:03,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:03,387 INFO L225 Difference]: With dead ends: 297 [2019-08-05 11:16:03,387 INFO L226 Difference]: Without dead ends: 297 [2019-08-05 11:16:03,388 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=289, Invalid=1351, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:16:03,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2019-08-05 11:16:03,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 157. [2019-08-05 11:16:03,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-08-05 11:16:03,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 181 transitions. [2019-08-05 11:16:03,392 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 181 transitions. Word has length 101 [2019-08-05 11:16:03,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:03,392 INFO L475 AbstractCegarLoop]: Abstraction has 157 states and 181 transitions. [2019-08-05 11:16:03,392 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:16:03,392 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 181 transitions. [2019-08-05 11:16:03,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:16:03,392 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:03,392 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 7, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1] [2019-08-05 11:16:03,393 INFO L418 AbstractCegarLoop]: === Iteration 311 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:03,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:03,393 INFO L82 PathProgramCache]: Analyzing trace with hash -1553223489, now seen corresponding path program 307 times [2019-08-05 11:16:03,393 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:03,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:03,400 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 11:16:03,401 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:03,657 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 11 proven. 225 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2019-08-05 11:16:03,658 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:03,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:16:03,658 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:16:03,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:16:03,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=698, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:16:03,658 INFO L87 Difference]: Start difference. First operand 157 states and 181 transitions. Second operand 29 states. [2019-08-05 11:16:04,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:04,111 INFO L93 Difference]: Finished difference Result 289 states and 330 transitions. [2019-08-05 11:16:04,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:16:04,111 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:16:04,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:04,112 INFO L225 Difference]: With dead ends: 289 [2019-08-05 11:16:04,112 INFO L226 Difference]: Without dead ends: 289 [2019-08-05 11:16:04,113 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=298, Invalid=1772, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 11:16:04,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-08-05 11:16:04,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 161. [2019-08-05 11:16:04,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-08-05 11:16:04,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 186 transitions. [2019-08-05 11:16:04,117 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 186 transitions. Word has length 101 [2019-08-05 11:16:04,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:04,117 INFO L475 AbstractCegarLoop]: Abstraction has 161 states and 186 transitions. [2019-08-05 11:16:04,117 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:16:04,117 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 186 transitions. [2019-08-05 11:16:04,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:16:04,118 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:04,118 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 9, 9, 9, 9, 9, 9, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:16:04,118 INFO L418 AbstractCegarLoop]: === Iteration 312 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:04,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:04,118 INFO L82 PathProgramCache]: Analyzing trace with hash 348910141, now seen corresponding path program 308 times [2019-08-05 11:16:04,119 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:04,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:04,125 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:16:04,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:04,401 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 4 proven. 246 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2019-08-05 11:16:04,402 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:04,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:16:04,402 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:16:04,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:16:04,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=688, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:16:04,402 INFO L87 Difference]: Start difference. First operand 161 states and 186 transitions. Second operand 29 states. [2019-08-05 11:16:04,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:04,914 INFO L93 Difference]: Finished difference Result 301 states and 347 transitions. [2019-08-05 11:16:04,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:16:04,914 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:16:04,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:04,915 INFO L225 Difference]: With dead ends: 301 [2019-08-05 11:16:04,915 INFO L226 Difference]: Without dead ends: 301 [2019-08-05 11:16:04,915 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 302 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=326, Invalid=1744, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 11:16:04,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2019-08-05 11:16:04,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 169. [2019-08-05 11:16:04,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-08-05 11:16:04,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 195 transitions. [2019-08-05 11:16:04,920 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 195 transitions. Word has length 101 [2019-08-05 11:16:04,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:04,920 INFO L475 AbstractCegarLoop]: Abstraction has 169 states and 195 transitions. [2019-08-05 11:16:04,920 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:16:04,920 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 195 transitions. [2019-08-05 11:16:04,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:16:04,921 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:04,921 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 8, 8, 8, 8, 8, 8, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:16:04,921 INFO L418 AbstractCegarLoop]: === Iteration 313 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:04,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:04,921 INFO L82 PathProgramCache]: Analyzing trace with hash 1499576254, now seen corresponding path program 309 times [2019-08-05 11:16:04,922 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:04,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:04,928 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:16:04,929 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:05,411 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 3 proven. 228 refuted. 0 times theorem prover too weak. 205 trivial. 0 not checked. [2019-08-05 11:16:05,411 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:05,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 11:16:05,412 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 11:16:05,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 11:16:05,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=646, Unknown=0, NotChecked=0, Total=756 [2019-08-05 11:16:05,412 INFO L87 Difference]: Start difference. First operand 169 states and 195 transitions. Second operand 28 states. [2019-08-05 11:16:05,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:05,735 INFO L93 Difference]: Finished difference Result 301 states and 342 transitions. [2019-08-05 11:16:05,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 11:16:05,735 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 101 [2019-08-05 11:16:05,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:05,737 INFO L225 Difference]: With dead ends: 301 [2019-08-05 11:16:05,737 INFO L226 Difference]: Without dead ends: 301 [2019-08-05 11:16:05,737 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=260, Invalid=1300, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 11:16:05,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2019-08-05 11:16:05,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 149. [2019-08-05 11:16:05,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-08-05 11:16:05,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 172 transitions. [2019-08-05 11:16:05,741 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 172 transitions. Word has length 101 [2019-08-05 11:16:05,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:05,741 INFO L475 AbstractCegarLoop]: Abstraction has 149 states and 172 transitions. [2019-08-05 11:16:05,741 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 11:16:05,741 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 172 transitions. [2019-08-05 11:16:05,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:16:05,742 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:05,742 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 8, 8, 8, 8, 8, 8, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:16:05,742 INFO L418 AbstractCegarLoop]: === Iteration 314 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:05,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:05,742 INFO L82 PathProgramCache]: Analyzing trace with hash 1591077694, now seen corresponding path program 310 times [2019-08-05 11:16:05,742 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:05,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:05,749 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 11:16:05,749 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:06,003 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 10 proven. 233 refuted. 0 times theorem prover too weak. 193 trivial. 0 not checked. [2019-08-05 11:16:06,003 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:06,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:16:06,003 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:16:06,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:16:06,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=694, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:16:06,004 INFO L87 Difference]: Start difference. First operand 149 states and 172 transitions. Second operand 29 states. [2019-08-05 11:16:06,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:06,423 INFO L93 Difference]: Finished difference Result 273 states and 316 transitions. [2019-08-05 11:16:06,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:16:06,424 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:16:06,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:06,425 INFO L225 Difference]: With dead ends: 273 [2019-08-05 11:16:06,425 INFO L226 Difference]: Without dead ends: 273 [2019-08-05 11:16:06,425 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=274, Invalid=1448, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 11:16:06,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2019-08-05 11:16:06,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 137. [2019-08-05 11:16:06,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-08-05 11:16:06,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 158 transitions. [2019-08-05 11:16:06,429 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 158 transitions. Word has length 101 [2019-08-05 11:16:06,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:06,429 INFO L475 AbstractCegarLoop]: Abstraction has 137 states and 158 transitions. [2019-08-05 11:16:06,429 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:16:06,429 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 158 transitions. [2019-08-05 11:16:06,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:16:06,430 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:06,430 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 10, 10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:16:06,430 INFO L418 AbstractCegarLoop]: === Iteration 315 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:06,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:06,430 INFO L82 PathProgramCache]: Analyzing trace with hash -82255300, now seen corresponding path program 311 times [2019-08-05 11:16:06,430 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:06,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:06,437 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:16:06,438 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:06,676 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 6 proven. 259 refuted. 0 times theorem prover too weak. 219 trivial. 0 not checked. [2019-08-05 11:16:06,676 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:06,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:16:06,676 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:16:06,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:16:06,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=663, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:16:06,677 INFO L87 Difference]: Start difference. First operand 137 states and 158 transitions. Second operand 29 states. [2019-08-05 11:16:07,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:07,059 INFO L93 Difference]: Finished difference Result 269 states and 313 transitions. [2019-08-05 11:16:07,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:16:07,060 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:16:07,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:07,061 INFO L225 Difference]: With dead ends: 269 [2019-08-05 11:16:07,061 INFO L226 Difference]: Without dead ends: 269 [2019-08-05 11:16:07,062 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=309, Invalid=1331, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:16:07,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2019-08-05 11:16:07,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 157. [2019-08-05 11:16:07,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-08-05 11:16:07,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 182 transitions. [2019-08-05 11:16:07,066 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 182 transitions. Word has length 101 [2019-08-05 11:16:07,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:07,066 INFO L475 AbstractCegarLoop]: Abstraction has 157 states and 182 transitions. [2019-08-05 11:16:07,066 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:16:07,066 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 182 transitions. [2019-08-05 11:16:07,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:16:07,067 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:07,067 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 7, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1] [2019-08-05 11:16:07,067 INFO L418 AbstractCegarLoop]: === Iteration 316 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:07,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:07,067 INFO L82 PathProgramCache]: Analyzing trace with hash 1619338815, now seen corresponding path program 312 times [2019-08-05 11:16:07,068 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:07,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:07,073 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:16:07,074 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:07,356 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 10 proven. 222 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2019-08-05 11:16:07,356 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:07,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:16:07,357 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:16:07,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:16:07,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=696, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:16:07,357 INFO L87 Difference]: Start difference. First operand 157 states and 182 transitions. Second operand 29 states. [2019-08-05 11:16:07,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:07,757 INFO L93 Difference]: Finished difference Result 305 states and 349 transitions. [2019-08-05 11:16:07,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:16:07,757 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:16:07,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:07,759 INFO L225 Difference]: With dead ends: 305 [2019-08-05 11:16:07,759 INFO L226 Difference]: Without dead ends: 305 [2019-08-05 11:16:07,759 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=292, Invalid=1688, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 11:16:07,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2019-08-05 11:16:07,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 169. [2019-08-05 11:16:07,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-08-05 11:16:07,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 196 transitions. [2019-08-05 11:16:07,763 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 196 transitions. Word has length 101 [2019-08-05 11:16:07,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:07,763 INFO L475 AbstractCegarLoop]: Abstraction has 169 states and 196 transitions. [2019-08-05 11:16:07,763 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:16:07,763 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 196 transitions. [2019-08-05 11:16:07,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:16:07,764 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:07,764 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 9, 9, 9, 9, 9, 9, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:16:07,764 INFO L418 AbstractCegarLoop]: === Iteration 317 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:07,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:07,764 INFO L82 PathProgramCache]: Analyzing trace with hash 1068410813, now seen corresponding path program 313 times [2019-08-05 11:16:07,764 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:07,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:07,771 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:16:07,772 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:08,029 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 7 proven. 243 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2019-08-05 11:16:08,029 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:08,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:16:08,029 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:16:08,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:16:08,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=688, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:16:08,030 INFO L87 Difference]: Start difference. First operand 169 states and 196 transitions. Second operand 29 states. [2019-08-05 11:16:08,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:08,514 INFO L93 Difference]: Finished difference Result 293 states and 337 transitions. [2019-08-05 11:16:08,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:16:08,515 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:16:08,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:08,516 INFO L225 Difference]: With dead ends: 293 [2019-08-05 11:16:08,516 INFO L226 Difference]: Without dead ends: 293 [2019-08-05 11:16:08,516 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=347, Invalid=1909, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 11:16:08,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2019-08-05 11:16:08,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 165. [2019-08-05 11:16:08,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-08-05 11:16:08,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 191 transitions. [2019-08-05 11:16:08,521 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 191 transitions. Word has length 101 [2019-08-05 11:16:08,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:08,521 INFO L475 AbstractCegarLoop]: Abstraction has 165 states and 191 transitions. [2019-08-05 11:16:08,521 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:16:08,521 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 191 transitions. [2019-08-05 11:16:08,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:16:08,521 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:08,521 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 8, 8, 8, 8, 8, 8, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:16:08,522 INFO L418 AbstractCegarLoop]: === Iteration 318 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:08,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:08,522 INFO L82 PathProgramCache]: Analyzing trace with hash 468672702, now seen corresponding path program 314 times [2019-08-05 11:16:08,522 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:08,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:08,529 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 11:16:08,529 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:08,779 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 9 proven. 234 refuted. 0 times theorem prover too weak. 193 trivial. 0 not checked. [2019-08-05 11:16:08,780 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:08,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:16:08,780 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:16:08,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:16:08,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=694, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:16:08,780 INFO L87 Difference]: Start difference. First operand 165 states and 191 transitions. Second operand 29 states. [2019-08-05 11:16:09,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:09,188 INFO L93 Difference]: Finished difference Result 301 states and 349 transitions. [2019-08-05 11:16:09,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:16:09,188 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:16:09,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:09,189 INFO L225 Difference]: With dead ends: 301 [2019-08-05 11:16:09,189 INFO L226 Difference]: Without dead ends: 301 [2019-08-05 11:16:09,190 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=274, Invalid=1448, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 11:16:09,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2019-08-05 11:16:09,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 157. [2019-08-05 11:16:09,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-08-05 11:16:09,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 182 transitions. [2019-08-05 11:16:09,194 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 182 transitions. Word has length 101 [2019-08-05 11:16:09,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:09,194 INFO L475 AbstractCegarLoop]: Abstraction has 157 states and 182 transitions. [2019-08-05 11:16:09,194 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:16:09,194 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 182 transitions. [2019-08-05 11:16:09,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:16:09,195 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:09,195 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 8, 8, 8, 8, 8, 8, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:16:09,195 INFO L418 AbstractCegarLoop]: === Iteration 319 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:09,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:09,196 INFO L82 PathProgramCache]: Analyzing trace with hash 1173427774, now seen corresponding path program 315 times [2019-08-05 11:16:09,196 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:09,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:09,206 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 11:16:09,207 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:09,495 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 8 proven. 235 refuted. 0 times theorem prover too weak. 193 trivial. 0 not checked. [2019-08-05 11:16:09,495 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:09,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:16:09,496 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:16:09,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:16:09,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=694, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:16:09,496 INFO L87 Difference]: Start difference. First operand 157 states and 182 transitions. Second operand 29 states. [2019-08-05 11:16:09,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:09,916 INFO L93 Difference]: Finished difference Result 293 states and 339 transitions. [2019-08-05 11:16:09,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:16:09,917 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:16:09,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:09,918 INFO L225 Difference]: With dead ends: 293 [2019-08-05 11:16:09,918 INFO L226 Difference]: Without dead ends: 293 [2019-08-05 11:16:09,919 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=274, Invalid=1448, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 11:16:09,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2019-08-05 11:16:09,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 161. [2019-08-05 11:16:09,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-08-05 11:16:09,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 187 transitions. [2019-08-05 11:16:09,923 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 187 transitions. Word has length 101 [2019-08-05 11:16:09,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:09,923 INFO L475 AbstractCegarLoop]: Abstraction has 161 states and 187 transitions. [2019-08-05 11:16:09,923 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:16:09,923 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 187 transitions. [2019-08-05 11:16:09,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:16:09,924 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:09,924 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 8, 8, 8, 8, 8, 8, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:16:09,924 INFO L418 AbstractCegarLoop]: === Iteration 320 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:09,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:09,924 INFO L82 PathProgramCache]: Analyzing trace with hash 1446710206, now seen corresponding path program 316 times [2019-08-05 11:16:09,925 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:09,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:09,933 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:16:09,934 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:10,496 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 9 proven. 230 refuted. 0 times theorem prover too weak. 197 trivial. 0 not checked. [2019-08-05 11:16:10,497 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:10,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:16:10,497 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:16:10,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:16:10,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=699, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:16:10,498 INFO L87 Difference]: Start difference. First operand 161 states and 187 transitions. Second operand 29 states. [2019-08-05 11:16:10,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:10,987 INFO L93 Difference]: Finished difference Result 293 states and 338 transitions. [2019-08-05 11:16:10,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:16:10,987 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:16:10,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:10,988 INFO L225 Difference]: With dead ends: 293 [2019-08-05 11:16:10,988 INFO L226 Difference]: Without dead ends: 293 [2019-08-05 11:16:10,989 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 308 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=314, Invalid=1848, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 11:16:10,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2019-08-05 11:16:10,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 165. [2019-08-05 11:16:10,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-08-05 11:16:10,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 192 transitions. [2019-08-05 11:16:10,993 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 192 transitions. Word has length 101 [2019-08-05 11:16:10,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:10,993 INFO L475 AbstractCegarLoop]: Abstraction has 165 states and 192 transitions. [2019-08-05 11:16:10,993 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:16:10,993 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 192 transitions. [2019-08-05 11:16:10,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:16:10,993 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:10,993 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 9, 9, 9, 9, 9, 9, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:16:10,994 INFO L418 AbstractCegarLoop]: === Iteration 321 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:10,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:10,994 INFO L82 PathProgramCache]: Analyzing trace with hash 296044093, now seen corresponding path program 317 times [2019-08-05 11:16:10,994 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:10,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:11,000 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:16:11,000 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:11,248 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 8 proven. 242 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2019-08-05 11:16:11,248 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:11,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:16:11,249 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:16:11,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:16:11,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=688, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:16:11,249 INFO L87 Difference]: Start difference. First operand 165 states and 192 transitions. Second operand 29 states. [2019-08-05 11:16:11,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:11,678 INFO L93 Difference]: Finished difference Result 277 states and 323 transitions. [2019-08-05 11:16:11,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:16:11,679 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:16:11,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:11,680 INFO L225 Difference]: With dead ends: 277 [2019-08-05 11:16:11,680 INFO L226 Difference]: Without dead ends: 277 [2019-08-05 11:16:11,681 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=286, Invalid=1436, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 11:16:11,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2019-08-05 11:16:11,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 141. [2019-08-05 11:16:11,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-08-05 11:16:11,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 163 transitions. [2019-08-05 11:16:11,685 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 163 transitions. Word has length 101 [2019-08-05 11:16:11,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:11,685 INFO L475 AbstractCegarLoop]: Abstraction has 141 states and 163 transitions. [2019-08-05 11:16:11,685 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:16:11,685 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 163 transitions. [2019-08-05 11:16:11,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:16:11,685 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:11,685 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 7, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1] [2019-08-05 11:16:11,686 INFO L418 AbstractCegarLoop]: === Iteration 322 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:11,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:11,686 INFO L82 PathProgramCache]: Analyzing trace with hash 1103261887, now seen corresponding path program 318 times [2019-08-05 11:16:11,686 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:11,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:11,692 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 11:16:11,693 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:11,933 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 11 proven. 225 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2019-08-05 11:16:11,934 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:11,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:16:11,934 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:16:11,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:16:11,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=698, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:16:11,935 INFO L87 Difference]: Start difference. First operand 141 states and 163 transitions. Second operand 29 states. [2019-08-05 11:16:12,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:12,475 INFO L93 Difference]: Finished difference Result 289 states and 332 transitions. [2019-08-05 11:16:12,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 11:16:12,476 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:16:12,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:12,477 INFO L225 Difference]: With dead ends: 289 [2019-08-05 11:16:12,477 INFO L226 Difference]: Without dead ends: 289 [2019-08-05 11:16:12,477 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 310 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=309, Invalid=1853, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 11:16:12,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-08-05 11:16:12,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 161. [2019-08-05 11:16:12,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-08-05 11:16:12,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 186 transitions. [2019-08-05 11:16:12,482 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 186 transitions. Word has length 101 [2019-08-05 11:16:12,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:12,482 INFO L475 AbstractCegarLoop]: Abstraction has 161 states and 186 transitions. [2019-08-05 11:16:12,482 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:16:12,482 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 186 transitions. [2019-08-05 11:16:12,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:16:12,483 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:12,483 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 7, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1] [2019-08-05 11:16:12,483 INFO L418 AbstractCegarLoop]: === Iteration 323 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:12,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:12,483 INFO L82 PathProgramCache]: Analyzing trace with hash 1376544319, now seen corresponding path program 319 times [2019-08-05 11:16:12,483 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:12,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:12,490 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 11:16:12,490 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:12,749 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 13 proven. 223 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2019-08-05 11:16:12,750 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:12,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:16:12,750 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:16:12,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:16:12,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=698, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:16:12,750 INFO L87 Difference]: Start difference. First operand 161 states and 186 transitions. Second operand 29 states. [2019-08-05 11:16:13,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:13,214 INFO L93 Difference]: Finished difference Result 293 states and 335 transitions. [2019-08-05 11:16:13,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:16:13,215 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:16:13,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:13,216 INFO L225 Difference]: With dead ends: 293 [2019-08-05 11:16:13,216 INFO L226 Difference]: Without dead ends: 293 [2019-08-05 11:16:13,216 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=298, Invalid=1772, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 11:16:13,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2019-08-05 11:16:13,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 165. [2019-08-05 11:16:13,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-08-05 11:16:13,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 191 transitions. [2019-08-05 11:16:13,221 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 191 transitions. Word has length 101 [2019-08-05 11:16:13,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:13,221 INFO L475 AbstractCegarLoop]: Abstraction has 165 states and 191 transitions. [2019-08-05 11:16:13,221 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:16:13,221 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 191 transitions. [2019-08-05 11:16:13,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:16:13,222 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:13,222 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 8, 8, 8, 8, 8, 8, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:16:13,222 INFO L418 AbstractCegarLoop]: === Iteration 324 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:13,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:13,222 INFO L82 PathProgramCache]: Analyzing trace with hash 225878206, now seen corresponding path program 320 times [2019-08-05 11:16:13,223 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:13,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:13,229 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 11:16:13,230 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:13,472 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 12 proven. 231 refuted. 0 times theorem prover too weak. 193 trivial. 0 not checked. [2019-08-05 11:16:13,472 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:13,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:16:13,473 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:16:13,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:16:13,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=694, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:16:13,473 INFO L87 Difference]: Start difference. First operand 165 states and 191 transitions. Second operand 29 states. [2019-08-05 11:16:13,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:13,892 INFO L93 Difference]: Finished difference Result 293 states and 340 transitions. [2019-08-05 11:16:13,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:16:13,892 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:16:13,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:13,893 INFO L225 Difference]: With dead ends: 293 [2019-08-05 11:16:13,893 INFO L226 Difference]: Without dead ends: 293 [2019-08-05 11:16:13,894 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=292, Invalid=1600, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 11:16:13,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2019-08-05 11:16:13,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 153. [2019-08-05 11:16:13,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-08-05 11:16:13,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 177 transitions. [2019-08-05 11:16:13,898 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 177 transitions. Word has length 101 [2019-08-05 11:16:13,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:13,898 INFO L475 AbstractCegarLoop]: Abstraction has 153 states and 177 transitions. [2019-08-05 11:16:13,898 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:16:13,899 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 177 transitions. [2019-08-05 11:16:13,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:16:13,899 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:13,899 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 9, 9, 9, 9, 9, 9, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:16:13,899 INFO L418 AbstractCegarLoop]: === Iteration 325 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:13,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:13,899 INFO L82 PathProgramCache]: Analyzing trace with hash 795128381, now seen corresponding path program 321 times [2019-08-05 11:16:13,900 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:13,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:13,906 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 11:16:13,907 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:14,170 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 6 proven. 248 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2019-08-05 11:16:14,170 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:14,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:16:14,170 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:16:14,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:16:14,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=676, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:16:14,171 INFO L87 Difference]: Start difference. First operand 153 states and 177 transitions. Second operand 29 states. [2019-08-05 11:16:14,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:14,523 INFO L93 Difference]: Finished difference Result 289 states and 332 transitions. [2019-08-05 11:16:14,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:16:14,524 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:16:14,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:14,525 INFO L225 Difference]: With dead ends: 289 [2019-08-05 11:16:14,525 INFO L226 Difference]: Without dead ends: 289 [2019-08-05 11:16:14,526 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=289, Invalid=1351, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:16:14,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-08-05 11:16:14,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 149. [2019-08-05 11:16:14,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-08-05 11:16:14,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 172 transitions. [2019-08-05 11:16:14,530 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 172 transitions. Word has length 101 [2019-08-05 11:16:14,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:14,530 INFO L475 AbstractCegarLoop]: Abstraction has 149 states and 172 transitions. [2019-08-05 11:16:14,530 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:16:14,530 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 172 transitions. [2019-08-05 11:16:14,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:16:14,530 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:14,530 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 7, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1] [2019-08-05 11:16:14,531 INFO L418 AbstractCegarLoop]: === Iteration 326 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:14,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:14,531 INFO L82 PathProgramCache]: Analyzing trace with hash 254139327, now seen corresponding path program 322 times [2019-08-05 11:16:14,531 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:14,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:14,537 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 11:16:14,537 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:14,774 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 15 proven. 221 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2019-08-05 11:16:14,774 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:14,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:16:14,775 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:16:14,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:16:14,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=698, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:16:14,775 INFO L87 Difference]: Start difference. First operand 149 states and 172 transitions. Second operand 29 states. [2019-08-05 11:16:15,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:15,380 INFO L93 Difference]: Finished difference Result 281 states and 321 transitions. [2019-08-05 11:16:15,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:16:15,380 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:16:15,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:15,381 INFO L225 Difference]: With dead ends: 281 [2019-08-05 11:16:15,381 INFO L226 Difference]: Without dead ends: 281 [2019-08-05 11:16:15,381 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 284 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=291, Invalid=1689, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 11:16:15,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-08-05 11:16:15,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 161. [2019-08-05 11:16:15,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-08-05 11:16:15,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 186 transitions. [2019-08-05 11:16:15,384 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 186 transitions. Word has length 101 [2019-08-05 11:16:15,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:15,384 INFO L475 AbstractCegarLoop]: Abstraction has 161 states and 186 transitions. [2019-08-05 11:16:15,385 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:16:15,385 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 186 transitions. [2019-08-05 11:16:15,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:16:15,385 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:15,385 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 9, 9, 9, 9, 9, 9, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:16:15,386 INFO L418 AbstractCegarLoop]: === Iteration 327 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:15,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:15,386 INFO L82 PathProgramCache]: Analyzing trace with hash 90373309, now seen corresponding path program 323 times [2019-08-05 11:16:15,386 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:15,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:15,395 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 11:16:15,396 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:15,710 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 7 proven. 247 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2019-08-05 11:16:15,710 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:15,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:16:15,710 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:16:15,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:16:15,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=676, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:16:15,711 INFO L87 Difference]: Start difference. First operand 161 states and 186 transitions. Second operand 29 states. [2019-08-05 11:16:16,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:16,078 INFO L93 Difference]: Finished difference Result 305 states and 352 transitions. [2019-08-05 11:16:16,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:16:16,078 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:16:16,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:16,079 INFO L225 Difference]: With dead ends: 305 [2019-08-05 11:16:16,079 INFO L226 Difference]: Without dead ends: 305 [2019-08-05 11:16:16,079 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=289, Invalid=1351, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:16:16,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2019-08-05 11:16:16,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 169. [2019-08-05 11:16:16,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-08-05 11:16:16,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 195 transitions. [2019-08-05 11:16:16,084 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 195 transitions. Word has length 101 [2019-08-05 11:16:16,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:16,084 INFO L475 AbstractCegarLoop]: Abstraction has 169 states and 195 transitions. [2019-08-05 11:16:16,084 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:16:16,084 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 195 transitions. [2019-08-05 11:16:16,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:16:16,085 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:16,085 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 8, 8, 8, 8, 8, 8, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:16:16,085 INFO L418 AbstractCegarLoop]: === Iteration 328 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:16,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:16,085 INFO L82 PathProgramCache]: Analyzing trace with hash 1241039422, now seen corresponding path program 324 times [2019-08-05 11:16:16,086 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:16,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:16,092 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:16:16,093 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:16,327 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 8 proven. 231 refuted. 0 times theorem prover too weak. 197 trivial. 0 not checked. [2019-08-05 11:16:16,327 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:16,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:16:16,327 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:16:16,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:16:16,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=699, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:16:16,328 INFO L87 Difference]: Start difference. First operand 169 states and 195 transitions. Second operand 29 states. [2019-08-05 11:16:16,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:16,767 INFO L93 Difference]: Finished difference Result 305 states and 347 transitions. [2019-08-05 11:16:16,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:16:16,767 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:16:16,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:16,768 INFO L225 Difference]: With dead ends: 305 [2019-08-05 11:16:16,768 INFO L226 Difference]: Without dead ends: 305 [2019-08-05 11:16:16,769 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 315 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=306, Invalid=1764, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 11:16:16,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2019-08-05 11:16:16,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 157. [2019-08-05 11:16:16,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-08-05 11:16:16,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 181 transitions. [2019-08-05 11:16:16,773 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 181 transitions. Word has length 101 [2019-08-05 11:16:16,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:16,773 INFO L475 AbstractCegarLoop]: Abstraction has 157 states and 181 transitions. [2019-08-05 11:16:16,773 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:16:16,773 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 181 transitions. [2019-08-05 11:16:16,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:16:16,773 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:16,773 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 8, 8, 8, 8, 8, 8, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:16:16,774 INFO L418 AbstractCegarLoop]: === Iteration 329 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:16,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:16,774 INFO L82 PathProgramCache]: Analyzing trace with hash -896526786, now seen corresponding path program 325 times [2019-08-05 11:16:16,774 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:16,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:16,780 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 33 conjunts are in the unsatisfiable core [2019-08-05 11:16:16,781 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:17,034 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 12 proven. 231 refuted. 0 times theorem prover too weak. 193 trivial. 0 not checked. [2019-08-05 11:16:17,034 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:17,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:16:17,035 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:16:17,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:16:17,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=685, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:16:17,035 INFO L87 Difference]: Start difference. First operand 157 states and 181 transitions. Second operand 29 states. [2019-08-05 11:16:17,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:17,376 INFO L93 Difference]: Finished difference Result 277 states and 320 transitions. [2019-08-05 11:16:17,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:16:17,376 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:16:17,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:17,377 INFO L225 Difference]: With dead ends: 277 [2019-08-05 11:16:17,377 INFO L226 Difference]: Without dead ends: 277 [2019-08-05 11:16:17,377 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=275, Invalid=1365, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:16:17,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2019-08-05 11:16:17,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 149. [2019-08-05 11:16:17,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-08-05 11:16:17,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 172 transitions. [2019-08-05 11:16:17,381 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 172 transitions. Word has length 101 [2019-08-05 11:16:17,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:17,381 INFO L475 AbstractCegarLoop]: Abstraction has 149 states and 172 transitions. [2019-08-05 11:16:17,381 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:16:17,381 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 172 transitions. [2019-08-05 11:16:17,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:16:17,381 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:17,382 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 9, 9, 9, 9, 9, 9, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:16:17,382 INFO L418 AbstractCegarLoop]: === Iteration 330 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:17,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:17,382 INFO L82 PathProgramCache]: Analyzing trace with hash 1212778301, now seen corresponding path program 326 times [2019-08-05 11:16:17,382 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:17,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:17,388 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:16:17,389 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:17,636 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 5 proven. 245 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2019-08-05 11:16:17,637 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:17,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:16:17,637 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:16:17,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:16:17,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=688, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:16:17,637 INFO L87 Difference]: Start difference. First operand 149 states and 172 transitions. Second operand 29 states. [2019-08-05 11:16:18,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:18,083 INFO L93 Difference]: Finished difference Result 293 states and 339 transitions. [2019-08-05 11:16:18,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:16:18,083 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:16:18,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:18,084 INFO L225 Difference]: With dead ends: 293 [2019-08-05 11:16:18,084 INFO L226 Difference]: Without dead ends: 293 [2019-08-05 11:16:18,085 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 284 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=316, Invalid=1664, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 11:16:18,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2019-08-05 11:16:18,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 161. [2019-08-05 11:16:18,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-08-05 11:16:18,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 186 transitions. [2019-08-05 11:16:18,089 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 186 transitions. Word has length 101 [2019-08-05 11:16:18,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:18,089 INFO L475 AbstractCegarLoop]: Abstraction has 161 states and 186 transitions. [2019-08-05 11:16:18,089 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:16:18,089 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 186 transitions. [2019-08-05 11:16:18,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:16:18,090 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:18,090 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 8, 8, 8, 8, 8, 8, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:16:18,090 INFO L418 AbstractCegarLoop]: === Iteration 331 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:18,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:18,090 INFO L82 PathProgramCache]: Analyzing trace with hash -1931522882, now seen corresponding path program 327 times [2019-08-05 11:16:18,091 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:18,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:18,097 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:16:18,098 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:18,332 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 6 proven. 233 refuted. 0 times theorem prover too weak. 197 trivial. 0 not checked. [2019-08-05 11:16:18,333 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:18,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:16:18,333 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:16:18,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:16:18,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=699, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:16:18,333 INFO L87 Difference]: Start difference. First operand 161 states and 186 transitions. Second operand 29 states. [2019-08-05 11:16:18,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:18,802 INFO L93 Difference]: Finished difference Result 293 states and 334 transitions. [2019-08-05 11:16:18,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:16:18,802 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:16:18,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:18,803 INFO L225 Difference]: With dead ends: 293 [2019-08-05 11:16:18,803 INFO L226 Difference]: Without dead ends: 293 [2019-08-05 11:16:18,804 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 327 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=314, Invalid=1848, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 11:16:18,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2019-08-05 11:16:18,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 157. [2019-08-05 11:16:18,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-08-05 11:16:18,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 181 transitions. [2019-08-05 11:16:18,807 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 181 transitions. Word has length 101 [2019-08-05 11:16:18,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:18,808 INFO L475 AbstractCegarLoop]: Abstraction has 157 states and 181 transitions. [2019-08-05 11:16:18,808 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:16:18,808 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 181 transitions. [2019-08-05 11:16:18,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:16:18,808 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:18,808 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 8, 8, 8, 8, 8, 8, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:16:18,808 INFO L418 AbstractCegarLoop]: === Iteration 332 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:18,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:18,809 INFO L82 PathProgramCache]: Analyzing trace with hash 2090161982, now seen corresponding path program 328 times [2019-08-05 11:16:18,809 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:18,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:18,815 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:16:18,816 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:19,055 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 4 proven. 235 refuted. 0 times theorem prover too weak. 197 trivial. 0 not checked. [2019-08-05 11:16:19,055 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:19,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:16:19,055 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:16:19,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:16:19,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=699, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:16:19,056 INFO L87 Difference]: Start difference. First operand 157 states and 181 transitions. Second operand 29 states. [2019-08-05 11:16:19,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:19,552 INFO L93 Difference]: Finished difference Result 293 states and 335 transitions. [2019-08-05 11:16:19,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 11:16:19,553 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:16:19,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:19,554 INFO L225 Difference]: With dead ends: 293 [2019-08-05 11:16:19,554 INFO L226 Difference]: Without dead ends: 293 [2019-08-05 11:16:19,554 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 345 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=326, Invalid=1930, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 11:16:19,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2019-08-05 11:16:19,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 137. [2019-08-05 11:16:19,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-08-05 11:16:19,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 158 transitions. [2019-08-05 11:16:19,559 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 158 transitions. Word has length 101 [2019-08-05 11:16:19,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:19,559 INFO L475 AbstractCegarLoop]: Abstraction has 137 states and 158 transitions. [2019-08-05 11:16:19,559 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:16:19,559 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 158 transitions. [2019-08-05 11:16:19,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:16:19,559 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:19,560 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 10, 10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:16:19,560 INFO L418 AbstractCegarLoop]: === Iteration 333 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:19,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:19,560 INFO L82 PathProgramCache]: Analyzing trace with hash 1282944188, now seen corresponding path program 329 times [2019-08-05 11:16:19,560 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:19,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:19,567 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:16:19,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:19,809 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 7 proven. 258 refuted. 0 times theorem prover too weak. 219 trivial. 0 not checked. [2019-08-05 11:16:19,809 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:19,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:16:19,809 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:16:19,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:16:19,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=663, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:16:19,810 INFO L87 Difference]: Start difference. First operand 137 states and 158 transitions. Second operand 29 states. [2019-08-05 11:16:20,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:20,155 INFO L93 Difference]: Finished difference Result 265 states and 307 transitions. [2019-08-05 11:16:20,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:16:20,156 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:16:20,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:20,156 INFO L225 Difference]: With dead ends: 265 [2019-08-05 11:16:20,156 INFO L226 Difference]: Without dead ends: 265 [2019-08-05 11:16:20,157 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=309, Invalid=1331, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:16:20,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2019-08-05 11:16:20,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 161. [2019-08-05 11:16:20,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-08-05 11:16:20,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 187 transitions. [2019-08-05 11:16:20,161 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 187 transitions. Word has length 101 [2019-08-05 11:16:20,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:20,161 INFO L475 AbstractCegarLoop]: Abstraction has 161 states and 187 transitions. [2019-08-05 11:16:20,161 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:16:20,161 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 187 transitions. [2019-08-05 11:16:20,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:16:20,162 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:20,162 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 8, 8, 8, 8, 8, 8, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:16:20,162 INFO L418 AbstractCegarLoop]: === Iteration 334 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:20,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:20,162 INFO L82 PathProgramCache]: Analyzing trace with hash -191771714, now seen corresponding path program 330 times [2019-08-05 11:16:20,163 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:20,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:20,169 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 33 conjunts are in the unsatisfiable core [2019-08-05 11:16:20,170 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:20,647 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 11 proven. 232 refuted. 0 times theorem prover too weak. 193 trivial. 0 not checked. [2019-08-05 11:16:20,647 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:20,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:16:20,647 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:16:20,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:16:20,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=685, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:16:20,648 INFO L87 Difference]: Start difference. First operand 161 states and 187 transitions. Second operand 29 states. [2019-08-05 11:16:21,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:21,004 INFO L93 Difference]: Finished difference Result 301 states and 349 transitions. [2019-08-05 11:16:21,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:16:21,004 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:16:21,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:21,005 INFO L225 Difference]: With dead ends: 301 [2019-08-05 11:16:21,005 INFO L226 Difference]: Without dead ends: 301 [2019-08-05 11:16:21,006 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=275, Invalid=1365, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:16:21,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2019-08-05 11:16:21,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 165. [2019-08-05 11:16:21,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-08-05 11:16:21,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 192 transitions. [2019-08-05 11:16:21,010 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 192 transitions. Word has length 101 [2019-08-05 11:16:21,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:21,010 INFO L475 AbstractCegarLoop]: Abstraction has 165 states and 192 transitions. [2019-08-05 11:16:21,010 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:16:21,010 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 192 transitions. [2019-08-05 11:16:21,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:16:21,010 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:21,011 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 8, 8, 8, 8, 8, 8, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:16:21,011 INFO L418 AbstractCegarLoop]: === Iteration 335 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:21,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:21,011 INFO L82 PathProgramCache]: Analyzing trace with hash 81510718, now seen corresponding path program 331 times [2019-08-05 11:16:21,011 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:21,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:21,017 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 11:16:21,018 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:21,249 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 14 proven. 229 refuted. 0 times theorem prover too weak. 193 trivial. 0 not checked. [2019-08-05 11:16:21,249 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:21,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:16:21,249 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:16:21,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:16:21,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=694, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:16:21,250 INFO L87 Difference]: Start difference. First operand 165 states and 192 transitions. Second operand 29 states. Received shutdown request... [2019-08-05 11:16:21,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:16:21,283 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-05 11:16:21,288 WARN L223 ceAbstractionStarter]: Timeout [2019-08-05 11:16:21,289 INFO L202 PluginConnector]: Adding new model recursive-CallABAB_incorrect.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 11:16:21 BoogieIcfgContainer [2019-08-05 11:16:21,289 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 11:16:21,290 INFO L168 Benchmark]: Toolchain (without parser) took 231547.83 ms. Allocated memory was 141.6 MB in the beginning and 698.9 MB in the end (delta: 557.3 MB). Free memory was 111.0 MB in the beginning and 440.8 MB in the end (delta: -329.8 MB). Peak memory consumption was 227.5 MB. Max. memory is 7.1 GB. [2019-08-05 11:16:21,291 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 141.6 MB. Free memory was 112.3 MB in the beginning and 112.1 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-08-05 11:16:21,291 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.02 ms. Allocated memory is still 141.6 MB. Free memory was 111.0 MB in the beginning and 109.4 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2019-08-05 11:16:21,292 INFO L168 Benchmark]: Boogie Preprocessor took 20.60 ms. Allocated memory is still 141.6 MB. Free memory was 109.4 MB in the beginning and 108.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-08-05 11:16:21,292 INFO L168 Benchmark]: RCFGBuilder took 246.05 ms. Allocated memory is still 141.6 MB. Free memory was 108.1 MB in the beginning and 97.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 7.1 GB. [2019-08-05 11:16:21,293 INFO L168 Benchmark]: TraceAbstraction took 231241.24 ms. Allocated memory was 141.6 MB in the beginning and 698.9 MB in the end (delta: 557.3 MB). Free memory was 97.2 MB in the beginning and 440.8 MB in the end (delta: -343.6 MB). Peak memory consumption was 213.7 MB. Max. memory is 7.1 GB. [2019-08-05 11:16:21,295 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 141.6 MB. Free memory was 112.3 MB in the beginning and 112.1 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 35.02 ms. Allocated memory is still 141.6 MB. Free memory was 111.0 MB in the beginning and 109.4 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 20.60 ms. Allocated memory is still 141.6 MB. Free memory was 109.4 MB in the beginning and 108.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 246.05 ms. Allocated memory is still 141.6 MB. Free memory was 108.1 MB in the beginning and 97.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 231241.24 ms. Allocated memory was 141.6 MB in the beginning and 698.9 MB in the end (delta: 557.3 MB). Free memory was 97.2 MB in the beginning and 440.8 MB in the end (delta: -343.6 MB). Peak memory consumption was 213.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 14]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 14). Cancelled while BasicCegarLoop was constructing difference of abstraction (165states) and FLOYD_HOARE automaton (currently 3 states, 29 states before enhancement),while ReachableStatesComputation was computing reachable states (2 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 16 locations, 1 error locations. TIMEOUT Result, 231.1s OverallTime, 335 OverallIterations, 13 TraceHistogramMax, 124.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5470 SDtfs, 2925 SDslu, 52787 SDs, 0 SdLazy, 61449 SolverSat, 6170 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 51.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 32137 GetRequests, 20627 SyntacticMatches, 0 SemanticMatches, 11510 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59885 ImplicationChecksByTransitivity, 157.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=169occurred in iteration=295, 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: 1.4s AutomataMinimizationTime, 334 MinimizatonAttempts, 29288 StatesRemovedByMinimization, 332 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 2.1s SatisfiabilityAnalysisTime, 101.1s InterpolantComputationTime, 28611 NumberOfCodeBlocks, 28611 NumberOfCodeBlocksAsserted, 335 NumberOfCheckSat, 28276 ConstructedInterpolants, 0 QuantifiedInterpolants, 5168152 SizeOfPredicates, 1029 NumberOfNonLiveVariables, 72365 ConjunctsInSsa, 8427 ConjunctsInUnsatCore, 335 InterpolantComputations, 3 PerfectInterpolantSequences, 50294/108133 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown